The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Parallel K-Means Clustering Based on MapReduce
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
(1967) · Cited by 23,719
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
The Hadoop Distributed File System
Shvachko, K., Kuang, H., Radia, S., & Chansler, R. (2010) · 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) · doi:10.1109/msst.2010.5496972 · Cited by 4,834
Evaluating MapReduce for Multi-core and Multiprocessor Systems
Ranger, C., Raghuraman, R., Penmetsa, A., Bradski, G., & Kozyrakis, C. (2007) · 2007 IEEE 13th International Symposium on High Performance Computer Architecture · doi:10.1109/hpca.2007.346181 · Cited by 966
Google’s MapReduce programming model — Revisited
Lämmel, R. (2008) · Science of Computer Programming · doi:10.1016/j.scico.2007.07.001 · Cited by 489
Parallel algorithms for hierarchical clustering
Olson, C. F. (1995) · Parallel Computing · doi:10.1016/0167-8191(95)00017-i · Cited by 404
Cited by
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
Social big data: recent achievements and new challenges
Bello-Orgaz, G., Jung, J. J., & Camacho, D. (2016) · Information Fusion · doi:10.1016/j.inffus.2015.08.005 · Cited by 846
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
Bahmani, B., Moseley, B., Vattani, A., Kumar, R., & Vassilvitskii, S. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2180912.2180915 · Cited by 628
Deep Learning for Anomaly Detection in Time-Series Data: Review, Analysis, and Guidelines
Choi, K., Yi, J., Park, C., & Yoon, S. (2021) · IEEE Access · doi:10.1109/access.2021.3107975 · Cited by 588
Metadata
- Authors
- Zhao, W., Ma, H., & He, Q.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 674-679
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2116762767
- Cited by
- 626
- References
- 7
- FWCI
- 11.99
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Parallel K-Means Clustering Based on MapReduce. https://app.cochat.ai/papers/10.1007/978-3-642-10665-1_71
- The paper
- Zhao, W., Ma, H., & He, Q. (2009). Parallel K-Means Clustering Based on MapReduce. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-10665-1_71
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.