返回
Semisupervised Learning on Graphs With an Alternating Diffusion Process
DOI:10.1109/TNNLS.2020.3008445.png)
摘要
En 中文
Graph-based semisupervised learning is of great importance in many effective learning systems, particularly in agnostic settings where no parametric information or other prior knowledge about the data distribution is available. It leverages the graph structure to propagate labels from labeled nodes to unlabeled ones. Two separate stages are usually involved: constructing an affinity graph and propagating labels on the graph for transductive inference. It is suboptimal to manage them independently, as the correlation between the affinity graph and the labels would not be fully exploited. In this article, we integrate these two stages into one unified framework by formulating the graph construction as a regularized function estimation problem, similar to label propagation. We then propose an alternating diffusion process to solve them alternately, which allows us to learn the graph and unknown labels in an iterative fashion. With the proposed framework, we can construct a dynamic graph adapted to the given and predicted labels iteratively, resulting in more accurate and robust label propagation performance. Extensive experiments on synthetic data and various real-world data have demonstrated the superiority of the proposed method compared with other state-of-the-art methods.
Keyword:
Manifolds
Diffusion processes
Training
Kernel
Estimation
Optimization
Semisupervised learning
Affinity learning
diffusion process
graph theory
label propagation
semisupervised learning (SSL)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Modification of Caffeic Acid with Pyrrolidine Enhances Antioxidant Ability by Activating AKT/HO-1 Pathway in Heart
PLOS ONE
IF0

