节点文献
基于条件信息量的知识相对约简算法
Algorithm for Relative Reduction of Knowledge in Information Systems Based on a Conditional Information Quantity
【摘要】 通过在信息系统中引入了知识的条件信息量的概念,证明了在知识相对约简过程中条件信息量的变化趋势是递减的;通过条件信息量定义了属性的相对重要性,提出了一种基于条件信息量的知识相对约简算法,分析得到该算法的时间复杂性为O(|C|3|U|2);通过例子分析,表明该算法是有效的.
【Abstract】 The concept of the conditional information quantity of knowledge is introduced in the information system, and its decreasing property of the changing tendency is proved. The relative significance of attribute through the conditional information quantity is defined. A heuristic algorithm for relative reduction of knowledge based on conditional information quantity is proposed. The time complexity of this algorithm is O(|C|~3|U|~2). The results from an example show that this algorithm is effective.
【关键词】 粗糙集理论;
知识相对约简;
条件信息量;
属性相对重要性;
【Key words】 rough set theory; relative reduction of knowledge; conditional information quantity; relative significance of attribute;
【Key words】 rough set theory; relative reduction of knowledge; conditional information quantity; relative significance of attribute;
【基金】 安徽省教育厅自然科学基金项目(2002kj298zc)
- 【文献出处】 中国矿业大学学报 ,Journal of China University of Mining & Technology , 编辑部邮箱 ,2005年03期
- 【分类号】TP18
- 【被引频次】8
- 【下载频次】134