关于“示例学习的最大复合问题及算法”一文的注记

计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (2): 57-59.

关于“示例学习的最大复合问题及算法”一文的注记

王熙照,姜宁

河北大学数学与计算机学院，河北保定 071002

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-01-11 发布日期:2008-01-11
通讯作者: 王熙照

Note on paper“the maximum complex problem in learning from examples and its greedy algorithm”

WANG Xi-zhao,JIANG Ning

Department of Mathematics and Computer Science，Hebei University，Baoding，Hebei 071002，China

Received:1900-01-01 Revised:1900-01-01 Online:2008-01-11 Published:2008-01-11
Contact: WANG Xi-zhao

摘要/Abstract

摘要： 针对“示例学习的最大复合问题及算法”一文（计算机学报，1997，20（2）：139-144）中提出的FCV算法给出了一种优化改进。改进的主要思想是省略FCV算法中建立扩张矩阵，寻找公共路径这一步，直接从评价矩阵中记录选择子得到公式，从而生成规则。实验表明，优化后的算法在时间和空间性能上都有提高，其泛化能力明显高于FCV算法。

关键词: 扩张矩阵, 评价矩阵, 选择子, 公共元素

Abstract: This paper gives an improved version of the FCV algorithm which has proposed in “the maximum complex problem in learning from examples and its greedy algorithm”，Chinese J.Computers，1997，20（2）：139-144.The main idea of improvement is to remove the step of establishing extension matrix and searching common paths in FCV algorithm，and then directly generate rules with saving selectors in evaluation matrixes.Experiments show that the given improved algorithm is significantly superior to the original FCV algorithm in terms of time and space computational complexity and generalization capability.

Key words: extension matrix, evaluate matrix, selector, common element

王熙照,姜宁. 关于“示例学习的最大复合问题及算法”一文的注记[J]. 计算机工程与应用, 2008, 44(2): 57-59.

WANG Xi-zhao,JIANG Ning. Note on paper“the maximum complex problem in learning from examples and its greedy algorithm”[J]. Computer Engineering and Applications, 2008, 44(2): 57-59.

[1]	黄洪^1，2，余达太¹，刘增良³. 粗糙集理论在规则抽取中的应用[J]. 计算机工程与应用, 2009, 45(23): 18-20.
[2]	余昭平,徐丽萍. （50元）（810元）基于快速模式匹配的分级检测模型[J]. 计算机工程与应用, 2005, 41(35期): 0-.