Skip to main content

Precision of Rough Set Clustering

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

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

Included in the following conference series:

Abstract

Conventional clustering algorithms categorize an object into precisely one cluster. In many applications, the membership of some of the objects to a cluster can be ambiguous. Therefore, an ability to specify membership to multiple clusters can be useful in real world applications. Fuzzy clustering makes it possible to specify the degree to which a given object belongs to a cluster. In Rough set representations, an object may belong to more than one cluster, which is more flexible than the conventional crisp clusters and less verbose than the fuzzy clusters. The unsupervised nature of fuzzy and rough algorithms means that there is a choice about the level of precision depending on the choice of parameters. This paper describes how one can vary the precision of the rough set clustering and studies its effect on synthetic and real world data sets.

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. Banerjee, M., Mitra, S., Pal, S.K.: Rough fuzzy MLP: knowledge encoding and classification. IEEE Transactions on Neural Networks 9(6), 1203–1216 (1998)

    Article  Google Scholar 

  2. Ho, T.B., Nguyen, N.B.: Nonhierarchical Document Clustering by a Tolerance Rough Set Model. International Journal of Intelligent Systems 17(2), 199–212 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hartigan, J.A., Wong, M.A.: Algorithm AS136: A K-Means Clustering Algorithm. Applied Statistics 28, 100–108 (1979)

    Article  MATH  Google Scholar 

  4. Hirano, S., Tsumoto, S.: Rough Clustering and Its Application to Medicine. Information Sciences 124, 125–137 (2000)

    Article  Google Scholar 

  5. Lingras, P.: Unsupervised Rough Set Classification using GAs. Journal Of Intelligent Information Systems 16(3), 215–228 (2001)

    Article  MATH  Google Scholar 

  6. Lingras, P., West, C.: Interval Set Clustering of Web Users with Rough K-means. Journal of Intelligent Information Systems 23(1), 5–16 (2004)

    Article  MATH  Google Scholar 

  7. Lingras, P., Hogo, M., Snorek, M.: Interval Set Clustering of Web Users using Modified Kohonen Self-Organizing Maps based on the Properties of Rough Sets. Web Intelligence and Agent Systems: An International Journal 2(3), 217–230 (2004)

    Google Scholar 

  8. Mitra, S.: An evolutionary rough partitive clustering. Pattern Recognition Letters 25, 1439–1449 (2004)

    Article  Google Scholar 

  9. Mitra, S., Bank, H., Pedrycz, W.: Rough-Fuzzy Collaborative Clustering. IEEE Trans. on Systems, Man and Cybernetics 36(4), 795–805 (2006)

    Article  Google Scholar 

  10. Nguyen, H.S.: Rough Document Clustering and the Internet. Handbook on Granular Computing (2007)

    Google Scholar 

  11. Pedrycz, W., Waletzky, J.: Fuzzy Clustering with Partial Supervision. IEEE Trans. on Systems, Man and Cybernetics 27(5), 787–795 (1997)

    Article  Google Scholar 

  12. Polkowski, L., Skowron, A.: Rough Mereology: A New Paradigm for Approximate Reasoning. International Journal of Approximate Reasoning 15(4), 333–365 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  13. Peters, J.F., Skowron, A., Suraj, Z., Rzasa, W., Borkowski, M.: Clustering: A rough set approach to constructing information granules. In: Proceedings of 6th International Conference on Soft Computing and Distributed Processing, Rzeszow, Poland, June 24-25, 2002, pp. 57–61 (2002)

    Google Scholar 

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

    MATH  Google Scholar 

  15. Peters, G.: Some Refinements of Rough k-Means. Pattern Recognition 39(8), 1481–1491 (2006)

    Article  MATH  Google Scholar 

  16. Yao, Y.Y.: Constructive and algebraic methods of the theory of rough sets. Information Sciences 109, 21–47 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  17. Yao, Y.Y., Zhao, Y.: Attribute reduction in decision-theoretic rough set models. Information Sciences (to appear, 2008)

    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

Lingras, P., Chen, M., Miao, D. (2008). Precision of Rough Set Clustering. In: Chan, CC., Grzymala-Busse, J.W., Ziarko, W.P. (eds) Rough Sets and Current Trends in Computing. RSCTC 2008. Lecture Notes in Computer Science(), vol 5306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88425-5_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88425-5_38

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics