Semi-supervised learning with regularized Laplacian
From MaRDI portal
Publication:5268919
DOI10.1080/10556788.2016.1193176zbMath1365.68366arXiv1508.04906OpenAlexW2218183746MaRDI QIDQ5268919
A. Mishenin, Konstantin E. Avrachenkov, Pavel Yu. Chebotarev
Publication date: 21 June 2017
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.04906
proximity measuresemi-supervised learninggraph-based learningregularized LaplacianWikipedia article classification
Learning and adaptive systems in artificial intelligence (68T05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)
Related Items
Analysis of Relaxation Time in Random Walk with Jumps ⋮ Loop-erased partitioning of a graph: mean-field analysis ⋮ Similarities on graphs: kernels versus proximity measures
Uses Software
Cites Work
- Unnamed Item
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- The graph bottleneck identity
- On certain linear mappings between inner-product and squared-distance matrices
- Aggregation of preferences by the generalized row sum method
- Discrete Green's functions
- Spanning forests of a digraph and their applications
- Spanning forests and the golden ratio
- On Some Ridge Regression Estimators: An Empirical Comparisons
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- Discrete Dynamic Programming
- Geometry of cuts and metrics
This page was built for publication: Semi-supervised learning with regularized Laplacian
