Maximum likelihood combination of multiple clusterings
Pattern Recognition LettersPublished 12 June 2006
Tianming Hu, Ying Yu, Jinzhi Xiong, Sam Yuan Sung
Citations15
SJR quartileQ1
SJR score1.00
SNIP1.43
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Two combining methods based on the new similarity determined by the whole candidate set are presented and it is shown that they not only lead to a closer distance to the candidate set, but also achieve a smaller or comparable Distance to the true clustering.
Abstract
A promising direction for more robust clustering is to derive multiple candidate clusterings over a common set of objects and then combine them into a consolidated one, which is expected to be better than any candidate. Given a candidate clustering set, we show that with a particular pairwise potential used in Markov random fields, the maximum likelihood estimation is the one closest to the set in terms of a metric distance between clusterings. To minimize such a distance, we present two combining methods based on the new similarity determined by the whole candidate set. We evaluate them on both artificial and real datasets, with candidate clusterings either from full space or subspace. Experiments show that they not only lead to a closer distance to the candidate set, but also achieve a smaller or comparable distance to the true clustering.
Keywords
Computer Science
IEEE Transactions on Pattern Analysis and Machine IntelligenceStochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
17,980 Citations1984Stuart Geman, Donald Geman
The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
ACM Computing SurveysData clustering
13,184 Citations1999Anil K. Jain, M. Narasimha Murty +1 more
An overview of pattern clustering methods from a statistical pattern recognition perspective is presented, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners.
Lecture notes in computer scienceEnsemble Methods in Machine Learning
7,862 Citations2000Thomas G. Dietterich
Experiments with a new boosting algorithm
7,585 Citations1996Yoav Freund, Robert E. Schapire
The Annals of StatisticsAdditive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)
6,842 Citations2000Jerome H. Friedman, Trevor Hastie +1 more
This work shows that this seemingly mysterious phenomenon of boosting can be understood in terms of well-known statistical principles, namely additive modeling and maximum likelihood, and develops more direct approximations and shows that they exhibit nearly identical results to boosting.
SIAM Journal on Scientific ComputingA Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
5,588 Citations1998George Karypis, Vipin Kumar
This work presents a new coarsening heuristic (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of theSize of the final partition obtained after multilevel refinement, and presents a much faster variation of the Kernighan--Lin (KL) algorithm for refining during uncoarsening.
Machine LearningThe Strength of Weak Learnability
3,293 Citations1990Robert E. Schapire
In this paper, a method is described for converting a weak learning algorithm into one that achieves arbitrarily high accuracy, and it is shown that these two notions of learnability are equivalent.
Machine LearningThe strength of weak learnability
2,434 Citations1990Robert E. Schapire
In this paper, it is shown that the two notions of learnability are equivalent, and a method is described for converting a weak learning algorithm into one that achieves arbitrarily high accuracy.
Behavioral and Brain SciencesOn artificial intelligence
885 Citations1985Peter H. Schönemann
This paper aims to boost the accuracy of a DP logistic regression (LR) via a pre-training module via a pre-training module and shows that adding a pre-training module significantly improves the accuracy of the DP-LR model.
Evaluation of hierarchical clustering algorithms for document datasets
553 Citations2002Ying Zhao, George Karypis
It is suggested that partitional clustering algorithms are well-suited for clustering large document datasets due to not only their relatively low computational requirements, but also comparable or even better clustering performance.
Connection ScienceOn Combining Artificial Neural Nets
514 Citations1996Amanda Sharkey
This paper reviews research on combining artificial neural nets, and provides an overview of, and an introduction to, the papers contained in this special issue, and its companion (Connection Science, 9, 1).
Journal of Artificial Intelligence ResearchIterative Optimization and Simplification of Hierarchical Clusterings
189 Citations1996Douglas Fisher
This work evaluates an inexpensive strategy for creating initial clusterings, coupled with several control strategies for iterative optimization, each of which repeatedly modifies an initial clustering in search of a better one.
Knowledge and Information SystemsDistributed Clustering Using Collective Principal Component Analysis
163 Citations2001Hillol Kargupta, Weiyun Huang +2 more
A way to integrate the Collective PCA with a given off-the-shelf clustering algorithm in order to develop a distributed clustering technique.
Initialization of iterative refinement clustering algorithms
153 Citations1998Usama M. Fayyad, Cory Reina +1 more
This work presents a procedure for computing a refined starting condition from a given initial one that is based on an efficient technique for estimating the modes of a distribution, and shows that refined initial points indeed lead to improved solutions.
Evaluation of Hierarchical Clustering Algorithms for Document Datasets
149 Citations2002Ying Zhao, George Karypis
Lecture notes in computer scienceMulticlassifier Systems: Back to the Future
116 Citations2002Joydeep Ghosh
This article argues that the current understanding of ensemble-type multiclassifier systems is now quite mature and exhorts the reader to consider a broader set of models and situations for further progress.
Lecture notes in computer scienceEvidence Accumulation Clustering Based on the K-Means Algorithm
90 Citations2002Ana Fred, Anil K. Jain
This paper proposes the combination of multiple K-means clusterings using variable k, using cluster lifetime as the criterion for extracting the final clusters; and the adaptation of this approach to string patterns, which leads to a more robust clustering technique.
Pattern Recognition LettersA clustering method based on boosting
74 Citations2004Dimitrios Frossyniotis, Aristidis Likas +1 more
This paper proposes the boost-clustering algorithm which constitutes a novel clustering methodology that exploits the general principles of boosting in order to provide a consistent partitioning of a dataset.
Lecture notes in computer scienceA Multi-clustering Fusion Algorithm
42 Citations2002Dimitrios Frossyniotis, Minas Pertselakis +1 more
Experiments indicate that the multi-clustering fusion algorithm is able to partition a set of data points to the optimal number of clusters not constrained to be hyperspherically shaped.