On Irreducible Descriptive Sets of Attributes for Information Systems | SpringerLink
Skip to main content
Springer Nature Link
Log in

On Irreducible Descriptive Sets of Attributes for Information Systems

  • 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

The maximal consistent extension Ext(S) of a given information system S consists of all objects corresponding to attribute values from S which are consistent with all true and realizable rules extracted from the original information system S. An irreducible descriptive set for the considered information system S is a minimal (relative to the inclusion) set B of attributes which defines exactly the set Ext(S) by means of true and realizable rules constructed over attributes from the considered set B. We show that there exists only one irreducible descriptive set of attributes. We also present a polynomial algorithm for this set construction. The obtained results will be useful for the design of concurrent data models from experimental data.

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

Access this chapter

Log in via an institution

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. Delimata, P., Moshkov, M., Skowron, A., Suraj, Z.: Inhibitory Rules in Data Analysis. A Rough Set Approach. Springer, Heidelberg (in press, 2008)

    MATH  Google Scholar 

  2. Düntsch, I., Gediga, G.: Algebraic Aspects of Attribute Dependencies in Information Systems. Fundamenta Informaticae 29(1-2), 119–134 (1997)

    MathSciNet  MATH  Google Scholar 

  3. Marek, W., Pawlak, Z.: Rough Sets and Information Systems. Fundamenta Informaticae 7(1), 105–116 (1984)

    MathSciNet  MATH  Google Scholar 

  4. Moshkov, M., Skowron, A., Suraj, Z.: On Testing Membership to Maximal Consistent Extensions of Information Systems. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowinski, R. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 85–90. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Moshkov, M., Skowron, A., Suraj, Z.: On Maximal Consistent Extensions of Information Systems. In: Conference Decision Support Systems, Zakopane, Poland, December 2006, vol. 1, pp. 199–206. University of Silesia, Katowice (2007)

    Google Scholar 

  6. Moshkov, M., Skowron, A., Suraj, Z.: Maximal Consistent Extensions of Information Systems Relative to Their Theories. Information Sciences 178(12), 2600–2620 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Novotný, J., Novotný, M.: Notes on the Algebraic Approach to Dependence in Information Systems. Fundamenta Informaticae 16, 263–273 (1992)

    MathSciNet  MATH  Google Scholar 

  8. Pancerz, K., Suraj, Z.: Synthesis of Petri Net Models: A Rough Set Approach. Fundamenta Informaticae 55, 149–165 (2003)

    MathSciNet  MATH  Google Scholar 

  9. Pawlak, Z.: Information Systems: Theoretical Foundations. WNT, Warsaw (1983) (in Polish)

    MATH  Google Scholar 

  10. Pawlak, Z.: Concurrent Versus Sequential – The Rough Sets Perspective. Bulletin of the EATCS 48, 178–190 (1992)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  12. Pawlak, Z., Rauszer, C.: Dependency of Attributes in Information Systems. Bull. Polish. Acad. Sci. Math. 9-10, 551–559 (1985)

    MathSciNet  MATH  Google Scholar 

  13. Pawlak, Z., Skowron, A.: Rudiments of Rough Sets. Information Sciences 177(1), 3–27 (2007); Rough Sets: Some Extensions. Information Sciences 177(1), 28–40 (2007); Rough Sets and Boolean Reasoning. Information Sciences 177(1), 41–73 (2007)

    Google Scholar 

  14. Rza̧sa, W., Suraj, Z.: A New Method for Determining of Extensions and Restrictions of Information Systems. In: Alpigini, J.J., Peters, J.F., Skowronek, J., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 197–204. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Skowron, A., Suraj, Z.: Rough Sets and Concurrency. Bulletin of the Polish Academy of Sciences 41, 237–254 (1993)

    MATH  Google Scholar 

  16. Skowron, A., Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. In: First International Conference on Knowledge Discovery and Data Mining, pp. 288–293. AAAI Press, Menlo Park (1995)

    Google Scholar 

  17. Skowron, A., Stepaniuk, J., Peters, J.F.: Rough Sets and Infomorphisms: Towards Approximation of Relations in Distributed Environments. Fundamenta Informaticae 54(1-2), 263–277 (2003)

    MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  19. Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. Fundamenta Informaticae 28, 353–376 (1996)

    MathSciNet  MATH  Google Scholar 

  20. Suraj, Z.: Some Remarks on Extensions and Restrictions of Information Systems. In: Ziarko, W., Yao, Y.Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 204–211. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Suraj, Z., Pancerz, K.: A New Method for Computing Partially Consistent Extensions of Information Systems: A Rough Set Approach. In: 11th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Editions E.D.K., Paris, vol. III, pp. 2618–2625 (2006)

    Google Scholar 

  22. Suraj, Z., Pancerz, K.: Reconstruction of Concurrent System Models Described by Decomposed Data Tables. Fundamenta Informaticae 71, 121–137 (2006)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Silesia, Bȩdzińska 39, 41-200, Sosnowiec, Poland

    Mikhail Moshkov

  2. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

  3. Chair of Computer Science, University of Rzeszów, Rejtana 16A, 35-310, Rzeszów, Poland

    Zbigniew Suraj

Authors
  1. Mikhail Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Skowron
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zbigniew Suraj
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Akron, OH 44325-4003, Akron, USA

    Chien-Chung Chan

  2. Department of Electrical Engineering and Computer Science, University of Kansas, KS 66045, Lawrence, USA

    Jerzy W. Grzymala-Busse

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

    Wojciech P. Ziarko

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moshkov, M., Skowron, A., Suraj, Z. (2008). On Irreducible Descriptive Sets of Attributes for Information Systems. 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_3

Download citation

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

  • 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

Search

Navigation