A NOVEL ALGORITHM FOR FINDING ALL REDUCTS IN THE INCOMPLETE DECISION TABLE
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/18680Keywords:
The reduct, rough set theory, tolerance relation, incomplete decision tableAbstract
Attribute reduction, or attribute selection in the decision table, is a fundamental problem of rough set theory. Currently, many scientists are interested in and developing these issues. Unfortunately, most studies focus mainly on the complete decision table. On incomplete decision tables, researchers have proposed tolerance relations and designed attribute reduction algorithms based on different measures. However, these algorithms only return a reduct and do not preserve information in the decision tables. This paper will propose an efficient method to determine entire reducts of incomplete decision tables according to the relational database approach. In the complex case, this algorithm has exponential computational complexity. However, this algorithm has polynomial computational complexity in the different cases of databases.
Metrics
References
J. Demetrovics, On the equivalence of candidate keys with Sperner systems, Acts Cybernetica 4, 247-252, 1979.
J. Demetrovics, V. D. Thi, Algorithms for generating Armstrong relation and inferring functional dependencies in the relational data model, Computer and Mathematics with Applications 26 (4) 43-55 (Great Britain). DOI: https://doi.org/10.1016/0898-1221(93)90033-R
J. Demetrovics, V. D. Thi, antikeys and prime attributes, Ann. Univ. Scien. Budapest Sect. Comut. 8: 37-54, 1987.
J. Demetrovics, V. D. Thi, Relations and minimal keys, Acta Cybernetica 8 (3): 297-285, 1998.
J. Demetrovics, V. D. Thi, Some remarks on generating, Armstrong and inferring functional dependencies relation, Acta Cybernetica 12: 167-180, 1995.
J. Demetrovics, V. D. Thi, Some result about functional dependencies, Acta Cybernetica 8 (3): 273- 280, 1988.
J. Demetrovics, N. L. Giang, V. D. Thi, An efficient algorithm for determining the set of all reductive attributes in incomplete decision tables. Journal CIT, Bungary, 13 (4): 118-126, 2013. DOI: https://doi.org/10.2478/cait-2013-0058
J. Demetrovics, N. L. Giang, V. D.Thi, “On finding all reducts of consistent decision tables”. Journal CIT, Bungary, 14 (4): 3-10, 2014. DOI: https://doi.org/10.1515/cait-2014-0001
J. Demetrovics, V. D.Thi, H. M. Quang, N. V. Anh, “A method to reduce the size of consistent decision tables”, Acta Cybernetica, V. 23: 167-180, 2018. DOI: https://doi.org/10.14232/actacyb.23.4.2018.4
N. L. Giang, V. D. Thi, “Some problems concerning condition attributes and reducts in decision tables”. Proceeding of the 5th National Symposium Fundamential and Applied Information Technology Research (FAIR), 142-152, 2011.
N. L. Giang, J. Demetrovics, V. D. Thi, P. D. Khoa, “Some Properties Related to Reduct of Consistent Decision Systems”, Journal of Cybernetics and Information Technologies, Bulgarian Academy of Sciences, V. 21(2): 3-9, 2021. DOI: https://doi.org/10.2478/cait-2021-0015
M. Kryszkiewicz, Rough set approach to incomplete information systems, Information Science, 39-40, 1998. DOI: https://doi.org/10.1016/S0020-0255(98)10019-1
Z. Pawlak, Rough Sets - Theoritical Aspets of Reasoning about Data, Kluwer Academic Publishers, Dordrecht, 1991. DOI: https://doi.org/10.1007/978-94-011-3534-4
V. D. Thi, Minimal keys and antikeys, Acta Cybernetica 7 (4): 361-371, 1986.
V. D.Thi, N. L. Giang, “A method for extracting knowledge from decision tables in terms of functional dependencies”. Journal CIT, Bungary, 13, 1, 73-82, 2013. DOI: https://doi.org/10.2478/cait-2013-0007
V. D. Thi, N. L. Giang, “A method to construct decision table from relation scheme”, Cybernetics and Information Technologies, Bulgarian Academy of Sciences, V.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.
