Individual Clustering and Homogeneous Cluster Ensemble Approaches Applied to Gene Expression Data

  title={Individual Clustering and Homogeneous Cluster Ensemble Approaches Applied to Gene Expression Data},
  author={Shirlly C. M. Silva and Daniel de Ara{\'u}jo and Raul Benites Paradeda and Valmar S. Severiano-Sobrinho and Marc{\'i}lio Carlos Pereira de Souto},
  booktitle={Australian Conference on Artificial Intelligence},
Exploratory data analysis and, in particular, data clustering can significantly benefit from combining multiple data partitions – cluster ensemble. In this context, we analyze the potential of applying cluster ensemble techniques to gene expression microarray data. Our experimental results show that there is often a significant improvement in the results obtained with the use of ensemble techniques when compared to those based on the clustering techniques used individually. 


Consensus Clustering: A Resampling-Based Method for Class Discovery and Visualization of Gene Expression Microarray Data
A new methodology of class discovery and clustering validation tailored to the task of analyzing gene expression data is presented, and in conjunction with resampling techniques, it provides for a method to represent the consensus across multiple runs of a clustering algorithm and to assess the stability of the discovered clusters.
Evaluation of the Contents of Partitions Obtained with Clustering Gene Expression Data
This work investigates the behavior of two different clustering algorithms, with two proximity measures, in terms of the contents of the partitions obtained with them. An analysis of how the classes
Comparative study on proximity indices for cluster analysis of gene expression time series
A comparative study of proximity indices broadly used in the literature is accomplished in this work, and versions of three distinct proximity indices are compared: Euclidean distance, Pearson correlation and angular separation.
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings and proposes three effective and efficient techniques for obtaining high-quality combiners (consensus functions).
A Combination Scheme for Fuzzy Clustering
This voting method allows us to combine several runs of cluster algorithms resulting in a common partition to tackle the problem of choosing the appropriate clustering method for a data set where the authors have no a priori information about it.
Combining Pattern Classifiers: Methods and Algorithms
This combining pattern classifiers methods and algorithms helps people to enjoy a good book with a cup of coffee in the afternoon, instead they cope with some harmful virus inside their computer.