Survey of Clustering Algorithms
IEEE Transactions on Neural NetworksPublished 1 May 2005
Rui Xu, D. WunschII
Citations6,154
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
Clustering algorithms for data sets appearing in statistics, computer science, and machine learning are surveyed, and their applications in some benchmark data sets, the traveling salesman problem, and bioinformatics, a new field attracting intensive efforts are illustrated.
Abstract
Data analysis plays an indispensable role for understanding various phenomena. Cluster analysis, primitive exploration with little or no prior knowledge, consists of research developed across a wide variety of communities. The diversity, on one hand, equips us with many tools. On the other hand, the profusion of options causes confusion. We survey clustering algorithms for data sets appearing in statistics, computer science, and machine learning, and illustrate their applications in some benchmark data sets, the traveling salesman problem, and bioinformatics, a new field attracting intensive efforts. Several tightly related topics, proximity measure, and cluster validation, are also discussed.
Keywords
Computer Science
Nucleic Acids ResearchGapped BLAST and PSI-BLAST: a new generation of protein database search programs
74,499 Citations1997Stephen F. Altschul
A new criterion for triggering the extension of word hits, combined with a new heuristic for generating gapped alignments, yields a gapped BLAST program that runs at approximately three times the speed of the original.
IEEE Transactions on Automatic ControlA new look at the statistical model identification
50,732 Citations1974Hirotugu Akaike
ScienceOptimization by Simulated Annealing
44,600 Citations1983Scott Kirkpatrick, C. D. Gelatt +1 more
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
The MIT Press eBooksAdaptation in Natural and Artificial Systems
35,568 Citations1992John H. Holland
Initially applying his concepts to simply defined artificial systems with limited numbers of parameters, Holland goes on to explore their use in the study of a wide range of complex, naturally occuring processes, concentrating on systems having multiple factors that interact in nonlinear ways.
TechnometricsStatistical Learning Theory
26,913 Citations1999Yuhai Wu, Vladimir Vapnik
Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
NatureInitial sequencing and analysis of the human genome
24,579 Citations2001Eric S. Lander, Lauren Linton +250 more
The results of an international collaboration to produce and make freely available a draft sequence of the human genome are reported and an initial analysis is presented, describing some of the insights that can be gleaned from the sequence.
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)Some methods for classification and analysis of multivariate observations
22,787 Citations1967James B. MacQueen
Proceedings of the IEEEA tutorial on hidden Markov models and selected applications in speech recognition
22,785 Citations1989L. R. Rabiner
A density-based algorithm for discovering clusters in large spatial Databases with Noise
19,114 Citations1996Martin Ester, Hans‐Peter Kriegel +2 more
DBSCAN, a new clustering algorithm relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape, is presented which requires only one input parameter and supports the user in determining an appropriate value for it.
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.
Data Mining and Knowledge DiscoveryA Tutorial on Support Vector Machines for Pattern Recognition
16,433 Citations1998Christopher J. C. Burges
There are several arguments which support the observed high accuracy of SVMs, which are reviewed and numerous examples and proofs of most of the key theorems are given.
Proceedings of the National Academy of SciencesCluster analysis and display of genome-wide expression patterns
16,395 Citations1998Michael B. Eisen, Paul T. Spellman +2 more
A system of cluster analysis for genome-wide expression data from DNA microarray hybridization is described that uses standard statistical algorithms to arrange genes according to similarity in pattern of gene expression, finding in the budding yeast Saccharomyces cerevisiae that clustering gene expression data groups together efficiently genes of known similar function.
ScienceNonlinear Dimensionality Reduction by Locally Linear Embedding
15,035 Citations2000Sam T. Roweis, Lawrence K. Saul
Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
Annals of EugenicsTHE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
14,727 Citations1936Ronald Aylmer Fisher
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.
Neural Networks for Pattern Recognition
12,198 Citations1995Chris Bishop
ScienceMolecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression Monitoring
11,622 Citations1999Todd R. Golub, Donna K. Slonim +10 more
A generic approach to cancer classification based on gene expression monitoring by DNA microarrays is described and applied to human acute leukemias as a test case and suggests a general strategy for discovering and predicting cancer classes for other types of cancer, independent of previous biological knowledge.
Journal of Molecular BiologyA general method applicable to the search for similarities in the amino acid sequence of two proteins
11,464 Citations1970Saul B. Needleman, Christian D. Wunsch
A computer adaptable method for finding similarities in the amino acid sequences of two proteins has been developed and it is possible to determine whether significant homology exists between the proteins to trace their possible evolutionary development.
A study of cross-validation and bootstrap for accuracy estimation and model selection
10,733 Citations1995Ron Kohavi
The results indicate that for real-word datasets similar to the authors', the best method to use for model selection is ten fold stratified cross validation even if computation power allows using more folds.
Choice Reviews OnlineFinding groups in data: an introduction to cluster analysis
10,614 Citations1991
The MIT Press eBooksLearning with Kernels
9,548 Citations2001Bernhard Schölkopf, Alexander J. Smola
Learning with Kernels provides an introduction to SVMs and related kernel methods that provide all of the concepts necessary to enable a reader equipped with some basic mathematical knowledge to enter the world of machine learning using theoretically well-founded yet easy-to-use kernel algorithms.
Cluster Analysis
9,195 Citations1974Barry J. Everitt, Sabine Landau +1 more
Neural ComputationNonlinear Component Analysis as a Kernel Eigenvalue Problem
8,078 Citations1998Bernhard Schölkopf, Alexander J. Smola +1 more
A new method for performing a nonlinear form of principal component analysis by the use of integral operator kernel functions is proposed and experimental results on polynomial feature extraction for pattern recognition are presented.
Wiley series in probability and statisticsFinite Mixture Models
7,410 Citations2018Geoffrey J. McLachlan, David Peel +1 more
The aim of this article is to provide an up-to-date account of the theory and methodological developments underlying the applications of finite mixture models.
IEEE Transactions on Pattern Analysis and Machine IntelligenceStatistical pattern recognition: a review
6,688 Citations2000Anil K. Jain, Peter Duin +1 more
The objective of this review paper is to summarize and compare some of the well-known methods used in various stages of a pattern recognition system and identify research topics and applications which are at the forefront of this exciting and challenging field.
Journal of CyberneticsA Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
6,548 Citations1973J. C. Dunn
Two fuzzy versions of the k-means optimal, least squared error partitioning problem are formulated for finite subsets X of a general inner product space; in both cases, the extremizing solutions are shown to be fixed points of a certain operator T on the class of fuzzy, k-partitions of X, and simple iteration of T provides an algorithm which has the descent property relative to the least squarederror criterion function.
INFORMS Journal on ComputingTabu Search—Part II
5,643 Citations1990Fred Glover
The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
IEEE Transactions on Pattern Analysis and Machine IntelligenceAn efficient k-means clustering algorithm: analysis and implementation
5,568 Citations2002Tapas Kanungo, David M. Mount +4 more
This work presents a simple and efficient implementation of Lloyd's k-means clustering algorithm, which it calls the filtering algorithm, and establishes the practical efficiency of the algorithm's running time.
BiometricsA General Coefficient of Similarity and Some of Its Properties
5,240 Citations1971J. C. Gower
A general coefficient measuring the similarity between two sampling units is defined and the matrix of similarities between all pairs of sample units is shown to be positive semidefinite.
TechnometricsThe EM Algorithm and Extensions
5,108 Citations1998Debashis Kushary, Geoffrey J. McLachlan +1 more
INFORMS Journal on ComputingTabu Search—Part I
4,974 Citations1989Fred Glover
The fundamental principles underlying tabu search as a strategy for combinatorial optimization problems are presented and more advanced considerations are examined, applying the basic ideas to special settings and outlining a dynamic move structure to insure finiteness.
Molecular Biology of the CellComprehensive Identification of Cell Cycle–regulated Genes of the Yeast<i>Saccharomyces cerevisiae</i>by Microarray Hybridization
4,799 Citations1998Paul T. Spellman, Gavin Sherlock +7 more
A comprehensive catalog of yeast genes whose transcript levels vary periodically within the cell cycle is created, and it is found that the mRNA levels of more than half of these 800 genes respond to one or both of these cyclins.
The MIT Press eBooksLaplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
4,535 Citations2002Mikhail Belkin, Partha Niyogi
The algorithm provides a computationally efficient approach to nonlinear dimensionality reduction that has locality preserving properties and a natural connection to clustering.
Journal of the American Statistical AssociationLearning With Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
4,326 Citations2003Christopher K. I. Williams
Learning with Kernels provides an introduction to SVMs and related kernel methods that provide all of the concepts necessary to enable a reader equipped with some basic mathematical knowledge to enter the world of machine learning using theoretically well-founded yet easy-to-use kernel algorithms.
Journal of the American Statistical AssociationModel-Based Clustering, Discriminant Analysis, and Density Estimation
4,282 Citations2002Chris Fraley, Adrian E. Raftery
This work reviews a general methodology for model-based clustering that provides a principled statistical approach to important practical questions that arise in cluster analysis, such as how many clusters are there, which clustering method should be used, and how should outliers be handled.
Proceedings of the National Academy of SciencesBroad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays
4,210 Citations1999Uri Alon, Naama Barkai +5 more
A two-way clustering method is reported for analyzing a data set consisting of the expression patterns of different cell types, revealing broad coherent patterns that suggest a high degree of organization underlying gene expression in these tissues.
PsychometrikaAn Examination of Procedures for Determining the Number of Clusters in a Data Set
3,870 Citations1985Glenn W. Milligan, Martha C. Cooper
A Monte Carlo evaluation of 30 procedures for determining the number of clusters was conducted on artificial data sets which contained either 2, 3, 4, or 5 distinct nonoverlapping clusters to provide a variety of clustering solutions.
Operations ResearchAn Effective Heuristic Algorithm for the Traveling-Salesman Problem
3,797 Citations1973Simon Lin, Brian W. Kernighan
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems.
Pattern Classification
3,739 Citations2001Shigeo Abe
Pattern RecognitionThe global k-means clustering algorithm
3,687 Citations2002Aristidis Likas, Nikos Vlassis +1 more
The global k-means algorithm is presented which is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure consisting of N executions of the k-Means algorithm from suitable initial positions.
Biological sequence analysis probabilistic models of proteins and nucleic acids
3,654 Citations2010Richard Durbin
Algorithms on strings, trees, and sequences: computer science and computational biology
3,529 Citations1997Dan Gusfield
Cambridge University Press eBooksBiological Sequence Analysis
3,283 Citations1998Richard Durbin, Sean R. Eddy +2 more
This book gives a unified, up-to-date and self-contained account, with a Bayesian slant, of such methods, and more generally to probabilistic methods of sequence analysis.
Cambridge University Press eBooksAlgorithms on Strings, Trees and Sequences
3,045 Citations1997Dan Gusfield
Ukkonen’s method is the method of choice for most problems requiring the construction of a suffix tree, and it will be presented first because it is easier to understand.
Proceedings of the National Academy of SciencesInterpreting patterns of gene expression with self-organizing maps: Methods and application to hematopoietic differentiation
2,946 Citations1999Pablo Tamayo, Donna K. Slonim +6 more
The application of self-organizing maps, a type of mathematical cluster analysis that is particularly well suited for recognizing and classifying features in complex, multidimensional data, is described.
A Survey of Clustering Data Mining Techniques
2,791 Citations2006Pavel Berkhin
This survey concentrates on clustering algorithms from a data mining perspective as a data modeling technique that provides for concise summaries of the data.
IEEE Transactions on Neural NetworksClustering of the self-organizing map
2,665 Citations2000Juha Vesanto, Esa Alhoniemi
The two-stage procedure--first using SOM to produce the prototypes that are then clustered in the second stage--is found to perform well when compared with direct clustering of the data and to reduce the computation time.
Nature MedicineClassification and diagnostic prediction of cancers using gene expression profiling and artificial neural networks
2,648 Citations2001Javed Khan, Jun S. Wei +9 more
The ability of the trained ANN models to recognize SRBCTs is demonstrated, and the potential applications of these methods for tumor diagnosis and the identification of candidate targets for therapy are demonstrated.
Nature GeneticsSystematic determination of genetic network architecture
2,556 Citations1999Saeed Tavazoie, Jason D. Hughes +3 more
A systematic set of statistical algorithms are applied, based on whole-genome mRNA data, partitional clustering and motif discovery, to identify transcriptional regulatory sub-networks in yeast—without any a priori knowledge of their structure or any assumptions about their dynamics.
Signal ProcessingBlind separation of sources, part I: An adaptive algorithm based on neuromimetic architecture
2,522 Citations1991Christian Jutten, Jeanny Hérault
Pattern Classification (2nd ed.)
2,513 Citations1999Richard O. Duda, Peter E. Hart +1 more
University of Minnesota Digital Conservancy (University of Minnesota)A Comparison of Document Clustering Techniques
2,458 Citations2000Michael Steinbach, George Karypis +1 more
This paper compares the two main approaches to document clustering, agglomerative hierarchical clustering and K-means, and indicates that the bisecting K-MEans technique is better than the standard K-Means approach and as good or better as the hierarchical approaches that were tested for a variety of cluster evaluation metrics.
Constrained K-means Clustering with Background Knowledge
2,415 Citations2001Kiri L. Wagstaff, Claire Cardie +2 more
This paper demonstrates how the popular k-means clustering algorithm can be protably modied to make use of information about the problem domain that is available in addition to the data instances themselves.
Data Mining and Knowledge DiscoveryExtensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
2,409 Citations1998Zhexue Huang
Two algorithms which extend the k-means algorithm to categorical domains and domains with mixed numeric and categorical values are presented and are shown to be efficient when clustering large data sets, which is critical to data mining applications.
Automatic subspace clustering of high dimensional data for data mining applications
2,386 Citations1998Rakesh Agrawal, Johannes Gehrke +2 more
CLIQUE is presented, a clustering algorithm that satisfies each of these requirements of data mining applications including the ability to find clusters embedded in subspaces of high dimensional data, scalability, end-user comprehensibility of the results, non-presumption of any canonical data distribution, and insensitivity to the order of input records.
Lecture notes in computer scienceWhen Is “Nearest Neighbor” Meaningful?
2,297 Citations1999Kevin Beyer, Jonathan Goldstein +2 more
The effect of dimensionality on the "nearest neighbor" problem is explored, and it is shown that under a broad set of conditions, as dimensionality increases, the Distance to the nearest data point approaches the distance to the farthest data point.
Nature GeneticsHigh density synthetic oligonucleotide arrays
2,216 Citations1999Robert J. Lipshutz, Stephen P. A. Fodor +2 more
An approach in which sequence information is used directly to design high–density, two–dimensional arrays of synthetic oligonucleotides is developed, which have been designed and used for quantitative and highly parallel measurements of gene expression, to discover polymorphic loci and to detect the presence of thousands of alternative alleles.
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
2,162 Citations2000Dan Pelleg, Andrew Moore
A new algorithm is introduced that eeciently, searches the space of cluster locations and number of clusters to optimize the Bayesian Information Criterion (BIC) or the Akaike Information Criteria (AIC) measure.
IEEE Transactions on Pattern Analysis and Machine IntelligenceUnsupervised learning of finite mixture models
2,110 Citations2002Mário A. T. Figueiredo, Anil K. Jain
The novelty of the approach is that it does not use a model selection criterion to choose one among a set of preestimated candidate models; instead, it seamlessly integrate estimation and model selection in a single algorithm.
ComputerChameleon: hierarchical clustering using dynamic modeling
2,102 Citations1999George Karypis, Eui-Hong Han +1 more
Chameleon's key feature is that it accounts for both interconnectivity and closeness in identifying the most similar pair of clusters, which is important for dealing with highly variable clusters.
IEEE/ACM Transactions on Computational Biology and BioinformaticsBiclustering algorithms for biological data analysis: a survey
2,046 Citations2004Sara C. Madeira, Arlindo L. Oliveira
IEEE Transactions on Neural NetworksFuzzy ARTMAP: A neural network architecture for incremental supervised learning of analog multidimensional maps
1,977 Citations1992Gail A. Carpenter, Stephen Grossberg +3 more
The fuzzy ARTMAP system is compared with Salzberg's NGE systems and with Simpson's FMMC system, and its performance in relation to benchmark backpropagation and generic algorithm systems.
Journal of Molecular BiologyHidden Markov Models in Computational Biology
1,961 Citations1994Anders Krogh, Michael Brown +3 more
The results suggest the presence of an EF-hand calcium binding motif in a highly conserved and evolutionary preserved putative intracellular region of 155 residues in the alpha-1 subunit of L-type calcium channels which play an important role in excitation-contraction coupling.
Biological CyberneticsAdaptive pattern classification and universal recoding: I. Parallel development and coding of neural feature detectors
1,916 Citations1976Stephen Grossberg
It is shown how experience can retune feature detectors to respond to a prescribed convex set of spatial patterns, and a classification of adult feature detector properties in terms of a small number of functional principles is suggested.
IEEE Transactions on Fuzzy SystemsOn cluster validity for the fuzzy c-means model
1,839 Citations1995Nikhil R. Pal, James C. Bezdek
Limitation analysis indicates, and numerical experiments confirm, that the Fukuyama-Sugeno index is sensitive to both high and low values of m and may be unreliable because of this, and calculations suggest that the best choice for m is probably in the interval [1.5, 2.5], whose mean and midpoint, m=2, have often been the preferred choice for many users of FCM.
Machine LearningKnowledge Acquisition Via Incremental Conceptual Clustering
1,754 Citations1987Douglas Fisher
COBWEB is a conceptual clustering system that organizes data so as to maximize inference ability, and is incremental and computationally economical, and thus can be flexibly applied in a variety of domains.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Genetic K-means algorithm
1,712 Citations1999K. Krishna, M. Narasimha Murty
A novel hybrid genetic algorithm that finds a globally optimal partition of a given data into a specified number of clusters using a classical gradient descent algorithm used in clustering, viz.
The Computer JournalA General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems
1,684 Citations1967G. N. Lance, W. T. Williams
It is shown that the computational behaviour of a hierarchical sorting-strategy depends on three properties, which are established for five conventional strategies and four measures.
Neural NetworksFuzzy ART: Fast stable learning and categorization of analog patterns by an adaptive resonance system
1,667 Citations1991Gail A. Carpenter, Stephen Grossberg +1 more
This paper aims to demonstrate the efforts towards in-situ applicability of EMMARM, which aims to provide real-time information about concrete mechanical properties such as E-modulus and compressive strength.
IEEE Transactions on Pattern Analysis and Machine IntelligenceUnsupervised optimal fuzzy clustering
1,643 Citations1989Isak Gath, Amir B. Geva
The unsupervised fuzzy partition-optimal number of classes algorithm performs well in situations of large variability of cluster shapes, densities, and number of data points in each cluster.
BioinformaticsA Bayesian framework for the analysis of microarray expression data: regularized <i>t</i> -test and statistical inferences of gene changes
1,638 Citations2001Pierre Baldi, Anthony D. Long
A Bayesian probabilistic framework for microarray data analysis is developed that derives point estimates for both parameters and hyperparameters, and regularized expressions for the variance of each gene by combining the empirical variance with a local background variance associated with neighboring genes.
IEEE Transactions on Neural NetworksAn introduction to simulated evolutionary optimization
1,508 Citations1994David B. Fogel
The development of each of these procedures over the past 35 years is described and some recent efforts in these areas are reviewed.
Information SystemsRock: A robust clustering algorithm for categorical attributes
1,482 Citations2000Sudipto Guha, Rajeev Rastogi +1 more
Nature GeneticsA gene expression database for the molecular pharmacology of cancer
1,455 Citations2000Uwe Scherf, Douglas T. Ross +15 more
Gene-drug relationships for the clinical agents 5-fluorouracil and L-asparaginase exemplify how variations in the transcript levels of particular genes relate to mechanisms of drug sensitivity and resistance.
Pattern RecognitionGenetic algorithm-based clustering technique
1,447 Citations2000Ujjwal Maulik, Sanghamitra Bandyopadhyay
The superiority of the GA-clustering algorithm over the commonly used K-means algorithm is extensively demonstrated for four artificial and three real-life data sets.
Wiley series in probability and statisticsThe EM Algorithm and Extensions, 2E
1,441 Citations2008Geoffrey J. McLachlan, Thriyambakam Krishnan
Neural NetworksNeural networks and principal component analysis: Learning from examples without local minima
1,360 Citations1989Pierre Baldi, Kurt Hornik
The main result is a complete description of the landscape attached to E in terms of principal component analysis, showing that E has a unique minimum corresponding to the projection onto the subspace generated by the first principal vectors of a covariance matrix associated with the training patterns.
Journal of Machine Learning ResearchSupport vector clustering
1,356 Citations2002Asa Ben‐Hur, D. Horn +2 more
A novel clustering method using the approach of support vector machines, where data points are mapped by means of a Gaussian kernel to a high dimensional feature space, where the minimal enclosing sphere is searched for.
Learning from Data: Concepts, Theory, and Methods
1,293 Citations1998Vladimir Cherkassky, Filip Mulier
ComputerThe ART of adaptive pattern recognition by a self-organizing neural network
1,290 Citations1988Gail A. Carpenter, Stephen Grossberg
IEEE Transactions on Knowledge and Data EngineeringCluster analysis for gene expression data: a survey
1,252 Citations2004Daxin Jiang, Chun Tang +1 more
This paper divides cluster analysis for gene expression data into three categories, presents specific challenges pertinent to each clustering category and introduces several representative approaches, and suggests the promising trends in this field.
IEEE Transactions on Knowledge and Data EngineeringCLARANS: a method for clustering objects for spatial data mining
1,184 Citations2002Raymond T. Ng, Jiawei Han
A new clustering method is proposed, called CLARANS, whose aim is to identify spatial structures that may be present in the data, and two spatial data mining algorithms that aim to discover relationships between spatial and nonspatial attributes are developed.
KOPS (University of Konstanz)An efficient approach to clustering in large multimedia databases with noise
1,168 Citations1998Alexander Hinneburg, Daniel A. Keim
A new algorithm to clustering in large multimedia databases called DENCLUE (DENsity-based CLUstEring) is introduced, which has a firm mathematical basis, has good clustering properties in data sets with large amounts of noise, allows a compact mathematical description of arbitrarily shaped clusters in high-dimensional data sets and is significantly faster than existing algorithms.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Some new indexes of cluster validity
1,142 Citations1998James C. Bezdek, Nikhil R. Pal
Machine LearningKnowledge acquisition via incremental conceptual clustering
1,081 Citations1987Douglas Fisher
COBWEB is a conceptual clustering system that organizes data so as to maximize inference ability, and is incremental and computationally economical, and thus can be flexibly applied in a variety of domains.
BioinformaticsClustering of highly homologous sequences to reduce the size of large protein databases
1,076 Citations2001Weizhong Li, Lukasz Jaroszewski +1 more
A fast and flexible program for clustering large protein databases at different sequence identity levels takes less than 2 h for the all-against-all sequence comparison and clustering of the non-redundant protein database of over 560,000 sequences on a high-end PC.
The Computer JournalA Survey of Recent Advances in Hierarchical Clustering Algorithms
1,047 Citations1983Fionn Murtagh
A general framework for hierarchical, agglomerative clustering algorithms is discussed here, which opens up the prospect of much improvement on current, widely-used algorithms.
Methods in enzymology on CD-ROM/Methods in enzymology[12] DNA arrays for analysis of gene expression
1,036 Citations1999Michael B. Eisen, Patrick O. Brown
The chapter focuses on the application of DNA microarrays to gene expression studies and discusses general principles of whole genome expression monitoring as well as detailing the specific process of making and using spotted DNAmicroarrays.
EconometricaAdaptive Control Processes: A Guided Tour
1,020 Citations1962Dimitri Morgenstern, Richard Bellman
Refining Initial Points for K-Means Clustering
999 Citations1998Paul S. Bradley, Usama M. Fayyad
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 that allows the iterative algorithm to converge to a “better” local minimum.
Neural NetworksARTMAP: Supervised real-time learning and classification of nonstationary data by a self-organizing neural network
985 Citations1991Gail A. Carpenter, Stephen Grossberg +1 more
Bayesian classification (AutoClass): theory and results
972 Citations1996Peter Cheeseman, John Stutz
It is emphasized that no current unsupervised classi(cid:12)cation system can produce maximally useful results when operated alone, and that it is the interaction between domain experts and the machine searching over the model space, that generates new knowledge.
Biological CyberneticsAdaptive pattern classification and universal recoding: II. Feedback, expectation, olfaction, illusions
956 Citations1976Stephen Grossberg
It is suggested that arousal is gated by a chemical transmitter system—for example, norepinephrine—whose relative states of accumulation at antagonistic pairs of on-cells and off-cells through time can shift the spatial pattern of STM activity across a field of feature detectors.
Information SystemsCure: an efficient clustering algorithm for large databases
945 Citations2001Sudipto Guha, Rajeev Rastogi +1 more
MicrobiologyThe Application of Computers to Taxonomy
936 Citations1957P. H. A. Sneath
A method is described for handling large quantities of taxonomic data by an electronic computer so as to yield the outline of a classification based on equally weighted features that enables Similarity to be expressed numerically, and would allow taxonomic rank to be measured in terms of it.
…