摘要
为快速计算粗糙集的一个属性约简与核,提出一种基于属性-值树模型的改进约简与求核算法,并证明了算法的完备性.该算法充分利用树型结构,引进树的合并方法,使得计算复杂度从O(|U||C|2)降低为O(|U||C|),提高了计算效率(其中|U|和|C|分别代表对象个数和属性个数).
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.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2010年第6期1111-1118,共8页
Journal of Xidian University
基金
国家部委预研基金资助项目(51315080202)
关键词
粗糙集
决策表
属性约简
属性-值树
rough sets
decision table
attribute reduction
attribute-value-tree
