L γ -PageRank for semi-supervised learning
Abstract PageRank for Semi-Supervised Learning has shown to leverage data structures and limited tagged examples to yield meaningful classification. Despite successes, classification performance can still be improved, particularly in cases of graphs with unclear clusters or unbalanced labeled data....
Main Authors: | Esteban Bautista, Patrice Abry, Paulo Gonçalves |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2019-08-01
|
Series: | Applied Network Science |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41109-019-0172-x |
Similar Items
-
Toward Efficient Hub-Less Real Time Personalized PageRank
by: Matin Pirouz, et al.
Published: (2017-01-01) -
A Survey on Personalized PageRank Computation Algorithms
by: Sungchan Park, et al.
Published: (2019-01-01) -
Extension de PageRank et application aux réseaux sociaux
by: Huynh, The Dang
Published: (2015) -
A comparison of a Lazy PageRank and variants for common graph structures
by: Aziz Ali, Barkat
Published: (2018) -
Combining the Two-Layers PageRank Approach with the APA Centrality in Networks with Data
by: Taras Agryzkov, et al.
Published: (2018-12-01)