摘要
依据相容关系下知识粗糙熵的概念,通过对不完备信息系统中知识与粗糙熵之间的关系以及基于粗糙熵的属性重要性的分析,提出了基于相容关系的知识粗糙熵的启发式约简算法.实例分析表明,作为一种有效的数据挖掘工具,该算法是有效的,具有推广价值.
The definition of rough entropy was presented based on the tolerance relation and establishment of the relation between knowledge and roughentropy in the incomplete information system accordingly. The algorithm for reduction of knowledge based on rough was offered. As a date mining tool, it proved that the algorithm was effective through example analysis and had value for spreading.
出处
《郑州轻工业学院学报（自然科学版）》
CAS
2007年第5期100-102,共3页
Journal of Zhengzhou University of Light Industry:Natural Science
关键词
不完备信息系统
相容关系
粗糙熵
约简
incomplete information
tolerance
rough entropy
reduction
