| 一种基于绝对信息量的知识约简算法 |
| |
| 引用本文： | 李鸿.一种基于绝对信息量的知识约简算法[J].计算机工程与应用,2004,40(28):52-53,217. |
| |
| 作者姓名： | 李鸿 |
| |
| 作者单位： | 宿州师范专科学校计算机信息系,安徽,宿州,234000;合肥工业大学计算机与信息学院,合肥,230009 |
| |
| 基金项目： | 2002年安徽省教育厅自然科学基金资助(编号:2002kj298zc) |
| |
| 摘 要： | 粗糙集理论是一种新的处理模糊和不确定知识的数学工具。知识约简是粗糙集理论研究中的重要内容之一,现已证明寻找信息系统的最小约简是NP-hard问题。该文提出一个基于绝对信息量的知识约简的启发式算法,该算法的时间复杂性为O(｜R｜3｜U｜2)。通过例子分析,表明该算法是有效的。
|
| 关 键 词： | 粗糙集理论 信息系统 知识约简 绝对信息量 |
| 文章编号： | 1002-8331-(2004)28-0052-02 |
An Absolute Information Quantity-based Algorithm for Reduction of Knowledge in Information Systems |
| |
| Li,Hong.An Absolute Information Quantity-based Algorithm for Reduction of Knowledge in Information Systems[J].Computer Engineering and Applications,2004,40(28):52-53,217. |
| |
| Authors: | Li Hong |
| |
| Abstract: | Rough set theory is a new mathematical tool to deal with vagueness and uncertainty.Attribute reduction is one of the important topics in the research on rough set theory.It has been proved that finding the minimal reduction of an information system is a NP-hard problem.In this paper,an absolute information quantity-based heuristic algorithm for reduction of knowledge is proposed,the time complexity of this algorithm is O(｜R｜ 3 ｜U｜ 2 ).Through running an example,it show s that this algorithm is effective. |
| |
| Keywords: | rough set theory information systems reduction of knowledge Absolute Information Quantity(AIQ) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
