The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Chameleon: hierarchical clustering using dynamic modeling
Abstract
Clustering is a discovery process in data mining. It groups a set of data in a way that maximizes the similarity within clusters and minimizes the similarity between two different clusters. Many advanced algorithms have difficulty dealing with highly variable clusters that do not follow a preconceived model. By basing its selections on both interconnectivity and closeness, the Chameleon algorithm yields accurate results for these highly variable clusters. Existing algorithms use a static model of the clusters and do not use information about the nature of individual clusters as they are merged. Furthermore, one set of schemes (the CURE algorithm and related schemes) ignores the information about the aggregate interconnectivity of items in two clusters. Another set of schemes (the Rock algorithm, group averaging method, and related schemes) ignores information about the closeness of two clusters as defined by the similarity of the closest items across two clusters. By considering either interconnectivity or closeness only, these algorithms can select and merge the wrong pair of clusters. Chameleon's key feature is that it accounts for both interconnectivity and closeness in identifying the most similar pair of clusters. Chameleon finds the clusters in the data set by using a two-phase algorithm. During the first phase, Chameleon uses a graph partitioning algorithm to cluster the data items into several relatively small subclusters. During the second phase, it uses an algorithm to find the genuine clusters by repeatedly combining these subclusters.
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
(1996) · Cited by 20,179
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Data mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Rock: A robust clustering algorithm for categorical attributes
Guha, S., Rastogi, R., & Shim, K. (2000) · Information Systems · doi:10.1016/s0306-4379(00)00022-3 · Cited by 1,472
CLARANS: a method for clustering objects for spatial data mining
Ng, R. T., & Han, J. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1033770 · Cited by 1,202
ROCK: a robust clustering algorithm for categorical attributes
Guha, S., Rastogi, R., & Shim, K. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754967 · Cited by 609
Agglomerative clustering using the concept of mutual nearest neighbourhood
Chidananda Gowda, K., & Krishna, G. (1978) · Pattern Recognition · doi:10.1016/0031-3203(78)90018-3 · Cited by 405
Clustering large datasets in arbitrary metric spaces
Ganti, V., Ramakrishnan, R., Gehrke, J. E., Powell, A. L., & French, J. C. (1999) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1999.754966 · Cited by 153
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
Clustering of the self-organizing map
Vesanto, J., & Alhoniemi, E. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846731 · Cited by 2,680
Clustering of time series data—a survey
Warren Liao, T. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.01.025 · Cited by 2,401
Dong, X., Yu, Z., Cao, W., Shi, Y., & Ma, Q. (2020) · Frontiers of Computer Science · doi:10.1007/s11704-019-8208-z · Cited by 1,928
A Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
Time-series clustering – A decade review
Aghabozorgi, S., Seyed Shirkhorshidi, A., & Ying Wah, T. (2015) · Information Systems · doi:10.1016/j.is.2015.04.007 · Cited by 1,826
A review of clustering techniques and developments
Saxena, A., Prasad, M., Gupta, A., Bharill, N., Patel, O. P., Tiwari, A., Er, M. J., Ding, W., & Lin, C.-T. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.06.053 · Cited by 1,357
CLARANS: a method for clustering objects for spatial data mining
Ng, R. T., & Han, J. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1033770 · Cited by 1,202
Combining multiple clusterings using evidence accumulation
Fred, A. L. N., & Jain, A. K. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.113 · Cited by 1,195
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303321897735 · Cited by 1,092
A Survey of Clustering Algorithms for Big Data: Taxonomy and Empirical Analysis
Fahad, A., Alshatri, N., Tari, Z., Alamri, A., Khalil, I., Zomaya, A. Y., Foufou, S., & Bouras, A. (2014) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2014.2330519 · Cited by 1,042
Understanding of Internal Clustering Validation Measures
Liu, Y., Li, Z., Xiong, H., Gao, X., & Wu, J. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.35 · Cited by 973
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 816
dbscan: Fast Density-Based Clustering with R
Hahsler, M., Piekenbrock, M., & Doran, D. (2019) · Journal of Statistical Software · doi:10.18637/jss.v091.i01 · Cited by 802
A k-mean clustering algorithm for mixed numeric and categorical data
Ahmad, A., & Dey, L. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.03.016 · Cited by 718
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
Ertöz, L., Steinbach, M., & Kumar, V. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.5 · Cited by 703
Self-citationDetermining the number of clusters/segments in hierarchical clustering/segmentation algorithms
Salvador, S., & Chan, P. (2005) · 16th IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/ictai.2004.50 · Cited by 683
Hierarchical Clustering Algorithms for Document Datasets
Zhao, Y., Karypis, G., & Fayyad, U. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0361-3 · Cited by 627
Self-citationEmpirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering
Zhao, Y., & Karypis, G. (2004) · Machine Learning · doi:10.1023/b:mach.0000027785.44527.d6 · Cited by 611
Self-citationDBSCAN: Past, present and future
Rehman, S. U., Asghar, S., Fong, S., & Sarasvady, S. (2014) · The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014) · doi:10.1109/icadiwt.2014.6814687 · Cited by 606
Why so many clustering algorithms: a position paper
Estivill-Castro, V. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568575 · Cited by 600
Social Media Mining: An Introduction
Zafarani, R., Abbasi, M. A., & Liu, H. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139088510 · Cited by 592
Discovering word senses from text
Pantel, P., & Lin, D. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775138 · Cited by 591
Identification of cell types from single-cell transcriptomes using a novel clustering method
Xu, C., & Su, Z. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv088 · Cited by 559
Evaluation of hierarchical clustering algorithms for document datasets
Zhao, Y., & Karypis, G. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584877 · Cited by 558
Self-citationProgress in Outlier Detection Techniques: A Survey
Wang, H., Bah, M. J., & Hammad, M. (2019) · IEEE Access · doi:10.1109/access.2019.2932769 · Cited by 523
The Challenges of Clustering High Dimensional Data
Steinbach, M., Ertöz, L., & Kumar, V. (2004) · New Directions in Statistical Physics · doi:10.1007/978-3-662-08968-2_16 · Cited by 508
Self-citationChameleon Swarm Algorithm: A bio-inspired optimizer for solving engineering design problems
Braik, M. S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114685 · Cited by 504
A novel intrusion detection system based on hierarchical clustering and support vector machines
Horng, S.-J., Su, M.-Y., Chen, Y.-H., Kao, T.-W., Chen, R.-J., Lai, J.-L., & Perkasa, C. D. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.06.066 · Cited by 460
Comprehensive survey on hierarchical clustering algorithms and the recent developments
Ran, X., Xi, Y., Lu, Y., Wang, X., & Lu, Z. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10366-3 · Cited by 361
A new cluster validity measure and its application to image compression
Chou, C.-H., Su, M.-C., & Lai, E. (2004) · Pattern Analysis and Applications · doi:10.1007/s10044-004-0218-1 · Cited by 326
Clustering: A neural network approach
Du, K.-L. (2010) · Neural Networks · doi:10.1016/j.neunet.2009.08.007 · Cited by 325
A survey on data stream clustering and classification
Nguyen, H.-L., Woon, Y.-K., & Ng, W.-K. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-014-0808-1 · Cited by 321
Interactively exploring hierarchical clustering results [gene identification]
Seo, J., & Shneiderman, B. (2002) · Computer · doi:10.1109/mc.2002.1016905 · Cited by 321
The APOGEE-2 Survey of the Orion Star-forming Complex. II. Six-dimensional Structure
Kounkel, M., Covey, K., Suárez, G., Román-Zúñiga, C., Hernandez, J., Stassun, K., Jaehnig, K. O., Feigelson, E. D., Ramírez, K. P., Roman-Lopes, A., et al. (2018) · The Astronomical Journal · doi:10.3847/1538-3881/aad1f1 · Cited by 317
Understanding and Enhancement of Internal Clustering Validation Measures
Liu, Y., Li, Z., Xiong, H., Gao, X., Wu, J., & Wu, S. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2220543 · Cited by 315
A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method
Mahesh Kumar, K., & Rama Mohan Reddy, A. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2016.03.008 · Cited by 308
Privacy Preserving Clustering by Data Transformation
Oliveira, S. R. D. M., & Zai͏̈ane, O. R. (2003) · Journal of Information and Data Management · doi:10.5753/jidm.2010.940 · Cited by 294
Classifying large data sets using SVMs with hierarchical clusters
Yu, H., Yang, J., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956786 · Cited by 273
A survey of density based clustering algorithms
Bhattacharjee, P., & Mitra, P. (2021) · Frontiers of Computer Science · doi:10.1007/s11704-019-9059-3 · Cited by 271
Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering
Peng, X., Yu, Z., Yi, Z., & Tang, H. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2536752 · Cited by 257
Spatiotemporal Data Mining: A Computational Perspective
Shekhar, S., Jiang, Z., Ali, R., Eftelioglu, E., Tang, X., Gunturi, V., & Zhou, X. (2015) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi4042306 · Cited by 206
A survey on trust evaluation based on machine learning
Wang, J., Jing, X., Yan, Z., Fu, Y., Pedrycz, W., & Yang, L. T. (2021) · ACM Computing Surveys · doi:10.1145/3408292 · Cited by 136
Large-Scale Image Clustering Based on Camera Fingerprints
Lin, X., & Li, C.-T. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2636086 · Cited by 46
Object Localization Based on Proposal Fusion
Tang, S., Li, Y., Deng, L., & Zhang, Y. (2017) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2017.2729786 · Cited by 25
Metadata
- Authors
- Karypis, G., Han, E.-H., & Kumar, V.
- Venue
- Computer
- Published
- 1999
- Volume
- 32
- Issue
- 8
- Pages
- 68-75
- ISSN
- 0018-9162 (ISSN-L)
- OpenAlex
- W2141585940
- Cited by
- 2,097
- References
- 9
- FWCI
- 26.45
- Type
- journal article
- 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.