Fetching the paper…
Reading the bibliography…
Graph based semi-supervised learning is the problem of learning a labeling function for the graph nodes given a few example nodes, often called seeds, usually under the assumption that the graph's edges indicate similarity of labels.
Spectral Graph Theory , American Mathematical Society, 1992
F. R. L · 1992
Earlier work this paper cites.
Eigenvalues of the discrete p-laplacian for graphs
S · 2003
Earlier work this paper cites.
A flow-based method for improving the expansion or conductance of graph cuts
K · 2004
Earlier work this paper cites.
Local graph partitioning using pagerank vectors
R · 2006
Earlier work this paper cites.
Infinitewalk: Deep network embeddings as laplacian embeddings with a nonlinearity
S · 2006
Earlier work this paper cites.
A robust hybrid of lasso and ridge regression
A. B · 2007
Earlier work this paper cites.
An algorithm for improving graph partitions
R · 2008
Earlier work this paper cites.
Spectral clustering based on the graph p-laplacian
T · 2009
Cited alongside, same era.
A local algorithm for finding well-connected clusters
Z. A · 2013
Cited alongside, same era.
The interplay between dynamics and networks: centrality, communities, and cheeger inequality
R · 2014
Cited alongside, same era.
Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow
D · 2014
Cited alongside, same era.
Flow-based algorithms for local graph clustering
L · 2014
Cited alongside, same era.
Semi-supervised classification with graph convolutional networks
T. N · 2016
Cited alongside, same era.
Snapvx: A network-based convex optimization solver
D · 2017
Later among the works it cites.
Capacity releasing diffusion for speed and locality
D · 2017
Later among the works it cites.
Iterative refinement for ℓ \ell p-norm regression
D · 2019
Later among the works it cites.
Predict then propagate: Graph neural networks meet personalized pagerank
J · 2019
Later among the works it cites.
Label efficient semi-supervised learning via graph filtering
Q · 2019
Later among the works it cites.
Hypergcn: A new method for training graph convolutional networks on hypergraphs
N · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Parallel local graph clustering
J · 2016
Cited alongside, same era.
Flow-based algorithms for improving clusters: A unifying framework, software, and performance
K
Cited in the paper.
p-norm flow diffusion for local graph clustering
K
Cited in the paper.