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 present a polynomial algorithm for this set construction. We also study relationships between the cardinality of irreducible descriptive set of attributes and the number of attributes in S. 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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Delimata, P., Moshkov, M., Skowron, A., Suraj, Z.: Inhibitory Rules in Data Analysis. A Rough Set Approach. Studies in Computational Intelligence, vol. 163. Springer, Heidelberg (2009)
Düntsch, I., Gediga, G.: Algebraic Aspects of Attribute Dependencies in Information Systems. Fundamenta Informaticae 29(1-2), 119–134 (1997)
Marek, W., Pawlak, Z.: Rough Sets and Information Systems. Fundamenta Informaticae 7(1), 105–116 (1984)
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łowiński, R. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 85–90. Springer, Heidelberg (2006)
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)
Moshkov, M., Skowron, A., Suraj, Z.: Maximal Consistent Extensions of Information Systems Relative to Their Theories. Information Sciences 178(12), 2600–2620 (2008)
Moshkov, M., Skowron, A., Suraj, Z.: On Irreducible Descriptive Sets of Attributes for Information Systems. In: Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) RSCTC 2008. LNCS (LNAI), vol. 5306, pp. 21–30. Springer, Heidelberg (2008)
Novotný, J., Novotný, M.: Notes on the Algebraic Approach to Dependence in Information Systems. Fundamenta Informaticae 16, 263–273 (1992)
Pancerz, K., Suraj, Z.: Synthesis of Petri Net Models: A Rough Set Approach. Fundamenta Informaticae 55, 149–165 (2003)
Pawlak, Z.: Information Systems: Theoretical Foundations. WNT, Warsaw (1983) (in Polish)
Pawlak, Z.: Concurrent Versus Sequential – The Rough Sets Perspective. Bulletin of the EATCS 48, 178–190 (1992)
Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Pawlak, Z., Rauszer, C.: Dependency of Attributes in Information Systems. Bull. Polish. Acad. Sci. Math. 9-10, 551–559 (1985)
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)
Rza̧sa, W., Suraj, Z.: A New Method for Determining of Extensions and Restrictions of Information Systems. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 197–204. Springer, Heidelberg (2002)
Skowron, A., Suraj, Z.: Rough Sets and Concurrency. Bulletin of the Polish Academy of Sciences 41, 237–254 (1993)
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)
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)
Ś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)
Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. Fundamenta Informaticae 28, 353–376 (1996)
Suraj, Z.: Some Remarks on Extensions and Restrictions of Information Systems. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 204–211. Springer, Heidelberg (2001)
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, vol. III, pp. 2618–2625. E.D.K., Paris (2006)
Suraj, Z., Pancerz, K.: Reconstruction of Concurrent System Models Described by Decomposed Data Tables. Fundamenta Informaticae 71, 121–137 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Moshkov, M., Skowron, A., Suraj, Z. (2010). Irreducible Descriptive Sets of Attributes for Information Systems. In: Peters, J.F., Skowron, A. (eds) Transactions on Rough Sets XI. Lecture Notes in Computer Science, vol 5946. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11479-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-11479-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11478-6
Online ISBN: 978-3-642-11479-3
eBook Packages: Computer ScienceComputer Science (R0)