基于自适应最近邻的局部线性嵌入算法  

Locally Linear Embedding Algorithm Based on Adaptive Nearest Neighbor

作　　者：喻军[1] 秦如新[2] 邓乃扬[2] 

机构地区：[1]郑州航空工业管理学院数理系,河南郑州450015 [2]中国农业大学理学院,北京100083

出　　处：《控制工程》2006年第5期469-470,共2页Control Engineering of China

基　　金：国家自然基金资助项目(10371131)

摘　　要：局部线性嵌入算法是一个优异的非线性维数约减方法,但是算法本身是一个无监督学习算法,对于有监督问题的学习效果不是很好。这主要是因为算法使用了K-近邻方法来求解最近邻点。针对这个缺点,提出了一种改进的、基于自适应最近邻法的局部线性嵌入方法,数值实验证明算法对于有监督的学习问题,具有较好的适应性。Locally linear embedding is an efficient nonlinear dimensional reduction algorithm. Because the algorithm is an unsupervised learning algorithm, the effect that deal with the supervised learning problem is no good. The reason is that the algorithm searches the nearest neighbor points with K-nearest neighbor. An adaptive nearest neighbor locally linear embedding algorithm is proposed to overcome this shortage. Experiment results show that the algorithm adapts well the supervised learning problems.

关 键 词：局部线性嵌入 自适应最近邻 有监督学习 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]