Robust graph learning from noisy data
Learning graphs from data automatically have shown encouraging performance on clustering and semisupervised learning tasks. However, real data are often corrupted, which may cause the learned graph to be inexact or unreliable. In this paper, we propose a novel robust graph learning scheme to learn r...
Saved in:
Main Authors: | KANG, Zhao, PAN, Haiqi, HOI, Steven C. H., XU, Zenglin |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2020
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/5133 https://ink.library.smu.edu.sg/context/sis_research/article/6136/viewcontent/Robust_graph_learning_from_noisy_data_av.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Innovating web page classification through reducing noise
by: Li, X., et al.
Published: (2013) -
Toward the optimization of normalized graph Laplacian
by: Xie, B., et al.
Published: (2013) -
FACE IMAGE DE-OCCLUSION WITH VARIABLE-THRESHOLD ROBUST PCA
by: LI GUODONG
Published: (2016) -
Robust-EQA: robust learning for embodied question answering with noisy labels
by: Luo, Haonan, et al.
Published: (2023) -
Detection of branching points in noisy processes
by: Beer, M., et al.
Published: (2014)