A New Distributed Algorithm for Large Data Clustering

Authors:
D. K. Bhattacharyya;A. Das
Affiliations:
-;-
Venue:
IDEAL '00 Proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, Data Mining, Financial Engineering, and Intelligent Agents
Year:
2000

Citing 7
Cited 0

Algorithms for clustering data

Algorithms for clustering data
Knowledge discovery in databases: an overview

AI Magazine
Discovering data mining: from concept to implementation

Discovering data mining: from concept to implementation
A comparative study of clustering methods

Future Generation Computer Systems - Special double issue on data mining
Data Mining Techniques: For Marketing, Sales, and Customer Support

Data Mining Techniques: For Marketing, Sales, and Customer Support
Data Mining: An Overview from a Database Perspective

IEEE Transactions on Knowledge and Data Engineering
Efficient and Effective Clustering Methods for Spatial Data Mining

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new distributed data clustering algorithm, which operates successfully on huge data sets. The algorithm is designed based on a classical clustering algorithm, called PAM [8, 9] and a spanning tree-based clustering algorithm, called Clusterize [3]. It out-performs its counterparts both in clustering quality and execution time. The algorithm also better utilizes the computing resources associated with the clusterization process. The algorithm operates in linear time.