Skip to main content

Agglomerative Clustering Using Asymmetric Similarities

  • Conference paper
Modeling Decision for Artificial Intelligence (MDAI 2011)

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

Abstract

Algorithms of agglomerative hierarchical clustering using asymmetric similarity measures are studied. Two different measures between two clusters are proposed, one of which generalizes the average linkage for symmetric similarity measures. Asymmetric dendrogram representation is considered after foregoing studies. It is proved that the proposed linkage methods for asymmetric measures have no reversals in the dendrograms. Examples based on real data show how the methods work.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderberg, M.R.: Cluster Analysis for Applications. Academic Press, New York (1960)

    MATH  Google Scholar 

  2. Everitt, B.S.: Cluster Analysis, 3rd edn. Arnold, London (1993)

    MATH  Google Scholar 

  3. Hubert, L.: Min and max hierarchical clustering using asymmetric similarity measures. Psychometrika 38(1), 63–72 (1973)

    Article  MATH  Google Scholar 

  4. Miyamoto, S.: Fuzzy Sets in Information Retrieval and Cluster Analysis. Kluwer, Dordrecht (1990)

    Book  MATH  Google Scholar 

  5. Miyamoto, S.: Introduction to Cluster Analysis. Morikita-Shuppan, Tokyo (1999) (in Japanese)

    Google Scholar 

  6. Okada, A., Iwamoto, T.: A Comparison before and after the Joint First Stage Achievement Test by Asymmetric Cluster Analysis. Behaviormetrika 23(2), 169–185 (1996)

    Article  Google Scholar 

  7. Saito, T., Yadohisa, H.: Data Analysis of Asymmetric Structures. Marcel Dekker, New York (2005)

    MATH  Google Scholar 

  8. Stigler, S.M.: Citation Patterns in the Journals of Statistics and Probability. Statistical Science 9, 94–108 (1994)

    Article  Google Scholar 

  9. Takeuchi, A., Saito, T., Yadohisa, H.: Asymmetric agglomerative hierarchical clustering algorithms and their evaluations. Journal of Classification 24, 123–143 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Yadohisa, H.: Formulation of Asymmetric Agglomerative Clustering and Graphical Representation of Its Result. J. of Japanese Society of Computational Statistics 15(2), 309–316 (2002) (in Japanese)

    MathSciNet  Google Scholar 

  11. http://www.jetro.go.jp/indexj.html

  12. http://www.stat.go.jp/index.htm

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takumi, S., Miyamoto, S. (2011). Agglomerative Clustering Using Asymmetric Similarities. In: Torra, V., Narakawa, Y., Yin, J., Long, J. (eds) Modeling Decision for Artificial Intelligence. MDAI 2011. Lecture Notes in Computer Science(), vol 6820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22589-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22589-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22588-8

  • Online ISBN: 978-3-642-22589-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics