and improve the efficiency of computing attribute core
a decision table simplification algorithm based on attribute single-valued representation is proposed. The definitions of the size and weight of condition attribute
single-valued attribute and simplified decision table are presented. Then the rigorous calculation formulas of the size
weight and the condition attribute value set of every object converting into a single-value are given. The inverse theorem is proved
which indicates that the simplified decision table are endowed the same information with the original decision table. The storage space of decision table is reduced greatly because the multi-dimension attribute values are decreased to one dimension ones. Then the attribute core algorithm based on the simplified decision table is compared with that based on existing decision table. Experimental results show that the computing efficiency of the former is obviously higher than that of the latter
especially for large-scale decision table.
关键词
Keywords
references
PAWLAK Z. Rough sets [J]. International Journal of Computer and Information Science, 1982, 11(5):341-356.
PAWLAK Z. Rough set theory and its application to data analysis[J]. Cybernetics and Systems,1998, 9(5): 661-668.
王国胤.Rough集理论与知识获取 [M].西安:西安交通大学出版社,2001.
HU Xiaohua, NICK C. Learning in relational database: a rough set approach [J]. International Journal of Computational Intelligence, 1995, 11(2):323-338.
LIU Shaohui, SHENG Qiujian, SHI Zhongzhi. A new method for fast computing positive region [J].Journal of Computer Research and Development, 2003,40(5):637-642.