摘要
描述了知识的粗糙性,提出了知识的粗糙熵概念,建立了信息系统中知识与粗糙熵之间的关系,并通过知识的粗糙熵对属性的重要性进行了定义。在此基础上,提出了基于粗糙熵的知识约简算法,该算法的时间复杂性为O(｜R｜3｜U｜2)。通过例子分析,表明该算法是有效的。
This paper defines the importance of essence through roughness of knowledge followed by the description of roughness of knowledge and the suggestion of definition of rough entropy and establishment of the relation between knowledge and rough entropy in the information system.Accordingly,the paper offers algorithm for reduction of knowledge based on rough entropy,of which time complexity is O(|R|3|U|2).It proves that the algorithm is effective through example analysis.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第14期78-80,148,共4页
Computer Engineering and Applications
基金
安徽省教育厅自然科学基金项目(编号:2002kj298zc)
关键词
粗糙集理论
知识约简
粗糙熵
知识的粗糙性
rough set theory,reduction of knowledge,rough entropy,roughness of knowledge
