返回
Active learning on manifolds
DOI:10.1016/j.neucom.2013.08.002.png)
摘要
En 中文
Due to the rapid growth of the size of the digital information available, it is often impossible to label all the samples. Thus, it is crucial to select the most informative samples to label so that the learning performance can be most improved with limited labels. Many active learning algorithms have been proposed for this purpose. Most of these approaches effectively discover the Euclidean structure of the data space, whereas the geometrical (manifold) structure is not well respected. In this paper, we propose a novel active learning algorithm which explicitly considers the case that the data are sampled from a low dimensional sub-manifold embedded in the high dimensional ambient space. The geodesic distance of two data points on the manifold is estimated by the shortest-path distance between the two corresponding vertices in the nearest neighbor graph. By selecting the most representative points with respect to the manifold structure, our approach can effectively decrease the number of training examples the learner needs in order to achieve good performance. Experimental results on visual objects recognition and text categorization have demonstrated the effectiveness of our proposed approach. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Manifold
Active learning
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Performance of Selected Herbaceous Annual Ornamentals Grown at Decreasing Levels of Irrigation在灌溉水平降低的情况下生长的某些草本一年生观赏植物的性能
HortScience
IF0
Effects of defoliation and row spacing on intermediate wheatgrass II: Forage yield and economics落叶和行距对中间麦草II的影响: 饲料产量和经济性

