Abstract. To cluster increasingly massive data sets that are common today in data and text mining, we propose a parallel implementation of the k-means clustering algorithm based on the message passing model. The proposed algorithm exploits the inherent data-parallelism in the k-means algorithm. We analytically show that the speedup and the scaleup of our algorithm approach the optimal as the number of data points increases. We implemented our algorithm on an IBM POWERparallel SP2 with a maximum of 16 nodes. On typical test data sets, we observe nearly linear relative speedups, for example, 15:62 on 16 nodes, and essentially linear scaleup in the size of the data set and in the number of clusters desired. For a 2 gigabyte test data set, our implementation drives the 16 node SP2 at more than 1:8 giga
ops. 1
|
2979
|
Pattern Classification and Scene Analysis
– Duda, Hart
- 1973
|
|
1108
|
Vector Quantization and Signal Compression
– Gersho, Gray
- 1992
|
|
749
|
Using MPI: Portable Parallel Programming with the Message-Passing Interface, Second Edition
– Gropp, Lusk, et al.
- 1999
|
|
727
|
JA: Clustering Algorithms
– Hartigan
- 1975
|
|
488
|
MPI: The Complete Reference
– Snir, Otto, et al.
- 1995
|
|
419
|
Scatter/Gather: A clusterbased approach to browsing large document collections
– Cutting, Karger, et al.
- 1992
|
|
346
|
Bayesian Classification (AutoClass): Theory and Results
– Cheeseman, Stutz
- 1995
|
|
252
|
Syntactic clustering of the Web
– Broder, Glassman, et al.
- 1997
|
|
248
|
Livny: BIRCH: An efficient data clustering method for very large databases
– Zhang, Ramakrishnan, et al.
- 1996
|
|
208
|
SPRINT: A Scalable Parallel Classifier for Data Mining
– Shafer, Agrawal, et al.
- 1996
|
|
207
|
Web document clustering: A feasibility demonstration
– Zamir, Etzioni
- 1998
|
|
177
|
Concept decompositions for large sparse text data using clustering
– Dhillon, Modha
|
|
153
|
Pattern Classi and Scene Analysis
– Duda, Hart
- 1973
|
|
127
|
Scalable parallel data mining for association rules
– Han, Karypis, et al.
|
|
112
|
Clustering algorithms
– Rasmussen
- 1992
|
|
93
|
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
– Fukunaga, Narendra
- 1975
|
|
74
|
LogP: a practical model of parallel computation
– Culler, Karp, et al.
- 1996
|
|
74
|
Recent trends in hierarchical document clustering: a critical review
– Willet
- 1988
|
|
70
|
Document categorization and query generation on the world wide web using webace
– Boley, Gini, et al.
|
|
60
|
Mining Very Large Databases with Parallel Processing
– Freitas, Lavington
- 1998
|
|
55
|
Parallel mining of association rules: Design, implementation, and experience
– Agrawal, Shafer
- 1996
|
|
52
|
Convergence Properties of the k-Means Algorithms
– Bottou, Bengio
- 1995
|
|
43
|
W.Li. Parallel algorithms for fast discovery of association rules
– Zaki, Parthasarathy, et al.
- 1997
|
|
41
|
ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining
– Joshi, Karypis, et al.
- 1998
|
|
37
|
M.Q.W.: SONIA: a service for organizing networked information autonomously
– Sahami, Yusufali, et al.
- 1998
|
|
32
|
The complexity of the generalized Lloyd–Max problem
– Garey, Johnson, et al.
- 1982
|
|
26
|
An efficient k-means clustering algorithm
– Alsabti, Ranka, et al.
- 1998
|
|
25
|
Visualizing Class Structures of Multi-Dimensional Data
– Dhillon, Modha, et al.
- 1998
|
|
24
|
The communication software and parallel environment of the IBM SP2
– Snir, Hochschild, et al.
- 1995
|
|
24
|
Birch: An ecient data clustering method for very large databases
– Zhang, Ramakrishnan, et al.
- 1996
|
|
24
|
Bayesian classi (AutoClass): Theory and results
– Cheeseman, Stutz
- 1996
|
|
22
|
Parallel formulations of decision-tree classification algorithms
– Srivastava, Han, et al.
- 1999
|
|
21
|
SPRINT: A scalable parallel classi for data mining
– Shafer, Agrawal, et al.
- 1996
|
|
19
|
Almost-Constant-Time Clustering for Arbitrary Corpus Subsets
– Silverstein, Pedersen
- 1997
|
|
18
|
von Eicken. LogP: a practical model of parallel computation
– Culler, Karp, et al.
- 1996
|
|
15
|
Parallel classification for data mining on shared-memory multiprocessors
– Zaki, Ho, et al.
- 1999
|
|
13
|
Large scale data mining: Challenges and responses
– Chattratichat, Darlington, et al.
- 1997
|
|
13
|
PADMA: Parallel Data Mining Agents For Scalable Text Classification
– Kargupta, Hamzaoglu, et al.
- 1996
|
|
10
|
The EM Algorithm and Extentions
– McLachlan, Krishnan
- 1996
|
|
10
|
Effect of data distribution in parallel mining of associations
– Cheung, Xiao
- 1999
|
|
9
|
Programming With Unix Threads
– NORTHRUP
- 1996
|
|
8
|
Detecting atmospheric regimes using cross-validated clustering
– Smyth, Ghil, et al.
- 1997
|
|
6
|
Scalparc: A new scalable and ecient parallel classi algorithm for mining large datasets
– Joshi, Karypis, et al.
- 1998
|
|
6
|
The Communication Software and Parallel Environment
– Snir, Hochschild, et al.
- 1995
|
|
5
|
Using cluster analysis to classify time series
– Shaw, King
- 1992
|
|
4
|
An algorithm for creating artificial test clusters
– Milligan
- 1985
|
|
4
|
Parallel classi for data mining on shared-memory multiprocessors
– Zaki, Ho, et al.
- 1999
|
|
3
|
Scalable High Performance Computing for Knowledge Discovery and Data Mining
– Stolorz, Musick
- 1997
|
|
2
|
W.S.: Visualizing class structure of highdimensional data with applications
– Dhillon, Modha, et al.
- 1999
|
|
1
|
E#ect of data distribution in parallel mining of associations. Data Mining and Knowledge Discovery
– Cheung, Xiao
- 1999
|
|
