| 自组织拓扑映射与主曲线学习 |
| |
| 引用本文： | 倪劲松,李玉珍,王宜怀.自组织拓扑映射与主曲线学习[J].计算机科学,2006,33(3):151-154. |
| |
| 作者姓名： | 倪劲松 李玉珍 王宜怀 |
| |
| 作者单位： | 1. 苏州大学数学科学学院,苏州,215006
2. 苏州大学计算机科学与技术学院,苏州,215006 |
| |
| 基金项目： | 江苏省教育厅自然科学基金 |
| |
| 摘 要： | 本文利用自组织拓扑映射方法设计了一种简易主曲线学习的算法,该算法继承了 HS 主曲线算法和 K 主曲线算法的主要优点.同时降低了一般主曲线算法的难度,使其变得更简洁明了。
|
| 关 键 词： | 向量量化器 自组织拓扑映射 Voronoi邻域 主曲线 |
Self-organized Topological Mapping and Principal Curve Learning |
| |
| NI Jin-Song,LI Yu-Zheng,WANG Yi-Huai.Self-organized Topological Mapping and Principal Curve Learning[J].Computer Science,2006,33(3):151-154. |
| |
| Authors: | NI Jin-Song LI Yu-Zheng WANG Yi-Huai |
| |
| Affiliation: | Mathematics and Information Science College, Suzhou University, Suzhou 215006 |
| |
| Abstract: | We use the method of self-organized topological mapping to design a learning algorithm of principal curves. The algorithm is composed by two parts.In the first part,based on the theory of generalized vector guantizer,we have achieved refined GL-algorithm,and use it to compute polygonal line principal curves for every finite discrete data set, which is like Kegl has done.In the second part,we combine the method of self-organized topological mapping with re- fined GL-algorithm to design an algorithm of principal curves(Algorithm C),which is simpler than HS-type and K- type.This algorithm has inherited main virtues of the principal curves of HS-type and K-type. |
| |
| Keywords: | Vector quantizer Self-organized topological mapping Voronoi neighborhood Principle curve |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
|
