The Community for Technology Leaders
Computer Science and Computational Technology, International Symposium on (2008)
Dec. 20, 2008 to Dec. 22, 2008
ISBN: 978-0-7695-3498-5
pp: 476-479
ABSTRACT
When studying attribute reduction, we need to enumerate all the minimal reductions to prove the correctness of the attribute reduction algorithm. The explosion of attributes combination makes time complexity of the enumeration algorithm pretty high. An algorithm derived from grouping the rows of decision table is put forward to validate if an attribute set is reduction. Based on this algorithm, a fast algorithm for seeking core attribute is put forward too. And by optimizing the process of enumeration, the quantity of enumeration is reduced and the time of enumeration is reduced to acceptable scope.
INDEX TERMS
minimal attribute reduction, core attributes, fast enumeration algorithm
CITATION

N. Xu and X. Wei, "A Fast Enumeration Algorithm for Attribute Reduction Based on Grouping," 2008 International Symposium on Computer Science and Computational Technology (ISCSCT), Shanghai, 2008, pp. 476-479.
doi:10.1109/ISCSCT.2008.105
97 ms
(Ver 3.3 (11022016))