Learning Theory and Kernel Machines
From MaRDI portal
Publication:5305846
DOI10.1007/b12006zbMath1274.68312OpenAlexW2492608700MaRDI QIDQ5305846
Peter A. Flach, Thomas Gärtner, Stefan Wrobel
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
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (44)
A new protein graph model for function prediction ⋮ Propagation kernels: efficient graph kernels from propagated information ⋮ Probabilistic frequent subtrees for efficient graph classification and retrieval ⋮ Bosonic Random Walk Neural Networks for Graph Learning ⋮ A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees ⋮ An application of kernel methods to gene cluster temporal meta-analysis ⋮ Fast depth-based subgraph kernels for unattributed graphs ⋮ Binet-Cauchy kernels on dynamical systems and its application to the analysis of dynamic scenes ⋮ Graph based analysis for gene segment organization in a scrambled genome ⋮ Mining the semantic web statistical learning for next generation knowledge bases ⋮ 3D shape retrieval using kernels on extended Reeb graphs ⋮ Depth-based complexity traces of graphs ⋮ Reinforcement learning algorithms with function approximation: recent advances and applications ⋮ kProbLog: an algebraic Prolog for machine learning ⋮ Recent advances in graph-based pattern recognition with applications in document analysis ⋮ Inferring a graph from path frequency ⋮ Graph kernels and Gaussian processes for relational reinforcement learning ⋮ Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research) ⋮ The journey of graph kernels through two decades ⋮ Least-squares two-sample test ⋮ Semi-supervised local Fisher discriminant analysis for dimensionality reduction ⋮ Biomolecular event trigger detection using neighborhood hash features ⋮ Graph kernels based on tree patterns for molecules ⋮ gBoost: a mathematical programming approach to graph classification and regression ⋮ Information-Maximization Clustering Based on Squared-Loss Mutual Information ⋮ The graph matching problem ⋮ A unifying view of explicit and implicit feature maps of graph kernels ⋮ A Mixed Weisfeiler-Lehman Graph Kernel ⋮ Type extension trees for feature construction and learning in relational domains ⋮ Structure-based graph distance measures of high degree of precision ⋮ Unnamed Item ⋮ Fifty years of graph matching, network alignment and network comparison ⋮ A distance measure for large graphs based on prime graphs ⋮ A survey of graph edit distance ⋮ Network classification with applications to brain connectomics ⋮ Comparison of relevance learning vector quantization with other metric adaptive classification methods ⋮ A combined Weisfeiler–Lehman graph kernel for structured data ⋮ Matrix representations, linear transformations, and kernels for disambiguation in natural language ⋮ Effective graph classification based on topological and label attributes ⋮ Discussion of: Brownian distance covariance ⋮ Distance metric learning for graph structured data ⋮ Speech recognition by composition of weighted finite automata ⋮ A generalized Weisfeiler-Lehman graph kernel ⋮ Graph Kernels: A Survey
This page was built for publication: Learning Theory and Kernel Machines
