Performance Analysis of Enhanced Clustering Algorithm for Gene Expression Data

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

ISSN (Online): 1694-0814 http://www.IJCSI.org

Scientific paper

Microarrays are made it possible to simultaneously monitor the expression profiles of thousands of genes under various experimental conditions. It is used to identify the co-expressed genes in specific cells or tissues that are actively used to make proteins. This method is used to analysis the gene expression, an important task in bioinformatics research. Cluster analysis of gene expression data has proved to be a useful tool for identifying co-expressed genes, biologically relevant groupings of genes and samples. In this paper we applied K-Means with Automatic Generations of Merge Factor for ISODATA- AGMFI. Though AGMFI has been applied for clustering of Gene Expression Data, this proposed Enhanced Automatic Generations of Merge Factor for ISODATA- EAGMFI Algorithms overcome the drawbacks of AGMFI in terms of specifying the optimal number of clusters and initialization of good cluster centroids. Experimental results on Gene Expression Data show that the proposed EAGMFI algorithms could identify compact clusters with perform well in terms of the Silhouette Coefficients cluster measure.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Performance Analysis of Enhanced Clustering Algorithm for Gene Expression Data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Performance Analysis of Enhanced Clustering Algorithm for Gene Expression Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance Analysis of Enhanced Clustering Algorithm for Gene Expression Data will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-210253

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.