Regularization and semi-supervised learning on large graphs
From MaRDI portal
Recommendations
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Generalization performance of graph-based semi-supervised classification
- Semi-supervised learning with regularized Laplacian
- Properly-weighted graph Laplacian for semi-supervised learning
- Error bounds of multi-graph regularized semi-supervised classification
Cited in
(83)- Bootstrapping complex functions
- Generalization performance of graph-based semi-supervised classification
- Nonparametric Bayesian label prediction on a graph
- Active exploration for large graphs
- A unified framework for harmonic analysis of functions on directed graphs and changing data
- Minimax lower bounds for function estimation on graphs
- Semi-supervised learning based on high density region estimation
- Adaptive multiple graph regularized semi-supervised extreme learning machine
- A general learning framework using local and global regularization
- A quadrature formula for diffusion polynomials corresponding to a generalized heat kernel
- On the eigenvectors of \(p\)-Laplacian
- Graph regularization methods for Web spam detection
- Learning to rank on graphs
- Properly-weighted graph Laplacian for semi-supervised learning
- Riemannian gradient descent methods for graph-regularized matrix completion
- Error analysis for denoising smooth modulo signals on a graph
- The SPDE approach to Matérn fields: graph representations
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- Graph signal interpolation with positive definite graph basis functions
- Robust classification of graph-based data
- An optimal weight semi-supervised learning machine for neural networks with time delay
- Network vector autoregression with individual effects
- Learning from multiple annotators with varying expertise
- Eigenmaps and minimal and bandlimited immersions of graphs into Euclidean spaces
- A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices
- Efficient dynamic graph construction for inductive semi-supervised learning
- A survey on semi-supervised learning
- Constructing \(L_1\)-graphs for subspace learning via recurrent neural networks
- Error bounds of multi-graph regularized semi-supervised classification
- Diffusion polynomial frames on metric measure spaces
- Generalization performance of magnitude-preserving semi-supervised ranking with graph-based regularization
- A neural network algorithm for semi-supervised node label learning from unbalanced data
- A note on label propagation for semi-supervised learning
- Graph transduction as a noncooperative game
- Manifold regularization and semi-supervised learning: some theoretical analyses
- Graph transduction as a non-cooperative game
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Uncertainty quantification in graph-based classification of high dimensional data
- Learning with partially labeled and interdependent data
- Multiscale methods for data on graphs and irregular multidimensional situations
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Low-rank affinity based local-driven multilabel propagation
- Detecting and preventing error propagation via competitive learning
- scientific article; zbMATH DE number 7008335 (Why is no real title available?)
- Similarity-based classification in partially labeled networks
- On the consistency of graph-based Bayesian semi-supervised learning and the scalability of sampling algorithms
- Edge sampling using local network information
- scientific article; zbMATH DE number 7625171 (Why is no real title available?)
- Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization
- Data Based Construction of Kernels for Classification
- Consistency of semi-supervised learning algorithms on graphs: probit and one-hot methods
- Posterior consistency of semi-supervised regression on graphs
- Semi-supervised eigenvectors for large-scale locally-biased learning
- On propagated scoring for semisupervised additive models
- Semi-supervised learning with regularized Laplacian
- Learning from partial labels
- The framework of manifold regularization of ranking on graphs
- Semi-supervised learning using greedy Max-Cut
- Fast semi-supervised SVM classifiers usinga priorimetric information
- A generalized diffusion frame for parsimonious representation of functions on data defined manifolds
- Stability and generalization of graph convolutional networks in eigen-domains
- Poisson Reweighted Laplacian Uncertainty Sampling for Graph-Based Active Learning
- Almost exact recovery in label spreading
- Sampling, filtering and sparse approximations on combinatorial graphs
- Semi-supervised classification and betweenness computation on large, sparse, directed graphs
- Semi-supervised learning with the help of Parzen windows
- Locally discriminative topic modeling
- Multi-relational graph convolutional networks: generalization guarantees and experiments
- Efficient semi-supervised learning on locally informative multiple graphs
- Topological analysis of U.S. city demographics
- Modeling urban crime occurrences via network regularized regression
- Almost exact recovery in noisy semi-supervised learning
- Models for information propagation on graphs
- Graph Laplacian-based Bayesian multi-fidelity modeling
- Algorithmic stability of heavy-tailed stochastic gradient descent on least squares
- Interface Laplace learning: learnable interface term helps semi-supervised learning
- Local transfer learning from one data space to another
- Modelling emergency disaster mortality around the world: a network-based distributional inference approach
- Generalization bounds for learning with linear, polygonal, quadratic and conic side knowledge
- Large data and zero noise limits of graph-based semi-supervised learning algorithms
- A multilevel approach for learning from labeled and unlabeled data on graphs
- Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs
- Empirical stationary correlations for semi-supervised learning on graphs
This page was built for publication: Regularization and semi-supervised learning on large graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680912)
