| 基于关联规则的覆盖领域约简算法 |
| |
| 引用本文： | 吴涛,尚丽,王伟,陈黎伟. 基于关联规则的覆盖领域约简算法[J]. 计算机工程, 2008, 34(5): 57-59 |
| |
| 作者姓名： | 吴涛 尚丽 王伟 陈黎伟 |
| |
| 作者单位： | 1. 安徽大学智能计算与信号处理教育部重点实验室,合肥,230039;安徽大学数学与计算科学学院,合肥,230039
2. 安徽大学数学与计算科学学院,合肥,230039 |
| |
| 基金项目： | 国家自然科学基金 , 安徽省自然科学基金 , 安徽省高等学校省级自然科学基金 |
| |
| 摘 要： | 前向神经网络的网络覆盖算法根据样本数据构造性地建立神经网络，其结构易于确定，执行效率高。但由于噪声数据的存在，可能造成覆盖领域多的现象，增加了网络结构的复杂度，并产生一些不必要的误识。该文借鉴数据挖掘中关联规则的支持度与可信度的概念，对覆盖领域进行约简，理论分析和实验表明，该算法可以有效地简化覆盖网络的结构，提高网络的稳定性和推广能力。
|
| 关 键 词： | 神经网络 覆盖领域 约简 |
| 文章编号： | 1000-3428（2008）05-0057-03 |
| 收稿时间： | 2007-03-10 |
| 修稿时间： | 2007-03-10 |
Algorithm of the Covering Domains Reduction Based on Association Rule |
| |
| WU Tao,SHANG Li,WANG Wei,CHEN Li-wei. Algorithm of the Covering Domains Reduction Based on Association Rule[J]. Computer Engineering, 2008, 34(5): 57-59 |
| |
| Authors: | WU Tao SHANG Li WANG Wei CHEN Li-wei |
| |
| Affiliation: | (1. Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education, Anhui University, Hefei 230039; 2. School of Mathematics and Computational Science , Anhui University, Hefei 230039) |
| |
| Abstract: | As the covering algorithm of forward neural networks design the network according to the training samples, its framework is easy to define and its performance is high. But the existence of noise samples may lead to some small covering domains, and these small domains increase the complexity and result in misrecognition. The support and confidence of a covering domain are defined and an algorithm of domains reduction is presented in this paper. Experimental results show that this algorithm can simplify the structure of the covering network and improve the stability of networks. |
| |
| Keywords: | neural networks covering domain reduction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
