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 [], [] and a spanning tree-based clustering algorithm, called Clusterize []. 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.