Skip to main content
Log in

PHC: A fast partition and hierarchy-based clustering algorithm

  • Notes
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Jiawei Han, Micholine Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Press, June, 2000, pp.346–348.

  2. Kaufman L, Rousseeuw P J. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, 1990.

  3. Ng R, Han J. Efficient and effective clustering method for spatial data mining. InProc. 1994 Int. Conf. Very Large Data Bases (VLDB'94), Santiago, Chile, September, 1994, pp.144–155.

  4. Zhang T, Ramakrishnan R, Livny M. BIRCH: An efficient data clustering method for very large databases. InProc. 1996 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'96), Montreal, Canada, June, 1996, pp.103–114.

  5. Guha S, Rastogi R, Shim K. Cure: An efficient clustering algorithm for large databases. InProc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), Seattle, Washington, June, 1998, pp.73–84.

  6. Guha S, Rastogi R, Shim K. Rock: A robust clustering algorithm for categorical attributes. InProc. 1999 Int. Conf. Data Engineering (ICDE'99), Sydney, Australia, March, 1999, pp.512–521.

  7. Karypis G, Han E H (S), Kumar V. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling.COMPUTER, 1999, 32: 68–75.

    Article  Google Scholar 

  8. URL: http://www.cs.umn.edu/≈han/chameleon.html

  9. Karypis G. CLUTO: A Clustering Toolkit. Dept. of Computer Science, University of Minnesota, May, 2002.

  10. Kolatch E. Clustering Algorithms for Spatial Database: A Survey. Available at URL http://citeseer.nj.nec.com/496843.html

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to HaoFeng Zhou.

Additional information

This work was supported by the National Natural Science Foundation of China (Grant No.69933010).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, H., Yuan, Q., Cheng, Z. et al. PHC: A fast partition and hierarchy-based clustering algorithm. J. Comput. Sci. & Technol. 18, 407–411 (2003). https://doi.org/10.1007/BF02948913

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948913

Keywords

Navigation