The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Handbook of Cluster Analysis
Abstract
Handbook of Cluster Analysis provides a comprehensive and unified account of the main research developments in cluster analysis. Written by active, distinguished researchers in this area, the book helps readers make informed choices of the most suitable clustering approach for their problem and make better use of existing cluster analysis tools. \n \nThe book is organized according to the traditional core approaches to cluster analysis, from the origins to recent developments. After an overview of approaches and a quick journey through the history of cluster analysis, the book focuses on the four major approaches to cluster analysis. These approaches include methods for optimizing an objective function that describes how well data is grouped around centroids, dissimilarity-based methods, mixture models and partitioning models, and clustering methods inspired by nonparametric density estimation. The book also describes additional approaches to cluster analysis, including constrained and semi-supervised clustering, and explores other relevant issues, such as evaluating the quality of a cluster. \n \nThis handbook is accessible to readers from various disciplines, reflecting the interdisciplinary nature of cluster analysis. For those already experienced with cluster analysis, the book offers a broad and structured overview. For newcomers to the field, it presents an introduction to key issues. For researchers who are temporarily or marginally involved with cluster analysis problems, the book gives enough algorithmic and practical details to facilitate working knowledge of specific clustering areas.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90038-5 · Cited by 2,437
Self-Tuning Spectral Clustering
Zelnik‐Manor, L., & Perona, P. (2004) · CaltechAUTHORS (California Institute of Technology) · Cited by 1,942
(2018) · De Gruyter eBooks · doi:10.1515/9783110542400 · Cited by 1,876
K-means clustering via principal component analysis
Ding, C., & He, X. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015408 · Cited by 1,386
Spectral grouping using the nystrom method
Fowlkes, C., Belongie, S., Chung, F., & Malik, J. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262185 · Cited by 1,328
Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
Nadler, B., Lafon, S., Coifman, R. R., & Kevrekidis, I. G. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2005.07.004 · Cited by 990
A Best Possible Heuristic for the k-Center Problem
Hochbaum, D. S., & Shmoys, D. B. (1985) · Mathematics of Operations Research · doi:10.1287/moor.10.2.180 · Cited by 921
A Random Walks View of Spectral Segmentation.
Meilă, M., & Shi, J. (2001) · Cited by 623
On clusterings-good, bad and spectral
Kannan, R., Vempala, S., & Veta, A. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892125 · Cited by 372
Learning Segmentation by Random Walks
Meilă, M., & Shi, J. (2000) · neural information processing systems · Cited by 365
Spielman, D. A., & Teng, S.-H. (2013) · SIAM Journal on Computing · doi:10.1137/080744888 · Cited by 316
Diffusion Maps, Spectral Clustering and Eigenfunctions of Fokker-Planck operators
Nadler, B., Lafon, S., Coifman, R. R., & Kevrekidis, I. G. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0506090 · Cited by 294
Graph Laplacians and their convergence on random neighborhood graphs
Hein, M., Audibert, J.-Y., & Ulrike Von Luxburg, A. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0608522 · Cited by 208
Spectral sparsification of graphs
Batson, J., Spielman, D. A., Srivastava, N., & Teng, S. (2013) · Communications of the ACM · doi:10.1145/2492007.2492029 · Cited by 154
Influence of graph construction on graph-based clustering measures
Maier, M., von Luxburg, U., & Hein, M. (2008) · Cited by 150
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians
Dasgupta, S., & Schulman, L. J. (2007) · CaltechAUTHORS (California Institute of Technology) · doi:10.5555/1248659.1248666 · Cited by 134
Clustering by weighted cuts in directed graphs
Meilă, M., & Pentney, W. R. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.13 · Cited by 122
An Analysis of the Convergence of Graph LaplaciansPreprint
Ting, D., Huang, L., & Jordan, M. I. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1101.5435 · Cited by 98
Local Partitioning for Directed Graphs Using PageRank
Andersen, R., Chung, F., & Lang, K. (2008) · Internet Mathematics · doi:10.1080/15427951.2008.10129297 · Cited by 61
How the initialization affects the stability of the қ-means algorithm
Bubeck, S., Meilă, M., & Ulrike Von Luxburg, A. (2012) · ESAIM Probability and Statistics · doi:10.1051/ps/2012013 · Cited by 56
Stochastic image segmentation by typical cuts
Gdalyahu, Y., Weinshall, D., & Werman, M. (2003) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1999.784979 · Cited by 36
Balcan, M.-F., & Braverman, M. (2009) · Cited by 27
Local search for balanced submodular clusterings
Narasimhan, M., & Bilmes, J. A. (2007) · Cited by 26
Combinatorial Optimization Algorithms
Pappalardo, E., Özkök, B. A., & Pardalos, P. M. (2013) · Springer eBooks · doi:10.1007/978-1-4419-7997-1_67 · Cited by 17
Cited by
Browning, M. H. E. M., Larson, L. R., Sharaievska, I., Rigolon, A., McAnirlin, O., Mullenbach, L., Cloutier, S., Vu, T. M., Thomsen, J., Reigner, N., et al. (2021) · PLOS ONE · doi:10.1371/journal.pone.0245327 · Cited by 888
What is Machine Learning? A Primer for the Epidemiologist
Bi, Q., Goodman, K. E., Kaminsky, J., & Lessler, J. (2019) · American Journal of Epidemiology · doi:10.1093/aje/kwz189 · Cited by 496
Unsupervised Learning Methods for Molecular Simulation Data
Glielmo, A., Husic, B. E., Rodriguez, A., Clementi, C., Noé, F., & Laio, A. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.0c01195 · Cited by 402
Blum, A., Hopcroft, J., & Kannan, R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108755528 · Cited by 304
Constrained global sensitivity analysis for bioprocess design space identification
Kotidis, P., Demis, P., Goey, C. H., Correa, E., McIntosh, C., Trepekli, S., Shah, N., Klymenko, O. V., & Kontoravdi, C. (2019) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.01.022 · Cited by 40
Metadata
- Venue
- Chapman & Hall/CRC eBooks
- Publisher
- Chapman and Hall/CRC
- Published
- 2015-12-16
- OpenAlex
- W2234763457
- Cited by
- 643
- References
- 31
- FWCI
- 15.13
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.