Learning Theory

DOI10.1007/b98522zbMath1078.68685OpenAlexW4206057230MaRDI QIDQ4680912

Partha Niyogi, Mikhail Belkin, Irina Matveeva

Publication date: 13 June 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98522

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items

Stability and generalization of graph convolutional networks in eigen-domains, Uncertainty Quantification in Graph-Based Classification of High Dimensional Data, Graph signal interpolation with positive definite graph basis functions, Error bounds of multi-graph regularized semi-supervised classification, Nonparametric Bayesian label prediction on a graph, Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization, Sampling, filtering and sparse approximations on combinatorial graphs, Unnamed Item, Diffusion polynomial frames on metric measure spaces, Poisson Reweighted Laplacian Uncertainty Sampling for Graph-Based Active Learning, Data Based Construction of Kernels for Classification, Semi-supervised learning with the help of Parzen windows, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, A general learning framework using local and global regularization, Locally discriminative topic modeling, 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, Low-rank affinity based local-driven multilabel propagation, Detecting and preventing error propagation via competitive learning, An optimal weight semi-supervised learning machine for neural networks with time delay, Network vector autoregression with individual effects, Multiscale Methods for Data on Graphs and Irregular Multidimensional Situations, 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, Posterior consistency of semi-supervised regression on graphs, Unnamed Item, Learning from multiple annotators with varying expertise, A multilevel approach for learning from labeled and unlabeled data on graphs, A generalized diffusion frame for parsimonious representation of functions on data defined manifolds, Eigenmaps and minimal and bandlimited immersions of graphs into Euclidean spaces, Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs, A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices, Semi-supervised learning based on high density region estimation, Riemannian gradient descent methods for graph-regularized matrix completion, Empirical stationary correlations for semi-supervised learning on graphs, A neural network algorithm for semi-supervised node label learning from unbalanced data, Bootstrapping complex functions, Generalization bounds for learning with linear, polygonal, quadratic and conic side knowledge, A survey on semi-supervised learning, Error analysis for denoising smooth modulo signals on a graph, Unnamed Item, Unnamed Item, Generalization performance of graph-based semi-supervised classification, Fast semi-supervised SVM classifiers usinga priorimetric information, The SPDE approach to Matérn fields: graph representations, Constructing \(L_1\)-graphs for subspace learning via recurrent neural networks, Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets