摘要
在完备信息系统中,通过引入区分度的概念,以相对区分度为启发式信息,提出一种基于区分度的属性约简启发式算法,并对该算法的时间复杂性进行了分析,最后通过例子说明,该算法能得到完备信息系统的一个约简。
The concept of discernibility degree is introduced in complete information systems. With the discernibility degree as heuristic information, a heuristic algorithm based on discernibility degree for reduction of attributes is presented, and the time complexity of this algorithm is analyzed. Finally the experimental results show that this algorithm can find the reduct of a complete information system.
出处
《计算机与现代化》
2007年第7期1-2,5,共3页
Computer and Modernization
基金
云南省教育厅科学研究基金项目(5y0615D)
关键词
粗糙集
属性约简
区分度
rough set
reduction of attributes
discernibility degree
