摘要
针对传统的自组织映射网络在大数据量或高维情形下训练过程较慢的问题,提出了分别使用部分失真搜索和扩展的部分失真搜索来完成传统算法中最耗时的最近邻搜索过程,减少了完成训练所需乘法次数。实验表明,相对于传统的自组织映射学习算法,所提两种方法分别可以节约近1/3和1/2以上的计算量。
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.
出处
《计算机应用》
CSCD
北大核心
2006年第2期442-444,共3页
journal of Computer Applications
基金
国家自然科学基金资助项目(10070006)
西北工业大学研究生创业种子基金(Z200570)
关键词
自组织映射
部分失真搜索
最近邻搜索
Self Organizing Map
partial distortion search
nearest neighbor search