返回
Deformed Graph Laplacian for Semisupervised Learning
DOI:10.1109/TNNLS.2014.2376936.png)
摘要
En 中文
Graph Laplacian has been widely exploited in traditional graph-based semisupervised learning (SSL) algorithms to regulate the labels of examples that vary smoothly on the graph. Although it achieves a promising performance in both transductive and inductive learning, it is not effective for handling ambiguous examples (shown in Fig. 1). This paper introduces deformed graph Laplacian (DGL) and presents label prediction via DGL (LPDGL) for SSL. The local smoothness term used in LPDGL, which regularizes examples and their neighbors locally, is able to improve classification accuracy by properly dealing with ambiguous examples. Theoretical studies reveal that LPDGL obtains the globally optimal decision function, and the free parameters are easy to tune. The generalization bound is derived based on the robustness analysis. Experiments on a variety of real-world data sets demonstrate that LPDGL achieves top-level performance on both transductive and inductive settings by comparing it with popular SSL algorithms, such as harmonic functions, AnchorGraph regularization, linear neighborhood propagation, Laplacian regularized least square, and Laplacian support vector machine.
Keyword:
Deformed graph Laplacian (DGL)
generalization bound
local smoothness regularizer
parametric sensitivity
semisupervised learning (SSL)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Elimination of O2 plasma damage of low-k methyl silsesquioxane film by As implantation通过As注入消除低k甲基倍半硅氧烷膜的O2等离子体损伤
Resonance Raman studies of hemoglobins M: evidence for iron-tyrosine charge-transfer interactions in the abnormal subunits of Hb M Boston and Hb M Iwate
Biochemistry
IF0

