首页 | 本学科首页   官方微博 | 高级检索  
     检索      

知识约简的一种启发式算法
引用本文:苗夺谦,胡桂荣.知识约简的一种启发式算法[J].计算机研究与发展,1999,36(6):681-684.
作者姓名:苗夺谦  胡桂荣
作者单位:1. 山西大学数学系,太原,030006;中国科学院自动化研究所模式识别国家重点实验室,北京,100080
2. 山西大学数学系,太原,030006
基金项目:国家自然科学基金,山西省青年基金
摘    要:知识约简是Rough Set理论研究中的核心内容之一,现已证明了寻找决策表的最小约简是NP-hard问题,文中首先从信息的角度,对决策表中属性的重要性给出度量;在此基础上,提出了一种基于互信息的知识相对约简的启发式算法,并指出算法的复杂性是多项式的;最后,通过

关 键 词:RoughSet理论  知识约简  启发式算法  算法复杂性

A HEURISTIC ALGORITHM FOR REDUCTION OF KNOWLEDGE
MIAO Duo-Qian,HU Gui-Rong.A HEURISTIC ALGORITHM FOR REDUCTION OF KNOWLEDGE[J].Journal of Computer Research and Development,1999,36(6):681-684.
Authors:MIAO Duo-Qian  HU Gui-Rong
Institution:MIAO Duo-Qian; (Department of Mathematics, Shanxi University, Taiyuan 030006); HU Gui-Rong; (Department of Mathematics, Shanxi University, Taiyuan 030006); MIAO Duo-Qian; (National Laboratory of Pattern Recognition,Insitute of Automation,Chinese Academy of Sciences, Beijing 100080)
Abstract:Reduction of knowledge is one of the important topics in the research on rough set theory. It has been proven that computing the optimal (minimal) reduction of decision table is a NP hard problem. In the paper here, first, the significance of attributes in decision table is defined from the viewpoint of information; then, a heuristic algorithm based on mutual information for reduction of knowledge is proposed, and the complexity of this algorithm is analyzed; Finally, the experimental results show that this algorithm can find the minimal reduction for most decision tables.
Keywords:Rough set theory  reduction of knowledge  heuristic algorithm  complexity of algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号