Skip to main content
SpringerLink
Log in
Book cover

Transactions on Rough Sets XVI pp 53–72Cite as

The Concept of Reducts in Pawlak Three-Step Rough Set Analysis

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 7736))

Abstract

Rough set approaches to data analysis involve removing redundant attributes, redundant attribute-value pairs, and redundant rules in order to obtain a minimal set of simple and general rules. Pawlak arranges these tasks into a three-step sequential process based on a central notion of reducts. However, reducts used in different steps are defined and formulated differently. Such an inconsistency in formulation may unnecessarily affect the elegancy of the approach. Therefore, this paper introduces a generic definition of reducts of a set, uniformly defines various reducts used in rough set analysis, and examines several mathematically equivalent, but differently formulated, definitions of reducts. Each definition captures a different aspect of a reduct and their integration provides new insights.

This is a preview of subscription content, log in via an institution.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bazan, J.G., Skowron, A., Synak, P.: Dynamic Reducts as a Tool for Extracting Laws from Decisions Tables. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS (LNAI), vol. 869, pp. 346–355. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  2. Blaszczynski, J., Slowinski, R., Szelag, M.: Sequential covering rule induction algorithm for variable consistency rough set approaches. Information Sciences 181, 987–1002 (2011)

    Article  MathSciNet  Google Scholar 

  3. Cendrowska, J.: PRISM: An algorithm for inducing modular rules. International Journal of Man-Machine Studies 27, 349–370 (1987)

    Article  MATH  Google Scholar 

  4. Fürnkranz, J.: Separate-and-conquer rule learning. Artificial Intelligence Review 13, 3–54 (1999)

    Article  MATH  Google Scholar 

  5. Janusz, A., Ślęzak, D.: Utilization of attribute clustering methods for scalable computation of reducts from high-dimensional data. In: Federated Conference on Computer Science and Information Systems, pp. 307–313 (2012)

    Google Scholar 

  6. Grzymala-Busse, J.: LERS - A system for learning from examples based on rough sets. In: Slowinski, R. (ed.) Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory, pp. 3–18. Kluwer Academic Publishers, Dordrecht (1992)

    Chapter  Google Scholar 

  7. Grzymala-Busse, J., Rzasa, W.: Approximation space and LEM2-like algorithms for computing local coverings. Fundamenta Informaticae 85, 205–217 (2008)

    MathSciNet  MATH  Google Scholar 

  8. Mi, J.S., Leung, Y., Wu, W.Z.: Dependence-space-based attribute reduction in consistent decision tables. Soft Computing 15, 261–268 (2011)

    Article  MATH  Google Scholar 

  9. Miao, D.Q., Zhao, Y., Yao, Y.Y., Li, H.X., Xu, F.F.: Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model. Information Sciences 179, 4140–4150 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Moshkov, M.J., Piliszczuk, M., Zielosko, B.: Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications. Springer, Berlin (2008)

    MATH  Google Scholar 

  11. Nguyen, H.S., Ślęzak, D.: Approximate Reducts and Association Rules. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 137–145. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  14. Pawlak, Z., Skowron, A.: Rough sets and Boolean reasoning. Information Sciences 177, 41–73 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Quinlan, J.R.: Induction of decision trees. Machine Learning 1, 81–106 (1986)

    Google Scholar 

  16. Ślęzak, D.: Association Reducts: A Framework for Mining Multi-attribute Dependencies. In: Hacid, M.-S., Murray, N.V., Raś, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS (LNAI), vol. 3488, pp. 354–363. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Ślęzak, D., Janusz, A.: Ensembles of Bireducts: Towards Robust Classification and Simple Representation. In: Kim, T.-H., Adeli, H., Slezak, D., Sandnes, F.E., Song, X., Chung, K.-I., Arnett, K.P. (eds.) FGIT 2011. LNCS (LNAI), vol. 7105, pp. 64–77. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. van Mechelen, I., Hampton, J., Michalski, R.S., Theuns, P. (eds.): Categories and Concepts: Theoretical Views and Inductive Data Analysis. Academic Press, New York (1993)

    Google Scholar 

  19. Wu, W.Z.: Knowledge reduction in random incomplete decision tables via evidence theory. Fundamenta Informaticae 115, 203–218 (2012)

    MathSciNet  MATH  Google Scholar 

  20. Yao, Y., Deng, X.: A Granular Computing Paradigm for Concept Learning. In: Ramanna, S., Howlett, R.J. (eds.) Emerging Paradigms in ML and Applications. SIST, vol. 13, pp. 307–326. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  21. Yao, Y., Fu, R.: Partitions, Coverings, Reducts and Rule Learning in Rough Set Theory. In: Yao, J.T., Ramanna, S., Wang, G., Suraj, Z. (eds.) RSKT 2011. LNCS (LNAI), vol. 6954, pp. 101–109. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  22. Yao, Y., Zhao, Y., Wang, J.: On Reduct Construction Algorithms. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS (LNAI), vol. 4062, pp. 297–304. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  23. Yao, Y., Zhou, B., Chen, Y.H.: Interpreting Low and High Order Rules: A Granular Computing Approach. In: Kryszkiewicz, M., Peters, J.F., Rybiński, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 371–380. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  24. Zhang, W.X., Mi, J.S., Wu, W.Z.: Approaches to knowledge reductions in inconsistent systems. International Journal of Intelligent Systems 18, 989–1000 (2003)

    Article  MATH  Google Scholar 

  25. Zhao, Y., Yao, Y.Y., Yao, J.T.: Level construction of decision trees for classification. International Journal Software Engineering and Knowledge Engineering 16, 103–126 (2006)

    Article  Google Scholar 

  26. Zhu, W., Wang, F.Y.: Reduction and axiomization of covering generalized rough sets. Information Sciences 152, 217–230 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada, S4S 0A2

    Yiyu Yao & Rong Fu

Authors
  1. Yiyu Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rong Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Manitoba, Winnipeg, MB, Canada

    James F. Peters

  2. University of Warsaw, Poland

    Andrzej Skowron

  3. University of Winnipeg, MB, Canada

    Sheela Ramanna

  4. University of Rzeszów, Poland

    Zbigniew Suraj

  5. University of Calgary, AB, Canada

    Xin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Yao, Y., Fu, R. (2013). The Concept of Reducts in Pawlak Three-Step Rough Set Analysis. In: Peters, J.F., Skowron, A., Ramanna, S., Suraj, Z., Wang, X. (eds) Transactions on Rough Sets XVI. Lecture Notes in Computer Science, vol 7736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36505-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36505-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36504-1

  • Online ISBN: 978-3-642-36505-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation