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

基于区分能力大小的启发式约简算法的研究
引用本文:陈堂敏. 基于区分能力大小的启发式约简算法的研究[J]. 计算机学报, 2006, 29(3): 480-487
作者姓名:陈堂敏
作者单位:中山大学软件所,广州,510300;广东轻工职业技术学院机电系,广州,510300
摘    要:通过对徐燕等提出的能有效处理噪音的基于区分能力大小的启发式约简算法的研究,认为所提出的对知识进行量化、证明量化的合理性、给出的算法和实例证明的过程中还有一些不完善的地方,需要进行修正.该文提出了修正方法,并通过实例证明了修正后的算法对知识进行量化、证明量化的合理性、以知识量为启发函数的约简修正是正确的.

关 键 词:知识量  数据挖掘  约简  算法  修正
收稿时间:2005-01-20
修稿时间:2005-01-202005-11-30

Research of the Heuristic Reduced Algorithm Based on the Separating Capacity
CHEN Tang-Min. Research of the Heuristic Reduced Algorithm Based on the Separating Capacity[J]. Chinese Journal of Computers, 2006, 29(3): 480-487
Authors:CHEN Tang-Min
Affiliation:1.Software School, Sun Yat-Sen University, Guangzhou 510300;2.Electro-mechanical Department, Guangdong Light Industry Technical College, Guangzhou 510300
Abstract:The heuristic reduced algorithm based on the separating capacity is proposed by Xu Yan et al. in 2003, and is useful to deal with the noise. But it is imperfect in some respect, just as the knowledge quantification, the proof of the quantifying rationality, the algorithm they proposed and the process proved by example. This paper proposes some methods to improve theirs, and also uses example to prove them.
Keywords:knowledge quantity   data digging   reduction   algorithm   improvement
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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