| 示例学习的最大复合问题及算法 |
| |
| 引用本文： | 陈彬 洪家苯. 示例学习的最大复合问题及算法[J]. 计算机学报, 1997, 20(2): 139-144 |
| |
| 作者姓名： | 陈彬 洪家苯 |
| |
| 作者单位： | 哈尔滨工业大学计算机科学与工程系 |
| |
| 摘 要： | 本文证明了示例学习中的最大复合问题是ＮＰ难题，给出了求解最大复问题的近似算法，并将此示例学习算法应用于手写数学识别。实验证明，基于最大复合的学习算法和ＡＱ１５相比，速度快，得到的公式少、匹配精度高。
|
| 关 键 词： | 示例学习 最大复合问题 NP难题 机器学习 |
THE MAXIMUM COMPLEX PROBLEM IN LEARNING FROM EXAMPLES AND ITS GREEDY ALGORITHM |
| |
| CHEN Bin, HONG Jiarong. THE MAXIMUM COMPLEX PROBLEM IN LEARNING FROM EXAMPLES AND ITS GREEDY ALGORITHM[J]. Chinese Journal of Computers, 1997, 20(2): 139-144 |
| |
| Authors: | CHEN Bin HONG Jiarong |
| |
| Abstract: | In this article, the maximum general complex problem (MGC) in learning from examples is proved to be NP-hard, and an approximate solution to the problem is proposed and applied to hand-written numeral recognition. Compared with AQ15 , the algorithm based on maximum general complex runs faster and generates fewer rules and gives higher accuracy. |
| |
| Keywords: | Learning from examples maximum general complex problem NP-hardness extension matrix. |
| 本文献已被 CNKI 维普 等数据库收录！ |
