An Ensemble Method for Clustering
Published 1 January 2003
Andreas Weingessel, Evgenia Dimitriadou, Kurt Hornik
Citations41
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
This work presents a methodology for combining ensembles of partitions obtained by clustering, discusses the properties of such combination strategies and relate them to the task of assessing partition “aggrement”.
Abstract
Combination strategies in classification are a popular way of overcoming instabilities in classification algorithms. A direct application of ideas such as “voting” to cluster analysis problems is not possible, as no a priori class information for the patterns is available. We present a methodology for combining ensembles of partitions obtained by clustering, discuss the properties of such combination strategies and relate them to the task of assessing partition “aggrement”.
Keywords
Computer Science
Choice Reviews OnlineNeural networks for pattern recognition
18,687 Citations1994
This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition, and is designed as a text, with over 100 exercises, to benefit anyone involved in the fields of neural computation and pattern recognition.
Journal of Computational and Graphical StatisticsR: A Language for Data Analysis and Graphics
10,424 Citations1996Ross Ihaka, Robert Gentleman
The experience designing and implementing a statistical computing language that provides advantages in the areas of portability, computational efficiency, memory management, and scoping is discussed.
Lecture notes in computer scienceEnsemble Methods in Machine Learning
7,862 Citations2000Thomas G. Dietterich
IEEE Transactions on CommunicationsAn Algorithm for Vector Quantizer Design
7,183 Citations1980Y. Linde, A. Buzo +1 more
An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data.
Mathematics in Science and Engineering/Mathematics in science and engineeringFuzzy Sets and Systems - Theory and Applications
6,430 Citations1980Didier Dubois, Henri Prade
Machine LearningAn Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
2,644 Citations1999Eric Bauer, Ron Kohavi
It is found that Bagging improves when probabilistic estimates in conjunction with no-pruning are used, as well as when the data was backfit, and that Arc-x4 behaves differently than AdaBoost if reweighting is used instead of resampling, indicating a fundamental difference.
The Annals of StatisticsBoosting the margin: a new explanation for the effectiveness of voting methods
2,313 Citations1998Peter L. Bartlett, Yoav Freund +2 more
It is shown that techniques used in the analysis of Vapnik's support vector classifiers and of neural networks with small weights can be applied to voting methods to relate the margin distribution to the test error.
IEEE Transactions on Systems Man and CyberneticsMethods of combining multiple classifiers and their applications to handwriting recognition
2,171 Citations1992Longchang Xu, Adam Krzyżak +1 more
On applying these methods to combine several classifiers for recognizing totally unconstrained handwritten numerals, the experimental results show that the performance of individual classifiers can be improved significantly.
IEEE Transactions on Pattern Analysis and Machine IntelligenceCombination of multiple classifiers using local accuracy estimates
949 Citations1997K. Woods, W. Philip Kegelmeyer +1 more
Pattern Recognition LettersOptimal combinations of pattern classifiers
309 Citations1995Louisa Lam, Ching Y. Suen
A Bayesian formulation and a weighted majority vote (with weights obtained through a genetic algorithm) are implemented, and the combined performances of 7 classifiers on a large set of handwritten numerals are analyzed.
Lecture notes in computer scienceFinding Consistent Clusters in Data Partitions
300 Citations2001Ana Fred
This paper addresses the problem of finding consistent clusters in data partitions, proposing the analysis of the most common associations performed in a majority voting scheme, and evaluating the proposed methodology in the context of k-means clustering, a new clustering algorithm being presented.
IEEE Transactions on ReliabilityVoting algorithms
249 Citations1994Behrooz Parhami
This paper presents efficient n-way plurality and threshold voting algorithms based on the type of voting (exact, inexact, or approval), rule for output selection (plurality or threshold) and properties of the input object space (size and structure).
Fuzzy Sets and SystemsAdvances in fuzzy integration for pattern recognition
159 Citations1994James M. Keller, Paul Gader +3 more
This paper develops generalizations of the fuzzy integral and shows that these generalizations can achieve higher recognition rates in an automatic target recognition problem and demonstrates significant increases in recognition rates used to fuse the results of different neural network classifiers in a complex handwritten character recognition domain.
Clustering-and-selection model for classifier combination
154 Citations2002Ludmila I. Kuncheva
A simple clustering-and-selection algorithm based on a probabilistic interpretation of classifier selection, where the most successful classifier for a given cluster is nominated to label the inputs in the Voronoi cell of the cluster centroid.
Lecture notes in computer scienceClassifier Combinations: Implementations and Theoretical Issues
152 Citations2000Louisa Lam
Some of the current developments according to the structure of the combination process are considered, and some issues involved in each structure are discussed.
A theoretical investigation of generalized voters for redundant systems
136 Citations2003P.R. Lorczak, A. K. Caglayan +1 more
The generalized median voter is introduced, which extends the thresholdless midvalue selection technique to arbitrary metric spaces and obviates most of the problems associated with inexact voting.
International Journal of Pattern Recognition and Artificial IntelligenceA COMBINATION SCHEME FOR FUZZY CLUSTERING
109 Citations2002Evgenia Dimitriadou, Andreas Weingessel +1 more
IFAC Proceedings VolumesFuzzy-Set-Theoretic Approach to the Optimal Assignment of Work Places
14 Citations1976Janusz Kacprzyk
A new method for solving the problem of optimal assignment of employees to work places in a given organizational structure by using in a “direct” way of verbal descriptions determining the work results of particular employees and the whole structure as functions of some factors.
Radial basis function based adaptive fuzzy systems
5 Citations2002Kwang Bo Cho, Bo Hyeun Wang
This paper describes a fuzzy system with adaptive capability to extract fuzzy IF-THEN rules from input and output sample data and employs the Gaussian functions to represent the membership functions of the premise part of fuzzy rules.