| 基于部分失真搜索的自组织映射学习算法 |
| |
| 引用本文： | 陈作平,叶正麟,赵红星,郑红婵. 基于部分失真搜索的自组织映射学习算法[J]. 计算机应用, 2006, 26(2): 442-0444 |
| |
| 作者姓名： | 陈作平 叶正麟 赵红星 郑红婵 |
| |
| 作者单位： | 西北工业大学,理学院,西安,710072;西北工业大学,理学院,西安,710072;榆林学院,数学系,陕西,榆林,719000 |
| |
| 基金项目： | 中国科学院资助项目;西北工业大学校科研和教改项目 |
| |
| 摘 要： | 针对传统的自组织映射网络在大数据量或高维情形下训练过程较慢的问题，提出了分别使用部分失真搜索和扩展的部分失真搜索来完成传统算法中最耗时的最近邻搜索过程，减少了完成训练所需乘法次数。实验表明，相对于传统的自组织映射学习算法，所提两种方法分别可以节约近1/3和1/2以上的计算量。
|
| 关 键 词： | 自组织映射 部分失真搜索 最近邻搜索 |
| 文章编号： | 1001-9081（2006）02-0442-03 |
| 收稿时间： | 2005-08-18 |
| 修稿时间： | 2005-08-182005-10-30 |
Learning algorithms for self organizing mapping based on partial distortion search |
| |
| CHEN Zuo-ping,YE Zheng-lin,ZHAO Hong-xing,ZHENG Hong-chan. Learning algorithms for self organizing mapping based on partial distortion search[J]. Journal of Computer Applications, 2006, 26(2): 442-0444 |
| |
| Authors: | CHEN Zuo-ping YE Zheng-lin ZHAO Hong-xing ZHENG Hong-chan |
| |
| Abstract: | To accelerate the learning process of Self-Organizing Mapping in the situation of large mount of data or high dimension, two learning algorithms were proposed in this paper, by using Partial Distortion Search and Extended Partial Distortion Search respectively to solve the problem of Nearest Neighbor Search during learning process, which could reduce the multiplications greatly. Experiment results indicate that the proposed algorithms can save up to 1/3 and 1/2 multiplications, compared with traditional Self-Organizing Mapping learning algorithm. |
| |
| Keywords: | Self Organizing Map partial distortion search nearest neighbor search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
