Semi-supervised learning with regularized Laplacian
From MaRDI portal
Abstract: We study a semi-supervised learning method based on the similarity graph and RegularizedLaplacian. We give convenient optimization formulation of the Regularized Laplacian method and establishits various properties. In particular, we show that the kernel of the methodcan be interpreted in terms of discrete and continuous time random walks and possesses several importantproperties of proximity measures. Both optimization and linear algebra methods can be used for efficientcomputation of the classification functions. We demonstrate on numerical examples that theRegularized Laplacian method is competitive with respect to the other state of the art semi-supervisedlearning methods.
Recommendations
Cites work
- Aggregation of preferences by the generalized row sum method
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Discrete Dynamic Programming
- Discrete Green's functions
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- Geometry of cuts and metrics
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- On certain linear mappings between inner-product and squared-distance matrices
- On Some Ridge Regression Estimators: An Empirical Comparisons
- Spanning forests and the golden ratio
- Spanning forests of a digraph and their applications
- The graph bottleneck identity
Cited in
(41)- A semi-supervised heat kernel pagerank MBO algorithm for data classification
- Regularized semi-supervised least squares regression with dependent samples
- An efficient kernel learning algorithm for semisupervised regression problems
- Learning from normalized local and global discriminative information for semi-supervised regression and dimensionality reduction
- Semi-supervised learning based on high density region estimation
- Margin-based semi-supervised learning using Apollonius circle
- Properly-weighted graph Laplacian for semi-supervised learning
- Weighted co-association rate-based Laplacian regularized label description for semi-supervised regression
- Loop-erased partitioning of a graph: mean-field analysis
- Laplacian-optimized diffusion for semi-supervised learning
- Robust classification of graph-based data
- Similarities on graphs: kernels versus proximity measures
- Semi-supervised generalized eigenvalues classification
- Rates of convergence for Laplacian semi-supervised learning with low labeling rates
- Joint harmonic functions and their supervised connections
- On the choice of kernel and labelled data in semi-supervised learning methods
- The performance of semi-supervised Laplacian regularized regression with the least square loss
- Regularization on graphs with function-adapted diffusion processes
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- On the effectiveness of Laplacian normalization for graph semi-supervised learning
- scientific article; zbMATH DE number 5957483 (Why is no real title available?)
- A semi-supervised face recognition method based on manifold regularization
- Graph-Based Semi-Supervised Learning and Spectral Kernel Design
- Feature selection in the Laplacian support vector machine
- Learning Theory
- Consistent semi-supervised graph regularization for high dimensional data
- A splitting method for the locality regularized semi-supervised subspace clustering
- Semantic-based regularization for learning and inference
- Analysis of p-Laplacian regularization in semisupervised learning
- Semi-supervised eigenvectors for large-scale locally-biased learning
- Semi-Supervised Bilinear Subspace Learning
- Guaranteed Classification via Regularized Similarity Learning
- Laplacian support vector machines trained in the primal
- scientific article; zbMATH DE number 6253975 (Why is no real title available?)
- ELECTRIC NETWORK CLASSIFIERS FOR SEMI-SUPERVISED LEARNING ON GRAPHS
- Analysis of Relaxation Time in Random Walk with Jumps
- Laplacian pair-weight vector projection for semi-supervised learning
- Semi-supervised learning with the help of Parzen windows
- Loop-erased partitioning via parametric spanning trees: monotonicities \& 1D-scaling
- Supervised neighborhood graph construction for semi-supervised classification
- Semi-supervised learning on Riemannian manifolds
This page was built for publication: Semi-supervised learning with regularized Laplacian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268919)
