Distributed data mining: a survey
The DOI matches its Crossref record; 57 of the 58 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“From time to time, conveying large amounts of data to a data centre is costly and unrealistic and to solve this problem data mining algorithms have been developed [183].”
From Edge AI: A survey (2023) · cites this paper as [183]
Citations
Cites
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
Foster, I., Kesselman, C., & Tuecke, S. (2001) · The International Journal of High Performance Computing Applications · doi:10.1177/109434200101500302 · Cited by 6,547 · cited 1×
“Today, grids can be used as effective infra-structures for distributed high-performance computing and data processing [4, 15].”
Bayesian Model Averaging for Linear Regression Models
Raftery, A. E., Hoeting, J. A., & Madigan, D. (1997) · Cited by 1,746
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480 · cited 1×
“The approach proposed by Kempe [24] relied on uniform gossip-based randomized algorithms for computing aggregate information.”
Bayesian Model Averaging for Linear Regression Models
Raftery, A. E., Madigan, D., & Hoeting, J. A. (1997) · Journal of the American Statistical Association · doi:10.1080/01621459.1997.10473615 · Cited by 1,287 · cited 1×
“an ensemble include Bayesian model averaging for regression models [44], partition learning [19].”
Enterprise Systems: State-of-the-Art and Future Trends
Xu, L. D. (2011) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2011.2167156 · Cited by 678 · cited 2×
“Grid computing therefore is described as seamless, pervasive access to resources and services [58, 59].”
Parallel K-Means Clustering Based on MapReduce
Zhao, W., Ma, H., & He, Q. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10665-1_71 · Cited by 626 · cited 1×
“They successfully implemented k-means clustering [63] and the Apriori frequent itemset mining algorithms [60] in this framework.”
Liu, K., Kargupta, H., & Ryan, J. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.14 · Cited by 554 · cited 1×
“…advances in peer-to-peer and service-oriented technologies, grid computing, high-performance computing, issues on distributed computing such as limitation on data transmission bandwidth, skew distribution, very-large data size, privacy preservation [35] still need serious and immediate attention.”
Parallel and distributed association mining: a survey
Zaki, M. J. (1999) · IEEE Concurrency · doi:10.1109/4434.806975 · Cited by 475 · cited 2×
“The most representative example of peer-to-peer distributed data mining is distributed association rule mining [60] and distributed decision tree [28].”
SETI@home-massively distributed computing for SETI
Korpela, E., Werthimer, D., Anderson, D., Cobb, J., & Leboisky, M. (2001) · Computing in Science & Engineering · doi:10.1109/5992.895191 · Cited by 429
Babcock, B., & Olston, C. (2003) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/872757.872764 · Cited by 429 · cited 2×
“Similar work by Babcock et al. [3] assumed a centralized coordinator site and a hierarchical topology for global conflict resolution, and proved that distributed communication is only necessary occasionally.”
Research works printed but not linked: 5
- Datta S, Giannella C, Kargupta H (2006) K-means clustering over large, dynamic networks. In: Proceedings of 2006 SIAM conference data mining (SDM 06). SIAM Press, 2006, pp 153–164
- Kumar V, Grama A, Gupta A, Karpis G (2003) Introduction to parallel computing: design and analysis of parallel algorithms. Addison Wesley, Reading, MA
- Guo Y, Ruger S, Sutiwaraphun J, Forbes-millott J (1997) Meta-learning for parallel data mining. In: Proceedings of the seventh parallel computing workshop, pp 1–2
- Kargupta H, Sanseverino E, Park B, Silvestre L, Hershberger D (1999) Scalable data mining from vertically partitioned feature space using collective mining and gene expression based genetic algorithms. KDD-98 workshop on distributed data mining
- Kargupta H, Hoon B, Hershberger D, Johnson E (1999) Collective data mining: a new perspective towards distributed data mining. In: Kargupta H, Chan P (eds) Advances in distributed and parallel knowledge discovery. MIT/AAAI Press, Cambridge, MA, pp 133–184
Cited by
Social media competitive analysis and text mining: A case study in the pizza industry
He, W., Zha, S., & Li, L. (2013) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2013.01.001 · Cited by 898
“Text mining is an emerging technology that attempts to extract meaningful information from unstructured textual data Text mining is an extension of data mining to textual data (Ananiadou, 2008; Liu, Cao, & He, 2011; Romero & Ventura, 2010; Zafra & Ventura, 2009; Zeng et al., 2012b .”
Self-citationA Survey on Distributed Machine Learning
Verbraeken, J., Wolting, M., Katzy, J., Kloppenburg, J., Verbelen, T., & Rellermeyer, J. S. (2021) · ACM Computing Surveys · doi:10.1145/3377454 · Cited by 872
“In contrast to prior surveys on distributed machine learning ([120][124]) or related � elds ([153][87][123][122][171][144]) we apply a wholistic view to the problem and discuss the practical aspects of state-of-the-art machine learning from a distributed systems angle.”
Singh, R., & Gill, S. S. (2023) · Internet of Things and Cyber-Physical Systems · doi:10.1016/j.iotcps.2023.02.004 · Cited by 572
Developing Vehicular Data Cloud Services in the IoT Environment
He, W., Yan, G., & Xu, L. D. (2014) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2014.2299233 · Cited by 561
“The core of any datamining service is the data mining models [37], [38].”
BackgroundZhang, C., & Chen, Y. (2020) · Journal of Industrial Integration and Management · doi:10.1142/s2424862219500192 · Cited by 313
Metadata
- Authors
- Zeng, L., Li, L., Duan, L., Lu, K., Shi, Z., Wang, M., Wu, W., & Luo, P.
- Affiliations
- Chinese Academy of Sciences (CN)
- Old Dominion University (US)
- New Jersey Institute of Technology (US)
- Renmin University of China (CN)
- Corresponding author
- Duan, Lian
- Venue
- Information Technology and Management
- Published
- 2012-05-17
- Volume
- 13
- Issue
- 4
- Pages
- 403-409
- ISSN
- 1385-951X (ISSN-L)
- 1573-7667
- OpenAlex
- W2076726698
- Cited by
- 85
- References
- 58
- Citations by year
- 2026: 2 · 2025: 1 · 2024: 2 · 2023: 2 · 2022: 6 · 2021: 5 · 2020: 5 · 2019: 12 · 2018: 6 · 2017: 6 · 2016: 5 · 2015: 9 · 2014: 9 · 2013: 10 · 2012: 5
- FWCI
- 28.67
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Information Technology and Management (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Keywords
- distributed data mining, parallel data mining, distributed algorithms, data transfer cost, distributed data sources
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: Distributed data mining: a survey. https://app.cochat.ai/papers/10.1007/s10799-012-0124-y
- The paper
- Zeng, L., Li, L., Duan, L., Lu, K., Shi, Z., Wang, M., Wu, W., & Luo, P. (2012). Distributed data mining: a survey. Information Technology and Management. https://doi.org/10.1007/s10799-012-0124-y
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.