arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.00985cs.LGstat.ML
收藏

基于图的非线性流形分布数据半监督k近邻分类方法

A Graph-Based Semi-Supervised k Nearest-Neighbor Method for Nonlinear Manifold Distributed Data Classification

Nanyang Technological University(南洋理工大学);Shanghai University of Electric Power(上海电力大学);Shanghai Jiao Tong University(上海交通大学);Auckland University of Technology(奥克兰理工大学)

Enmei Tu, Yaqian Zhang, Lin Zhu, Jie Yang, Nikola Kasabov

摘要:

$k$ Nearest Neighbors($k$ NN)是用于高斯分布数据分类的最广泛的监督学习算法之一,但当应用于非线性流形分布数据时,特别是当可获得的标记样本数量非常有限时,效果不佳。本文提出了一种新的基于图的$k$神经网络算法,它可以有效地处理高斯分布数据和非线性流形分布数据。为了实现这一目标,我们首先提出了一个受约束的疲劳随机游走(TRW)通过构建一个$R$级最近邻增强树的图形,然后计算TRW矩阵的相似性度量的目的。然后,根据TRW矩阵确定查询点的最近邻,并通过其最近邻的所有TRW权重之和确定查询点的类标签。为了处理在线的情况下,我们还提出了一个新的算法来处理基于局部邻域重建的连续样本。在合成数据集和真实数据集上进行了对比实验,验证了新的$k$ NN算法及其对其他版本的$k$ NN算法的改进的有效性.鉴于流形结构在现实世界中的广泛出现和传统的$k$ NN算法的流行,建议的流形版本$k$ NN分类流形分布的数据显示出良好的潜力。

英文摘要:

$k$ Nearest Neighbors ($k$NN) is one of the most widely used supervised learning algorithms to classify Gaussian distributed data, but it does not achieve good results when it is applied to nonlinear manifold distributed data, especially when a very limited amount of labeled samples are available. In this paper, we propose a new graph-based $k$NN algorithm which can effectively handle both Gaussian distributed data and nonlinear manifold distributed data. To achieve this goal, we first propose a constrained Tired Random Walk (TRW) by constructing an $R$-level nearest-neighbor strengthened tree over the graph, and then compute a TRW matrix for similarity measurement purposes. After this, the nearest neighbors are identified according to the TRW matrix and the class label of a query point is determined by the sum of all the TRW weights of its nearest neighbors. To deal with online situations, we also propose a new algorithm to handle sequential samples based a local neighborhood reconstruction. Comparison experiments are conducted on both synthetic data sets and real-world data sets to demonstrate the validity of the proposed new $k$NN algorithm and its improvements to other version of $k$NN algorithms. Given the widespread appearance of manifold structures in real-world problems and the popularity of the traditional $k$NN algorithm, the proposed manifold version $k$NN shows promising potential for classifying manifold-distributed data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑