Skip to main content

Generalized Agglomerative Clustering with Application to Information Systems

  • Conference paper
Modeling Decisions for Artificial Intelligence (MDAI 2008)

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

  • 814 Accesses

Abstract

Although data clustering is relatively uninvestigated in rough set studies, there are much room for applying clustering and related techniques to this field. In this paper we focus on generalization of agglomerative clustering to information systems. A poset-valued hierarchical clustering is defined and the combination of traditional agglomerative clustering and lattice diagram of attributes in an information system is considered. Inner product spaces are available to information systems by using kernel functions in support vector machines. Different algorithms for generalized agglomerative clustering using the inner product are described. Illustrative examples are 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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum, New York (1981)

    Book  MATH  Google Scholar 

  2. Chellas, B.F.: Modal Logic. Cambridge University Press, Cambridge (1980)

    Book  MATH  Google Scholar 

  3. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley, New York (2001)

    MATH  Google Scholar 

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

    Google Scholar 

  5. Hirano, S., Tsumoto, S.: A framework for unsupervised selection of indiscernibility threshold in rough clustering. In: Greco, S., et al. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 872–881. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Lingras, P., West, C.: Interval set clustering of web users with rough K-means. J. of Intel. Informat. Sci. 23(1), 5–16 (2004)

    Article  MATH  Google Scholar 

  7. MacLane, S., Birkhoff, G.: Algebra, 2nd edn. Macmillan, Basingstoke (1979)

    MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  9. Miyamoto, S., Mukaidono, M.: Fuzzy c-means as a regularization and maximum entropy approach. In: Proc. of the 7th International Fuzzy Systems Association World Congress (IFSA 1997), Prague, Czech, June 25-30, 1997, vol. II, pp. 86–92 (1997)

    Google Scholar 

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

    Google Scholar 

  11. Miyamoto, S., Suizu, D.: Fuzzy c-means clustering using transformations into high dimensional spaces. In: Proc. of FSKD 2002: 1st International Conference on Fuzzy Systems and Knowledge Discovery, Singapore, November 18-22, 2002, pp. 656–660 (2002)

    Google Scholar 

  12. Miyamoto, S., Nakayama, Y.: Algorithms of hard c-means clustering using kernel functions in support vector machines. Journal of Advanced Computational Intelligence and Intelligent Informatics 7(1), 19–24 (2003)

    Article  Google Scholar 

  13. Miyamoto, S., Suizu, D.: Fuzzy c-means clustering using kernel functions in support vector machines. Journal of Advanced Computational Intelligence and Intelligent Informatics 7(1), 25–30 (2003)

    Article  Google Scholar 

  14. Miyamoto, S.: Data Clustering Algorithms for Information Systems. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds.) RSFDGrC 2007. LNCS (LNAI), vol. 4482, pp. 13–24. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  17. Scholkopf, B., Burges, C.J.C., Smola, A.J. (eds.): Advances in Kernel Methods: Support Vector Learning. MIT, Cambridge (1999)

    Google Scholar 

  18. Vapnik, V.N.: Statistical Learning Theory. Wiley, Chichester (1998)

    MATH  Google Scholar 

  19. Yao, Y.Y., Wong, S.K.M., Lin, T.Y.: A review of rough set models. In: Lin, T.Y., Cercone, N. (eds.) Rough Sets and Data Mining: Analysis of Imprecise Data, pp. 47–75. Kluwer, Boston (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miyamoto, S. (2008). Generalized Agglomerative Clustering with Application to Information Systems. In: Torra, V., Narukawa, Y. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2008. Lecture Notes in Computer Science(), vol 5285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88269-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88269-5_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88268-8

  • Online ISBN: 978-3-540-88269-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics