Skip to main content

Lattice-Valued Hierarchical Clustering for Analyzing Information Systems

  • Conference paper
Rough Sets and Current Trends in Computing (RSCTC 2006)

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

Included in the following conference series:

Abstract

A generalization of hierarchical clustering is proposed in which the dendrogram is replaced by clusters attached to a lattice diagram. Hence the method is called lattice-valued hierarchical clustering. Different algorithms of lattice-valued clustering are described with application to information systems in the form of tables studied in rough sets. A simple example is given whereby how the concept of the lattice-valued hierarchical clustering is related to classifications in rough sets is shown.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birkhoff, G.: Lattice Theory. Amer. Math. Soc. (1967)

    Google Scholar 

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

    Google Scholar 

  3. Liu, Z.Q., Miyamoto, S. (eds.): Soft Computing and Human-Centered Machines. Springer, Tokyo (2000)

    Google Scholar 

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

    MATH  Google Scholar 

  5. Miyamoto, S.: Introduction to Cluster Analysis: Theory and Applications of Fuzzy Clustering. Morikita-Shuppan, Tokyo (1990) (in Japanese)

    Google Scholar 

  6. Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pawlak, Z.: Rough Sets. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  8. Ullman, J.D.: Database and Knowledge-base Systems, vol. I. Computer Science Press, Rockville (1988)

    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

Miyamoto, S. (2006). Lattice-Valued Hierarchical Clustering for Analyzing Information Systems. 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_94

Download citation

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

  • 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