Skip to main content

Extensions of Information Systems: The Rough Set Perspective

  • Chapter
Transactions on Rough Sets X

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

Abstract

In the paper, we consider the extensions of information systems from the rough set perspective. A consistent extension of a given information system includes only objects corresponding to the known attribute values which satisfy all minimal rules extracted from the original information system. A partially consistent extension of a given information system includes objects corresponding to the known attribute values which are consistent, to a certain degree with the knowledge represented by all minimal rules extracted from the original information system. Using adequately defined lower approximations of sets of objects in the original information system we can test membership of a new object added to the system to its consistent extension without computing any rules. If a given object does not belong to a consistent extension, then we can calculate a degree of the partial membership of the object to the consistent extension. This degree is expressed by the so-called consistency factor. Consistent and partially consistent extensions of information systems are useful in discovering or predicting new states of concurrent systems described by information systems.

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. Grzymała-Busse, J.W.: Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction. In: Peters, J.F., et al. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 78–95. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Moshkov, M., Skowron, A., Suraj, Z.: On Testing Membership to Maximal Consistent Extensions of Information Systems. In: Greco, S., et al. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 85–90. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  4. Pancerz, K.: Consistency-Based Prediction Using Extensions of Information Systems - an Experimental Study. In: Proceedings of the HSI 2008, pp. 591–596. IEEE, Los Alamitos (2008)

    Google Scholar 

  5. Pancerz, K.: Extensions of Dynamic Information Systems in State Prediction Problems: the First Study. In: Magdalena, L., et al. (eds.) Proceedings of the IPMU 2008, Malaga, Spain, pp. 101–108 (2008) (on CD, 2008)

    Google Scholar 

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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  8. Pawlak, Z.: Some Issues on Rough Sets. In: Peters, J.F., et al. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 1–58. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  11. Suraj, Z.: Rough Set Methods for the Synthesis and Analysis of Concurrent Processes. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications. Studies in Fuzziness and Soft Computing, vol. 56, pp. 379–488. Physica-Verlag, Berlin (2000)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  13. Suraj, Z., Pancerz, K., Owsiany, G.: On Consistent and Partially Consistent Extensions of Information Systems. In: Ślȩzak, D., et al. (eds.) RSFDGrC 2005, Part I. LNCS (LNAI), vol. 3641, pp. 224–233. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Suraj, Z., Pancerz, K.: Some Remarks on Computing Consistent Extensions of Dynamic Information Systems. In: Proceedings of the ISDA 2005, Wroclaw, Poland, pp. 420–425 (2005)

    Google Scholar 

  15. Suraj, Z., Pancerz, K.: A New Method for Computing Partially Consistent Extensions of Information Systems: A Rough Set Approach. In: Proceedings of the IPMU 2006, vol. III, pp. 2618–2625. Editions EDK, Paris (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pancerz, K. (2009). Extensions of Information Systems: The Rough Set Perspective. In: Peters, J.F., Skowron, A., Wolski, M., Chakraborty, M.K., Wu, WZ. (eds) Transactions on Rough Sets X. Lecture Notes in Computer Science, vol 5656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03281-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03281-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03280-6

  • Online ISBN: 978-3-642-03281-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics