DOI:10.1109/ICPR.2004.128
Corpus ID: 121115537
Adaptive clustering ensembles
A. Topchy, B. Minaei-Bidgoli, +1 author W. Punch
Published in ICPR 2004
Mathematics
Clustering ensembles combine multiple partitions of the given data into a single clustering solution of better quality. Inspired by the success of supervised boosting algorithms, we devise an… Expand
View Via Publisher
Share This Paper




103 Citations
Highly Influential Citations
6
Background Citations
32
Methods Citations
33
103 Citations
A Survey: Clustering Ensembles Techniques
R. Ghaemi, M. N. Sulaiman, H. Ibrahim, N. Mustapha
Computer Science
2009
TLDR
The clustering ensembles combine multiple partitions generated by different clustering algorithms into a single clustering solution, representation of multiple partitions, its challenges and present taxonomy of combination algorithms. Expand
162 Citations
PDF
Clustering Ensembles Using Ants Algorithm
J. Azimi, P. Cull, Xiaoli Z. Fern
Computer Science
IWINAC

2009
TLDR
A new consensus function based on the Ant Colony Algorithms is introduced, which can automatically determine the number of clusters and produce highly competitive final clusters and provides a natural way to determine outlier and marginal examples in the data. Expand
17 Citations
PDF
Average Cluster Consistency for Cluster Ensemble Selection
F. J. Duarte, J. Duarte, A. Fred, F. Rodrigues
Computer Science
IC3K

2009
TLDR
A new measure to select the best consensus data partition, among a variety of consensus partitions, based on the concept of average cluster consistency between each data partition that belongs to the cluster ensemble and a given consensus partition is proposed. Expand
3 Citations
Resampling-based selective clustering ensembles
Yi Hong, S. Kwong, Hanli Wang, Qingsheng Ren
Computer SciencePattern Recognit. Lett.
2009
TLDR
Experimental results on several real data sets demonstrate that resampling-based selective clustering ensembles method is often able to achieve a better solution when compared with traditional clusteringEnsembles methods. Expand
47 Citations
PDF
Cluster Ensemble Selection - Using Average Cluster Consistency
F. J. Duarte, J. Duarte, F. Rodrigues, A. Fred
Computer Science
KDIR

2009
TLDR
A new measure to select the best consensus data partition, among a variety of consensus partitions, based on a notion of average cluster consistency between each data partition that belongs to the cluster ensemble and a given consensus partition is proposed. Expand
3 Citations
PDF
Weighted Clustering Ensemble: A Review
Mimi Zhang
Computer Science, MathematicsArXiv
2019
TLDR
The unifying framework presented in this paper will help clustering practitioners select the most appropriate weighting mechanisms for their own problems by discussing different types of weights, major approaches to determining weight values, and applications of weighted clustering ensemble to complex data.Expand
3 Citations
PDF
A New Efficient Approach in Clustering Ensembles
J. Azimi, M. Abdoos, M. Analoui
Mathematics, Computer ScienceIDEAL
2007
TLDR
A new clustering ensemble method, which generates a new feature space from initial clustering outputs, using a modification of k-means forInitial clustering runs named as "Intelligent k-Means", which is especially defined for clustering ensembles. Expand
21 Citations
PDF
Clustering Ensemble Based on Hierarchical Partition
T. Li, Y. Chen
Computer Science
2009 International Conference on Management and Service Science
2009
TLDR
The hierarchical partition is introduced in this paper and the proposed algorithm makes use of the distribution of results of all clustering memberships by constructing the m subset of Descartes with the support degree. Expand
Bagging-based spectral clustering ensemble selection
Jianhua Jia, X. Xiao, B. Liu, L. Jiao
Mathematics, Computer Science
Pattern Recognit. Lett.
2011
TLDR
A novel clustering ensemble method, SELective Spectral Clustering Ensemble (SELSCE), is proposed and the experimental results demonstrate that the proposed algorithm can achieve a better result than the traditional clusteringsemble methods. Expand
70 Citations
Optimized Ensembles for Clustering Noisy Data
Mihaela Breaban
Computer Science
LION

2010
TLDR
A method which integrates unsupervised feature selection with ensemble clustering in order to deliver more accurate partitions is presented and the efficiency of the method is studied on real data sets. Expand
1 Citation
...
1
2
3
4
...
References
SHOWING 1-10 OF 12 REFERENCES
Ensembles of partitions via data resampling
B. Minaei-Bidgoli, A. Topchy, W. Punch
Computer Science
International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004.
2004
TLDR
A data resampling approach for building cluster ensembles that are both robust and stable is proposed, and the effectiveness of a bootstrapping technique in conjunction with several combination algorithms is investigated.Expand
133 Citations
PDF
A Mixture Model for Clustering Ensembles
A. Topchy, Anil K. Jain, W. Punch
Computer Science
SDM

2004
TLDR
A probabilistic model of consensus using a finite mixture of multinomial distributions in a space of clusterings is offered and a combined partition is found as a solution to the corresponding maximum likelihood problem using the EM algorithm.Expand
Combining multiple weak clusterings
A. Topchy, Anil K. Jain, W. Punch
Mathematics, Computer Science
Third IEEE International Conference on Data Mining
2003
TLDR
This work introduces a unified representation for multiple clusterings and forms the corresponding categorical clustering problem, and shows that the consensus function is related to the classical intra-class variance criterion using the generalized mutual information definition. Expand
354 Citations
PDF
Data clustering using evidence accumulation
A. Fred, Anil K. Jain
Mathematics, Computer Science
Object recognition supported by user interaction for service robots
2002
TLDR
Results on both synthetic and real data show the ability of the K-means method to identify arbitrary shaped clusters in multidimensional data. Expand
519 Citations
PDF
Random Projection for High Dimensional Data Clustering: A Cluster Ensemble Approach
Xiaoli Z. Fern, C. Brodley
Mathematics, Computer ScienceICML
2003
TLDR
Empirical results show that the proposed approach achieves better and more robust clustering performance compared to not only single runs of random projection/clustering but also clustering with PCA, a traditional data reduction method for high dimensional data. Expand
660 Citations
PDF
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions
A. Strehl, Joydeep Ghosh
Mathematics, Computer Science
J. Mach. Learn. Res.
2002
TLDR
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).Expand
Bagging for Path-Based Clustering
B. Fischer, J. Buhmann
Mathematics, Computer Science
IEEE Trans. Pattern Anal. Mach. Intell.
2003
A resampling scheme for clustering with similarity to bootstrap aggregation (bagging) is presented. Bagging is used to improve the quality of path-based clustering, a data clustering method that can… Expand
Bagging to Improve the Accuracy of A Clustering Procedure
S. Dudoit, J. Fridlyand
Medicine, Computer ScienceBioinform.
2003
TLDR
Two new resampling methods, inspired from bagging in prediction, are proposed to improve and assess the accuracy of a given clustering procedure to solve the problem of accurate partitioning of tumor samples into clusters. Expand
The bootstrap approach to clustering
J. Moreau, Anil K. Jain
Computer Science
1987
TLDR
A very difficult problem in cluster analysis is to determine the number of clusters present in a data set, and it is very hard to decide if a K-cluster structure makes sense for the given data set. Expand
17 Citations
Path-Based Clustering for Grouping of Smooth Curves and Texture Segmentation
B. Fischer, J. Buhmann
Mathematics, Computer Science
IEEE Trans. Pattern Anal. Mach. Intell.
2003
TLDR
A novel grouping method is proposed, which stresses connectedness of image elements via mediating elements rather than favoring high mutual similarity, which yields superior clustering results when objects are distributed on low-dimensional extended manifolds in a feature space, and not as local point clouds. Expand
...
1
2
...
SORT BY
Related Papers
Analysis of consensus partition in cluster ensemble
A. Topchy, Martin H. C. Law, Anil K. Jain, A. Fred
Mathematics, Computer Science
Fourth IEEE International Conference on Data…
2004
In combination of multiple partitions, one is usually interested in deriving a consensus solution with a quality better ...
164 Citations
Robust data clustering
A. Fred, Anil K. Jain
Mathematics, Computer Science
IEEE Computer Society Conference on Computer…
2003
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by mul...
345 Citations
Show More
2/10
Abstract
103 Citations
12 References
Related Papers
Stay Connected With Semantic Scholar
What Is Semantic Scholar?
Semantic Scholar is a free, AI-powered research tool for scientific literature, based at the Allen Institute for AI.
Learn More
About
About Us
Publishers
Beta Program
Contact
Research
Team
Datasets
Open Corpus
Supp.ai
Resources
Librarians
Tutorials
FAQ
API
Proudly built by AI2
Terms of ServicePrivacy Policy
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE