Weighted rank aggregation of cluster validation measures: a Monte Carlo cross-entropy approach

@article{Pihur2007WeightedRA,
  title={Weighted rank aggregation of cluster validation measures: a Monte Carlo cross-entropy approach},
  author={Vasyl Pihur and Susmita Datta and Somnath Datta},
  journal={Bioinformatics},
  year={2007},
  volume={23 13},
  pages={
          1607-15
        }
}
MOTIVATION Biologists often employ clustering techniques in the explorative phase of microarray data analysis to discover relevant biological groupings. Given the availability of numerous clustering algorithms in the machine-learning literature, an user might want to select one that performs the best for his/her data set or application. While various validation measures have been proposed over the years to judge the quality of clusters produced by a given clustering algorithm including their… 
View on PubMed
genet.univ-tours.fr
158 Citations
Highly Influential Citations
3
Background Citations
21
Methods Citations
51

158 Citations

Citation Type

Citation Type

optCluster: An R Package for Determining the Optimal Clustering Algorithm
TLDR
The optCluster package is introduced, an R package that uses a single function to simultaneously compare numerous clustering partitions and obtain a “best” option for a given dataset.
Robust rank aggregation for gene list integration and meta-analysis
TLDR
This work proposes a novel robust rank aggregation (RRA) method that detects genes that are ranked consistently better than expected under null hypothesis of uncorrelated inputs and assigns a significance score for each gene.
On strategies for building effective ensembles of relative clustering validity criteria
TLDR
This paper proposes a method for selecting measures with minimum effectiveness and some degree of complementarity into ensembles, which show superior performance when compared to any single ensemble member (and not just the worst one) over a variety of different datasets.
How Many Clusters: A Validation Index for Arbitrary-Shaped Clusters
TLDR
A new validation index based on graph concepts is presented, which has been designed to find arbitrary shaped clusters by exploiting the spatial layout of the patterns and their clustering label, combined with a solid statistical detection framework, the gap statistic.
RankAggreg, an R package for weighted rank aggregation
TLDR
The two examples described in the manuscript clearly show the utility of the RankAggreg package in the current bioinformatics context where ordered lists are routinely produced as a result of modern high-throughput technologies.
MicroClAn: Microarray clustering analysis
On the combination of relative clustering validity criteria
TLDR
An extensive study on the combination of relative criteria considering both synthetic and real datasets is presented and the shortcomings and possible benefits of combining different relative criteria into a committee are discussed.
Entropy steered Kendall's tau measure for a fair Rank Aggregation
TLDR
An important drawback of the Kendall's tau distance is pointed out and a modified measure is proposed by using Shanon's Entropy formula, which explains its benefit through some artificial and real data.
Weighted Markov Chain Based Aggregation of Biomolecule Orderings
TLDR
Effectiveness of the weighted Markov chain approach over the very recently proposed Genetic Algorithm and Cross-Entropy Monte Carlo (MC) algorithm-based techniques, has been established for gene orderings from microarray analysis and orderings of predicted microRNA targets.
Integration of ranked lists via cross entropy Monte Carlo with applications to mRNA and microRNA Studies.
TLDR
Formulating the problem of integrating ranked lists as minimizing an objective criterion, this work explores the usage of a cross entropy Monte Carlo method for solving such a combinatorial problem.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Methods for evaluating clustering algorithms for gene expression data using a reference set of functional classes
TLDR
Functional information of annotated genes available from various GO databases mined using ontology tools can be used to systematically judge the results of an unsupervised clustering algorithm as applied to a gene expression data set in clustering genes.
Comparisons and validation of statistical clustering techniques for microarray gene expression data
TLDR
Six clustering algorithms are considered and it is shown that the group means produced by Diana are the closest and those produced by UPGMA are the farthest from a model profile based on a set of hand-picked genes.
Validating clustering for gene expression data
TLDR
This work provides a systematic framework for assessing the results of clustering algorithms for gene expression data sets by applying a clustering algorithm to the data from all but one experimental condition.
Exploiting the Trade-off - The Benefits of Multiple Objectives in Data Clustering
TLDR
An advanced multiobjective clustering algorithm, MOCK, with the capacity to identify good solutions from the Pareto front, and to automatically determine the number of clusters in a data set is described.
Evolutionary Multiobjective Clustering
TLDR
The PESA-II EA is adapted for the clustering problem by the incorporation of specialized mutation and initialization procedures, described herein, which exhibits a far more robust level of performance than both the classic k-means and average-link agglomerative clustering algorithms, outperforming them substantially on aggregate.
Computational cluster validation in post-genomic data analysis
TLDR
This review paper aims to familiarize the reader with the battery of techniques available for the validation of clustering results, with a particular focus on their application to post-genomic data analysis.
Multiobjective data clustering
TLDR
A new clustering approach that uses multiple clustering objective functions simultaneously and includes detection of clusters by a set of candidate objective functions as well as their integration into the target partition.
A hierarchical unsupervised growing neural network for clustering gene expression patterns
TLDR
A new approach to the analysis of gene expression data coming from DNA array experiments, using an unsupervised neural network that applies to any data providing that they can be coded as a series of numbers and that a computable measure of similarity between data items can be used.
Model-based Gaussian and non-Gaussian clustering
TLDR
The classification maximum likelihood approach is sufficiently general to encompass many current clustering algorithms, including those based on the sum of squares criterion and on the criterion of Friedman and Rubin (1967), but it is restricted to Gaussian distributions and it does not allow for noise.
Combinatorial Optimization, Cross-Entropy, Ants and Rare Events
TLDR
It is shown how to solve network combinatorial optimization problems using a randomized algorithm based on the cross-entropy method, and it is shown that for a finite sample the algorithm converges with very high probability to a very small subset of the optimal values.
...
1
2
3
4
...