Skip to main content

The M-Relative Reduct Problem

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2006)

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

Included in the following conference series:

  • 1029 Accesses

Abstract

Since there may exist many relative reducts for a decision table, some attributes that are very important from the viewpoint of human experts may fail to be included in relative reduct(s) computed by certain reduction algorithms. In this paper we present the concepts of M-relative reduct and core where M is a user specified attribute set to deal with this problem. M-relative reducts and cores can be obtained using M-discernibility matrices and functions. Their relationships with traditional definitions of relative reduct and core are closely investigated.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Wong, S.K.M., Ziarko, W.: On optimal decision rules in decision tables. Bulletin of polish academy of sciences 33, 693–696 (1985)

    MATH  MathSciNet  Google Scholar 

  3. Wang, G., Yu, H., Yang, D.: Decision table reduction based on conditional information entropy. Chinese Journal of Computers 25(7), 1–8 (2002)

    MathSciNet  Google Scholar 

  4. Min, F., Bai, Z., He, M., Liu, Q.: The reduct problem with specified attributes. In: Rough Sets and Soft Computing in Intelligent Agent and Web Technology, International Workshop at WI-IAT 2005, pp. 36–42 (2005)

    Google Scholar 

  5. Pawlak, Z.: Some issues on rough sets. In: Peters, J.F., Skowron, A., GrzymaÅ‚a-Busse, J.W., Kostek, B.z., Åšwiniarski, R.W., Szczuka, M. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 1–58. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Leung, Y., Li, D.: Maximal consistent block technique for rule acquisition in incomplete information systems. Information Sciences 153, 85–106 (2003)

    Article  MATH  MathSciNet  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

Min, F., Liu, Q., Tan, H., Chen, L. (2006). The M-Relative Reduct Problem. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_25

Download citation

  • DOI: https://doi.org/10.1007/11795131_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36297-5

  • Online ISBN: 978-3-540-36299-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics