J4 ›› 2010, Vol. 37 ›› Issue (6): 1111-1118.doi: 10.3969/j.issn.1001-2400.2010.06.024

• Original Articles • Previous Articles     Next Articles

Algorithm based attribute-value-tree for calculation of core and attribute reduction

WANG Xiao-fan1,2;WANG Bao-shu1;CHAI Hui-min1   

  1. (1. School of Computer Science and Technology, Xidian Univ., Xi'an  710071, China;
    2. School of Computer Sci. and Tech., Xi'an Univ. of Tech., Xi'an  710048, China)
  • Received:2010-05-19 Online:2010-12-20 Published:2011-01-22
  • Contact: WANG Xiao-fan E-mail:wangxfok@xaut.edu.cn

Abstract:

In order to get attribute reduction or calculate the core of rough sets quickly, a new algorithm of attribute reduction and computing core is brought forward based on the attribute-value-tree model and its correctness is proved. The greatest advantage of the algorithm is that the time and space complexity are reduced efficiently by using the method of merging trees. The computational complexity of reduction is changed from O(|U||C|2) to O(|U||C|) where |U| and |C| are the numbers of objects and attributes.

Key words: rough sets, decision table, attribute reduction, attribute-value-tree

CLC Number: 

  • TP14