PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data
Proceedings - International Database Engineering and Applications Symposium2006pp. 315–316
Citations Over TimeTop 10% of 2006 papers
Abstract
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyclic manner (or block cyclic manner if the data is bursty) to balance the load among processors. The algorithm is implemented on a message passing share-nothing model. Experiments show that for very large data sets the algorithm scales nearly linearly with the increasing number of processors. Experiments also show that clusters obtained by PBIRCH are comparable to those obtained using BIRCH
Related Papers
- → Scalability Issues of Blockchain Technology(2020)30 cited
- → Reparameterization Gradient Message Passing(2019)4 cited
- → On the scalability of multistage interconnection networks(2004)3 cited
- → Using Empirical Data for Scalability Analysis of Parallel Applications(2019)1 cited
- RESEARCH ON THE SCALABILITY OF THE LARGE SCALE PARALLEL APPLICATION PROGRAMS(2000)