Skip to main content

On a Criterion of Similarity between Partitions Based on Rough Set Theory

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC 2009)

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

Abstract

In this paper, we introduce a criterion of similarity between partitions. The proposed similarity criterion is a generalization of an evaluation criterion of relative reducts proposed by the authors and evaluates the similarity of partitions by correctness and roughness with each other. Moreover, for comparison of similarity scores between different universes, we also propose a normalized similarity criterion.

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. Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: Efficient Discovery of Functional and Approximate Dependencies Using Partitions. In: Proc. of the 14th International Conference on Data Engineering, pp. 392–401 (1998)

    Google Scholar 

  2. Kryszkiewicz, M., Lasek, P.: FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute. Transactions on Rough Sets 9, 76–95 (2008)

    Google Scholar 

  3. Kudo, Y.: An Evaluation Method of Relative Reducts Based on Roughness of Partitions (Extended Abstract). In: The 6th International Conferences on Rough Sets and Current Trends in Computing (RSCTC 2008): Programs & Abstracts, pp. 26–29 (2008)

    Google Scholar 

  4. Kudo, Y., Murai, T.: An Evaluation Method of Relative Reducts Based on Roughness of Partition. International Journal of Cognitive Informatics and Natural Intelligence (to appear)

    Google Scholar 

  5. Pawlak, Z.: Rough Sets. International Journal of Computer and Information Science 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  6. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  7. Pawlak, Z., Słowiński, R.: Rough Set Approach to Multi-Attribute Decision Analysis. European Journal of Operation Research 74, 443–459 (1994)

    Article  Google Scholar 

  8. Polkowski, L.: Rough Sets: Mathematical Foundations. Advances in Soft Computing. Physica-Verlag, Heidelberg (2002)

    MATH  Google Scholar 

  9. Ślȩzak, D.: Approximate Entropy Reducts. Fundamenta Informaticae 53(3-4), 365–387 (2002)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kudo, Y., Murai, T. (2009). On a Criterion of Similarity between Partitions Based on Rough Set Theory. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2009. Lecture Notes in Computer Science(), vol 5908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10646-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10646-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10645-3

  • Online ISBN: 978-3-642-10646-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics