Scalable parallel clustering for data mining on multicomputers

25Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes the design and implementation on MIMD parallel machines of P-AutoClass, a parallel version of the AutoClass system based upon the Bayesian method for determining optimal classes in large datasets. The P-AutoClass implementation divides the clustering task among the processors of a multicomputer so that they work on their own partition and exchange their intermediate results. The system architecture, its implementation and experimental performance results on different processor numbers and dataset sizes are presented and discussed. In particular, efficiency and scalability of P-AutoClass versus the sequential AutoClass system are evaluated and compared. © 2000 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Foti, D., Lipari, D., Pizzuti, C., & Talia, D. (2000). Scalable parallel clustering for data mining on multicomputers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1800 LNCS, pp. 390–398). Springer Verlag. https://doi.org/10.1007/3-540-45591-4_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free