论文部分内容阅读
给出区分对象对集的定义和基于区分对象对集的属性约简的定义,证明该定义与基于正区域的属性约简定义等价.由于求区分对象对集时,要求出 U/C,故设计一个高效的求 U/C 的算法,其时间复杂度降为 O(|C||U|).进而提出一个基于区分对象对集的高效属性约简算法,其时间和空间复杂度分别降为 O(|C||U|)+O(|C||U/C|~2)和 O(|U|)+O(U/C|~2).用1实例说明该算法的高效性.
The definition of discriminative object set and the definition of attribute reduction based on discriminant object set are given, which proves that the definition is equivalent to the definition of attribute reduction based on positive region.Because U / C is required to distinguish object set, Therefore, an efficient U / C algorithm is designed and its time complexity is reduced to O (| C || U |). Then an efficient attribute reduction algorithm based on discriminant pairings is proposed, and its time and space complexity are respectively Is reduced to O (| C || U |) + O (| C || U / C | ~ 2) and O (| U |) + O Efficient.