Pham Viet Anh , Vu Duc Thi, Nguyen Ngoc Cuong
Author affiliations


  • Pham Viet Anh HaUI Institute of Technology, Hanoi University of Industry, Ha Noi, Viet Nam
  • Vu Duc Thi VNU Information Technology Institute, Vietnam National University, Ha Noi, Viet Nam
  • Nguyen Ngoc Cuong General Department of Logistics and Engineering, Ministry of Public Security, Viet Nam




The reduct, rough set theory, tolerance relation, incomplete decision table


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.


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).

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.

J. Demetrovics, N. L. Giang, V. D.Thi, “On finding all reducts of consistent decision tables”. Journal CIT, Bungary, 14 (4): 3-10, 2014.

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.

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.

M. Kryszkiewicz, Rough set approach to incomplete information systems, Information Science, 39-40, 1998.

Z. Pawlak, Rough Sets - Theoritical Aspets of Reasoning about Data, Kluwer Academic Publishers, Dordrecht, 1991.

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.

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.




How to Cite

P. Viet Anh, V. Duc Thi, and N. Ngoc Cuong, “A NOVEL ALGORITHM FOR FINDING ALL REDUCTS IN THE INCOMPLETE DECISION TABLE”, JCC, vol. 39, no. 4, Nov. 2023.




Most read articles by the same author(s)