Learning Theory and Kernel Machines

DOI10.1007/b12006zbMath1274.68351OpenAlexW2492608700MaRDI QIDQ5305847

Publication date: 23 March 2010

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

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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors, Lipschitz Regularity of Graph Laplacians on Random Data Clouds, Protein classification by matching and clustering surface graphs, A Unified Framework for Structured Graph Learning via Spectral Constraints, Dependence maps, a dimensionality reduction with dependence distance for high-dimensional data, Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs, Graph signal interpolation with positive definite graph basis functions, A unified probabilistic framework for robust manifold learning and embedding, Nonparametric Bayesian label prediction on a graph, Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization, Binet-Cauchy kernels on dynamical systems and its application to the analysis of dynamic scenes, Ideal regularization for learning kernels from labels, Heat kernel embeddings, differential geometry and graph structure, Unnamed Item, A class of graph-geodetic distances generalizing the shortest-path and the resistance distances, Ellipsoidal classification via semidefinite programming, Adaptive ANOVA decomposition of stochastic incompressible and compressible flows, Recent advances in graph-based pattern recognition with applications in document analysis, Semi-supervised classification and betweenness computation on large, sparse, directed graphs, Predicting the labels of an unknown graph via adaptive exploration, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, Learning to rank on graphs, On the properties of von Neumann kernels for link analysis, The graph matching problem, Efficient semi-supervised learning on locally informative multiple graphs, Kernel methods in machine learning, Kernels, regularization and differential equations, Probabilistic relaxation labelling using the Fokker-Planck equation, Network diffusion with centrality measures to identify disease-related genes, An optimization model for collaborative recommendation using a covariance-based regularizer, Gromov-Hausdorff limit of Wasserstein spaces on point clouds, Minimax lower bounds for function estimation on graphs, Cross-Domain Metric and Multiple Kernel Learning Based on Information Theory, Optimization approaches to supervised classification, The DFS Fused Lasso: Linear-Time Denoising over General Graphs, Towards a theoretical foundation for Laplacian-based manifold methods, Data-driven Thresholding in Denoising with Spectral Graph Wavelet Transform, The graph bottleneck identity, Empirical stationary correlations for semi-supervised learning on graphs, Efficient learning of supervised kernels with a graph-based loss function, A combined Weisfeiler–Lehman graph kernel for structured data, A neural network algorithm for semi-supervised node label learning from unbalanced data, Learning with Kernels and Logical Representations, Improving maximum margin matrix factorization, A constrained matrix-variate Gaussian process for transposable data, Kernel discriminant analysis and clustering with parsimonious Gaussian process models, Semi-supervised graph clustering: a kernel approach, Partition of unity methods for signal processing on graphs, Similarities on graphs: kernels versus proximity measures, Network embedding: taxonomies, frameworks and applications, Learning Unknown Graphs, Complexity versus Agreement for Many Views, Interpolating splines on graphs for data science applications, Fast semi-supervised SVM classifiers usinga priorimetric information, Recovery of Surfaces and Functions in High Dimensions: Sampling Theory and Links to Neural Networks, Kernel and Dissimilarity Methods for Exploratory Analysis in a Social Context, Graph Kernels: A Survey