Semi-Supervised Learning with Close-Form Label Propagation Using a Bipartite Graph

In this paper, we introduce an efficient and effective algorithm for Graph-based Semi-Supervised Learning (GSSL). Unlike other GSSL methods, our proposed algorithm achieves efficiency by constructing a bipartite graph, which connects a small number of representative points to a large volume of raw d...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Symmetry (Basel) Ročník 16; číslo 10; s. 1312
Hlavní autori: Peng, Zhongxing, Zheng, Gengzhong, Huang, Wei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 01.10.2024
Predmet:
Accuracy
Algorithms
Analysis
Approximation
Closed form solutions
Construction
Data points
Datasets
Effectiveness
Efficiency
Exact solutions
Graph theory
Labels
Machine learning
Propagation
Semi-supervised learning
User generated content
ISSN:2073-8994, 2073-8994
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we introduce an efficient and effective algorithm for Graph-based Semi-Supervised Learning (GSSL). Unlike other GSSL methods, our proposed algorithm achieves efficiency by constructing a bipartite graph, which connects a small number of representative points to a large volume of raw data by capturing their underlying manifold structures. This bipartite graph, with a sparse and anti-diagonal affinity matrix which is symmetrical, serves as a low-rank approximation of the original graph. Consequently, our algorithm accelerates both the graph construction and label propagation steps. In particular, on the one hand, our algorithm computes the label propagation in closed-form, reducing its computational complexity from cubic to approximately linear with respect to the number of data points; on the other hand, our algorithm calculates the soft label matrix for unlabeled data using a closed-form solution, thereby gaining additional acceleration. Comprehensive experiments performed on six real-world datasets demonstrate the efficiency and effectiveness of our algorithm in comparison to five state-of-the-art algorithms.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2073-8994
2073-8994
DOI:10.3390/sym16101312