Skip to main content

Research on Hierarchical Clustering Algorithm Based on Cluster Outline

  • Conference paper
  • First Online:
Proceedings of International Conference on Soft Computing Techniques and Engineering Application

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 250))

Abstract

The traditional hierarchical methods always fail to take both the features of connectivity and proximity of clusters into consideration at the same time. This paper presents a hierarchical clustering algorithm based on cluster outline, which effectively addresses clusters of arbitrary shapes and sizes, and is relatively resistant to noise and easily detects outliers. The definition of the boundary point and cluster outline is firstly given, and the standard and approach of measuring similarity between clusters is then taken with the feature of connectivity and proximity of clusters. The experiments on the Iris and image data sets confirm the feasibility and validity of the algorithm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An efficient data clustering method for very large databases. Technical Report, Computer Sciences Department, University of Wisconsin–Madison (1995)

    Google Scholar 

  2. Guha, S., Rastogi, R., Shim, K.: Cure: An efficient clustering algorithm for large database. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 73–84, Seattle, Washington (1998)

    Google Scholar 

  3. Guha, S., Rastogi, R., Shim, K.: ROCK: A robust clustering algorithm for categorical attributes. In: Proceedings of the 15th ICDE, pp. 512–521, Sydney (1999)

    Google Scholar 

  4. Karypis, G., Han, E.-H., Kumar, V.: Chameleon: hierarchical clustering using dynamic modeling. Computer 32(8), 68–75 (1999)

    Article  Google Scholar 

  5. Long, Zhen-Zhen, Zhang, C., Liu, F.-Y., Zhang, Z.-W.: An improved chameleon algorithm. Comput. Eng. 20(35), 189–191 (2009)

    Google Scholar 

  6. Ma, X.-Y., Tang, Y.: Research on hierarchical clustering algorithm. Comput. Sci. 34(7), 34–36 (2008)

    Google Scholar 

Download references

Acknowledgments

The research is founded in part by The Natural Science Foundation of Inner Mongolia under Grant No. 2012MS0611, Chunhui Project of Ministry of Education under Grant No. Z2009-1-01041, and Higher School Science Research Project of Inner Mongolia under Grant No. NJZZ11140.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hai-Dong Meng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Meng, HD., Ren, JP., Song, YC. (2014). Research on Hierarchical Clustering Algorithm Based on Cluster Outline. In: Patnaik, S., Li, X. (eds) Proceedings of International Conference on Soft Computing Techniques and Engineering Application. Advances in Intelligent Systems and Computing, vol 250. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1695-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1695-7_1

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1694-0

  • Online ISBN: 978-81-322-1695-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics