Skip to main content

Certain, Generalized Decision, and Membership Distribution Reducts Versus Functional Dependencies in Incomplete Systems

  • Conference paper

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

Abstract

An essential notion in the theory of Rough Sets is a reduct, which is a minimal set of conditional attributes that preserves a required classification feature, e.g. respective values of an original or modified decision attribute. Certain decision reducts, generalized decision reducts, and membership distribution reducts belong to basic types of Rough Sets reducts. In our paper, we prove that reducts of these types are sets of conditional attributes functionally determining respective modifications of a decision attribute both in complete and incomplete information systems. However, we also prove that, unlike in the case of complete systems, the reducts in incomplete systems are not guaranteed to be minimal sets of conditional attributes that functionally determine respective modifications of the decision attribute.

Research has been supported by grant No 3 T11C 002 29 received from Polish Ministry of Education and Science.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Järvinen, J.: Pawlak’s Information Systems in Terms of Galois Connections and Functional Dependencies. Fundamenta Informaticae 75, 315–330 (2007)

    MATH  MathSciNet  Google Scholar 

  • Kryszkiewicz, M.: Rough Set Approach to Incomplete Information Systems. Journal of Information Sciences 112, 39–49 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  • Kryszkiewicz, M.: Properties of Incomplete Information Systems in the Framework of Rough Sets. In: Studies in Fuzziness and Soft Computing 18. Rough Sets in Knowledge Discovery 1, pp. 442–450. Physica Verlag, Heidelberg (1998)

    Google Scholar 

  • Kryszkiewicz, M.: Rules in Incomplete Information Systems. Journal of Information Sciences 113, 271–292 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Kryszkiewicz, M.: Rough Set Approach to Rules Generation from Incomplete Information Systems. The Encyclopedia of Computer Science and Technology. Marcel Dekker, Inc. New York, vol. 44, pp. 319–346 (2001)

    Google Scholar 

  • Kryszkiewicz, M.: Comparative Study of Alternative Types of Knowledge Reduction in Inconsistent Systems. Int’l Journal of Int. Systems 16(1), 105–120 (2001)

    MATH  Google Scholar 

  • Kryszkiewicz, M.: Comparative Study of Alternative Types of Knowledge Reduction in Inconsistent Systems - Revised. ICS Research Report 13/2004, Warsaw (October 2004)

    Google Scholar 

  • Lin, T.Y.: An Overview of Rough Set Theory from the Point View of Relational Databases. Bulletin of International Rough Set Society 1(1), 30–34 (1998)

    Google Scholar 

  • Nguyen, H.S.: Approximate Boolean Reasoning: Foundations and Applications in Data Mining. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 334–506. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  • Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, vol. 9. Kluwer Academic Publishers, Boston (1991)

    MATH  Google Scholar 

  • Pawlak, Z., Skowron, A.: Rudiments of Rough Sets. Inf. Sci. 177(1), 3–27

    Google Scholar 

  • Pawlak, Z., Skowron, A.: Rough Sets and Boolean Reasoning. Inf. Sci. 177(1) 41–73

    Google Scholar 

  • Skowron, A.: Boolean Reasoning for Decision Rules Generation. ISMIS, 295–305 (1993)

    Google Scholar 

  • Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. In: Intelligent Decision Support. Handbook of Applications and Advances of Rough Sets Theory, pp. 331–362. Kluwer, Dordrecht (1992)

    Google Scholar 

  • Slezak, D.: Approximate Reducts in Decision Tables. IPMU 3, 1159–1164 (1996)

    Google Scholar 

  • Slezak, D.: Searching for Frequential Reducts in Decision Tables with Uncertain Objects. RSCTC, 52–59 (1998)

    Google Scholar 

  • Slezak, D.: Approximate Entropy Reducts. Fundam. Inform. 53(3-4), 365–390 (2002)

    MathSciNet  Google Scholar 

  • Slezak, D.: Association Reducts: Complexity and Heuristics. RSCTC, 157–64 (2006)

    Google Scholar 

  • Slezak, D.: Association Reducts: Boolean Representation. RSKT, 305–312 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marzena Kryszkiewicz James F. Peters Henryk Rybinski Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kryszkiewicz, M. (2007). Certain, Generalized Decision, and Membership Distribution Reducts Versus Functional Dependencies in Incomplete Systems. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds) Rough Sets and Intelligent Systems Paradigms. RSEISP 2007. Lecture Notes in Computer Science(), vol 4585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73451-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73451-2_18

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-73451-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics