FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data.
BACKGROUND
Data clustering analysis has been extensively applied to extract information from gene expression profiles obtained with DNA microarrays. To this aim, existing clustering approaches, mainly developed in computer science, have been adapted to microarray data analysis. However, previous studies revealed that microarray datasets have very diverse structures, some of which may not be correctly captured by current clustering methods. We therefore approached the problem from a new starting point, and developed a clustering algorithm designed to capture dataset-specific structures at the beginning of the process.


RESULTS
The clustering algorithm is named Fuzzy clustering by Local Approximation of MEmbership (FLAME). Distinctive elements of FLAME are: (i) definition of the neighborhood of each object (gene or sample) and identification of objects with "archetypal" features named Cluster Supporting Objects, around which to construct the clusters; (ii) assignment to each object of a fuzzy membership vector approximated from the memberships of its neighboring objects, by an iterative converging process in which membership spreads from the Cluster Supporting Objects through their neighbors. Comparative analysis with K-means, hierarchical, fuzzy C-means and fuzzy self-organizing maps (SOM) showed that data partitions generated by FLAME are not superimposable to those of other methods and, although different types of datasets are better partitioned by different algorithms, FLAME displays the best overall performance. FLAME is implemented, together with all the above-mentioned algorithms, in a C++ software with graphical interface for Linux and Windows, capable of handling very large datasets, named Gene Expression Data Analysis Studio (GEDAS), freely available under GNU General Public License.


CONCLUSIONS
The FLAME algorithm has intrinsic advantages, such as the ability to capture non-linear relationships and non-globular clusters, the automated definition of the number of clusters, and the identification of cluster outliers, i.e. genes that are not assigned to any cluster. As a result, clusters are more internally homogeneous and more diverse from each other, and provide better partitioning of biological functions. The clustering algorithm can be easily extended to applications different from gene expression analysis.
Fu
Limin
L
Laboratory of Functional Genomics, The Oncogenomics Center, Institute for Cancer Research and Treatment, University of Torino, School of Medicine, 10060 Candiolo, Italy. limin.fu@ircc.it <limin.fu@ircc.it>
Medico
Enzo
E
D000465:Algorithms; D000818:Animals; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D030541:Databases, Genetic; D023281:Genomics / Q000379:methods*; D006801:Humans; D000860:Hypoxia; D051379:Mice; D008957:Models, Genetic; D015233:Models, Statistical; D020411:Oligonucleotide Array Sequence Analysis; D010363:Pattern Recognition, Automated; D011381:Programming Languages; D012984:Software