Abstract
Finding reductions from decision tables is one of the main objectives in information processing. Many studies focus on attribute reduct that reduces the number of columns in the decision table. The problem of finding all attribute reducts of consistent decision table is exponential in the number of attributes. In this paper, we aim at finding solutions for the problem of decision table reduction in polynomial time. More specifically, we deal with both the object reduct problem and the attribute reduct problem in consistent decision tables. We proved theoretically that our proposed methods for the two problems run in polynomial time. The proposed methods can be combined to significantly reduce the size of a consistent decision table both horizontally and vertically.
Subject
Computer Vision and Pattern Recognition,Software,Computer Science (miscellaneous),Electrical and Electronic Engineering,Information Systems and Management,Management Science and Operations Research,Theoretical Computer Science
Reference17 articles.
1. Attribute reduction in multi-adjoint concept lattices
2. Demetrovics, János and Thi, Vu Duc. Keys, antikeys and prime attributes. In Annales Univ. Sci. Budapest, Sect. Comp, volume 8, pages 35-52, 1987.
3. Algorithms for Generating an Armstrong Relation and Inferring Functional Dependencies in the Relational Datamodel
4. Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation
5. On finding all reducts of consistent decision tables;Demetrovics;Cybernetics and Information Technologies,2014
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献