Skip to main content

An Agglomerative Hierarchical Clustering by Finding Adjacent Hyper-Rectangles

  • Conference paper
  • 1221 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4259))

Abstract

This paper proposes a new clustering method based on connecting adjacent hyper-rectangles. Our method searches a set of hyper-rectangles that satisfies the properties that (1) each hyper-rectangle covers some of the samples, and (2) each sample is covered by at least one of the hyper-rectangles. Then, a correction of connected hyper-rectangles is assumed to be a cluster. We apply agglomerative hierarchical clustering method to realize the clustering based on connecting adjacent hyper-rectangles. The effectiveness of the proposed method is shown by applying artificial data sets. This paper also considers on a way for speeding up of the agglomerative hierarchical clustering.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bazan, J.G., Szczuka, M.S.: RSES and RSESlib - A Collection of Tools for Rough Set Computations. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 106–113. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Bazan, J.G., Szczuka, M.S., Wróblewski, J.: A New Version of Rough Set Exploration System. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 397–404. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Takagi, N., Han, J.: A System for Realizing Value Reduction Techenology of Rough Sets. In: Proceedings of 4th IEEE International Symposium of Human and Artificial Intelligence Systems, pp. 247–252 (2004)

    Google Scholar 

  4. Miyamoto, S., Nakayama, Y.: Algorithms of Hard c-Means Clustering Using Kernel Function in Support Vector Machines. J. of Advanced Computational Intelligence 7(1), 19–24 (2003)

    Google Scholar 

  5. Yanagida, R., Takagi, N.: Consideration on Cluster Analysis Based on Connecting Adjacent Hyper-Rectangles. In: Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, pp. 2795–2800 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takagi, N. (2006). An Agglomerative Hierarchical Clustering by Finding Adjacent Hyper-Rectangles. In: Greco, S., et al. Rough Sets and Current Trends in Computing. RSCTC 2006. Lecture Notes in Computer Science(), vol 4259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908029_70

Download citation

  • DOI: https://doi.org/10.1007/11908029_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47693-1

  • Online ISBN: 978-3-540-49842-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics