A Survey of Clustering Algorithms for Big Data: Taxonomy and Empirical Analysis
Open accessThe DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Abstract
Clustering algorithms have emerged as an alternative powerful meta-learning tool to accurately analyze the massive volume of data generated by modern applications. In particular, their main goal is to categorize data into clusters such that objects are grouped in the same cluster when they are similar according to specific metrics. There is a vast body of knowledge in the area of clustering and there has been attempts to analyze and categorize them for a larger number of applications. However, one of the major issues in using clustering algorithms for big data that causes confusion amongst practitioners is the lack of consensus in the definition of their properties as well as a lack of formal categorization. With the intention of alleviating these problems, this paper introduces concepts and algorithms related to clustering, a concise survey of existing (clustering) algorithms as well as providing a comparison, both from a theoretical and an empirical perspective. From a theoretical perspective, we developed a categorizing framework based on the main properties pointed out in previous studies. Empirically, we conducted extensive experiments where we compared the most representative algorithm from each of the categories using a large number of real (big) data sets. The effectiveness of the candidate clustering algorithms is measured through a number of internal and external validity metrics, stability, runtime, and scalability tests. In addition, we highlighted the set of clustering algorithms that are the best performing for big data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
(1967) · Cited by 23,719
(1996) · Cited by 20,179
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Witten, I. H. (2008) · Cited by 9,143
Hubert, L., & Arabie, P. (1985) · Journal of Classification · doi:10.1007/bf01908075 · Cited by 8,219
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
FCM: The fuzzy c-means clustering algorithm
Bezdek, J. C., Ehrlich, R., & Full, W. (1984) · Computers & Geosciences · doi:10.1016/0098-3004(84)90020-7 · Cited by 6,608
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Cited by
Big Data Analytics in Operations Management
Choi, T., Wallace, S. W., & Wang, Y. (2018) · Production and Operations Management · doi:10.1111/poms.12838 · Cited by 1,027
“It can be used in areas such as market segmentation, collaborative processes (Fan et al. 2017), classification, clustering, (Fahad et al. 2014) and regression.”
MethodDigital twin paradigm: A systematic literature review
Semeraro, C., Lezoche, M., Panetto, H., & Dassisti, M. (2021) · Computers in Industry · doi:10.1016/j.compind.2021.103469 · Cited by 986
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
Tsai, C.-W., Lai, C.-F., Chao, H.-C., & Vasilakos, A. V. (2015) · Journal of Big Data · doi:10.1186/s40537-015-0030-3 · Cited by 818
Multi-view clustering: A survey
Yang, Y., & Wang, H. (2018) · Big Data Mining and Analytics · doi:10.26599/bdma.2018.9020003 · Cited by 506
A survey towards an integration of big data analytics to big insights for value-creation
Saggi, M. K., & Jain, S. (2018) · Information Processing & Management · doi:10.1016/j.ipm.2018.01.010 · Cited by 494
Data-centric Artificial Intelligence: A Survey
Zha, D., Bhat, Z. P., Lai, K.-H., Yang, F., Jiang, Z., Zhong, S., & Hu, X. (2025) · ACM Computing Surveys · doi:10.1145/3711118 · Cited by 334
Big data with cloud computing: Discussions and challenges
Sandhu, A. K. (2022) · Big Data Mining and Analytics · doi:10.26599/bdma.2021.9020016 · Cited by 280
Protection of Big Data Privacy
Mehmood, A., Natgunanathan, I., Xiang, Y., Hua, G., & Guo, S. (2016) · IEEE Access · doi:10.1109/access.2016.2558446 · Cited by 276
Niknam, M., & Thulasiraman, P. (2020) · Education and Information Technologies · doi:10.1007/s10639-020-10133-3 · Cited by 102
Garay, J., Yap, R., & Sabellano, M. J. (2019) · IOP Conference Series: Materials Science and Engineering · doi:10.1088/1757-899x/482/1/012043 · Cited by 23
An Efficient Workload Clustering Framework for Large-Scale Data Centers
Ismaeel, S., Al-Khazraji, A., & Miri, A. (2019) · 2019 8th International Conference on Modeling Simulation and Applied Optimization (ICMSAO) · doi:10.1109/icmsao.2019.8880305 · Cited by 12
HUMAN - Hierarchical Clustering for Unsupervised Anomaly Detection & Interpretation
Mulinka, P., Casas, P., Fukuda, K., & Kencl, L. (2020) · 2020 11th International Conference on Network of the Future (NoF) · doi:10.1109/nof50125.2020.9249194 · Cited by 5
Metadata
- Authors
- Fahad, A., Alshatri, N., Tari, Z., Alamri, A., Khalil, I., Zomaya, A. Y., Foufou, S., & Bouras, A.
- Venue
- IEEE Transactions on Emerging Topics in Computing
- Published
- 2014-09
- Volume
- 2
- Issue
- 3
- Pages
- 267-279
- ISSN
- 2168-6750 (ISSN-L)
- OpenAlex
- W2057923756
- Cited by
- 1,042
- References
- 45
- FWCI
- 57.11
- Type
- journal article
- Language
- en
- Open access
- bronze
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.