Some algorithms related to consistent decision table
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/33/2/9281Keywords:
object reduct, attribute reduct, rough set theory, decision table, decision rulesAbstract
Rough set theory is useful mathematical tool developed to deal with vagueness and uncertainty. As an important concept of rough set theory, an attribute reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of the given information table. Rough set theory is also the most popular for generating decision rules from decision table. In this paper, we propose an algorithm finding object reduct of consistent decsion table. On the other hand, we also show an algorithm to find some attribute reducts and the correctness of our algorithms is proof-theoretically. These our algorithms have polynomial time complexity. Our finding object reduct helps other algorithms of finding attribute reducts become more effectively, especially as working with huge consistent decision table.Metrics
References
Demetrovics, J. and Thi, V. D. Keys, antikeys and prime attributes. In Annales Univ. Sci. Budapest, Sect. Comp, volume 8, pages 35--52 (1987)
Demetrovics, J. and Thi, V. D. Algorithms for generating an armstrong relation and inferring functional dependencies in the relational datamodel. Computers & Mathematics with Applications, 26(4), 43--55 (1993)
Pawlak, Z. Rough sets. International Journal of Computer & Information Sciences, 11(5), 341--356 (1982)
Pawlak, Z., Grzymala-Busse, J., Slowinski, R., and Ziarko, W. (1995). Rough sets. Communications of the ACM, 38(11), 88--95.
Skowron, A. and Rauszer, C. The discernibility matrices and functions in information systems. In Intelligent Decision Support, pages 331--362. Springer (1992)
Thi, V. D. The minimal keys and antikeys. Acta Cybernetica, 7(4), 361--371 (1986)
Thi, V. D. and Giang, N. L. A method to construct decision table from relation scheme. Cybernetics and Information Technologies, 11(3), 32--41 (2011)
Downloads
Published
How to Cite
Issue
Section
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
