Abstract

Cluster analysis is a process to classify data in a specified data set. In this field, much attention is paid to high-efficiency clustering algorithms. In this paper, the features in the current partition-based and hierarchy-based algorithms are reviewed, and a new hierarchy-based algorithm PHC is proposed by combining advantages of both algorithms, which uses the cohesion and the closeness to amalgamate the clusters. Compared with similar algorithms, the performance of PHC is improved, and the quality of clustering is guaranteed. And both the features were proved by the theoretic and experimental analyses in the paper.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call