为快速计算粗糙集的一个属性约简与核,提出一种基于属性-值树模型的改进约简与求核算法,并证明了算法的完备性.该算法充分利用树型结构,引进树的合并方法,使得计算复杂度从O(|U||C|2)降低为O(|U||C|),提高了计算效率(其中|U|和|C|分别代表对象个数和属性个数). In order to quickly calculate an attribute reduction and kernel of rough sets, an improved algorithm based on attribute-value tree is proposed to reduce and verify the completeness of the algorithm.The algorithm makes full use of tree structure and introduces tree The combination method reduces the computational complexity from O (| U || C | 2) to O (| U || C |), which improves computational efficiency (where | U | and | C | represent the number of objects and attributes Number).