摘要
在分析目前已有基于Rough Set的属性约简算法后,给出了一个新的度量属性重要性的计算公式,分析了该计算公式的性质,然后给出了一个时间复杂度为max{O(|A||U|log|U|),O(|A|2|U|)}的快速属性约简算法,最后用一个实例说明了算法的有效性.
After analyzing the attribute reduction algorithm based on Rough Set that has arisen at present, a new formula for measuring the importance of attribution was given, and the property of this formula was analyzed. Then a new algorithm for attribution reduetion was provided. The time complexity of the provided algorithm is max {O（｜A｜｜U｜｜og｜U｜）,O（｜A｜2｜U｜）}At last, the efficiency of the new algorithm was illustrated with an example.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2007年第1期131-136,共6页
Systems Engineering-Theory & Practice
