.png){kind=icon}
返回
Manifold-preserving graph reduction for sparse semi-supervised learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2012.08.070.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Representing manifolds using fewer examples has the advantages of eliminating the influence of outliers and noisy points and simultaneously accelerating the evaluation of predictors learned from the manifolds. In this paper, we give the definition of manifold-preserving sparse graphs as a representation of sparsified manifolds and present a simple and efficient manifold-preserving graph reduction algorithm. To characterize the manifold-preserving properties, we derive a bound on the expected connectivity between a randomly picked point outside of a sparse graph and its closest vertex in the sparse graph. We also bound the approximation ratio of the proposed graph reduction algorithm. Moreover, we apply manifold-preserving sparse graphs to semi-supervised learning and propose sparse Laplacian support vector machines (SVMs). After characterizing the empirical Rademacher complexity of the function class induced by the sparse Laplacian SVMs, which is closely related to their generalization errors, we further report experimental results on multiple data sets which indicate their feasibility for classification. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Sparsity
Graph reduction
Support vector machine
Statistical learning theory
Semi-supervised learning
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
A Review of Technical Impact of Electrical Vehicle Charging Stations on Distribution Grid电动汽车充电站对配电网的技术影响研究综述
PREAI
分享收藏Cortical feedback modulates distinct critical period development in mouse visual thalamus.png)
iScience
OAAI
iScienceIF0
OAAI分享收藏
查看更多内容