Kernels and distances for structured data

DOI10.1023/B:MACH.0000039777.23772.30MaRDI QIDQ702528zbMATH OpenOpenAlexWikidataFDO

Authors Thomas Gärtner, John W. Lloyd, Peter Flach

Publication date 17 January 2005

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:mach.0000039777.23772.30

zbMATH Keywords

higher-order logicinductive logic programmingKernel methodsinstance-based learningstructured data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1950771
• Improved distances for structured data.
• Kernels for Structured Data
• A theory of subtree matching and tree kernels based on the edit distance concept
• On graph kernels: hardness results and efficient alternatives.

Cited in

(28)

• Hash kernels for structured data
• Four-layer distance metric and distance-based kernel functions for inductive logic programming
• Clustering Relational Data Based on Randomized Propositionalization
• scientific article; zbMATH DE number 7307476 (Why is no real title available?)
• Querying and Merging Heterogeneous Data by Approximate Joins on Higher-Order Terms
• Fast learning of relational kernels
• Learning with Kernels in Description Logics
• INDUCTION OF CLASSIFIERS THROUGH NON-PARAMETRIC METHODS FOR APPROXIMATE CLASSIFICATION AND RETRIEVAL WITH ONTOLOGIES
• Learning with Kernels and Logical Representations
• Predicting the fault-proneness of class hierarchy in object-oriented software using a layered kernel
• scientific article; zbMATH DE number 1950771 (Why is no real title available?)
• Transitive assignment kernels for structural classification
• A theory of subtree matching and tree kernels based on the edit distance concept
• Mining the semantic web statistical learning for next generation knowledge bases
• A flexible multi-layer self-organizing map for generic processing of tree-structured data
• Semigroup kernels on measures.
• Randomised restarted search in ILP
• Improved distances for structured data.
• Model-aware categorical data embedding: a data-driven approach
• Indefinite proximity learning: a review
• An efficient kernel matrix evaluation measure
• Local kernels and the geometric structure of data
• kProbLog: an algebraic Prolog for machine learning
• Binary vectors for fast distance and similarity estimation
• Matrix representations, linear transformations, and kernels for disambiguation in natural language
• Kernels for Structured Data
• The Vapnik-Chervonenkis dimension of graph and recursive neural networks
• Crossclus: user-guided multi-relational clustering

This page was built for publication: Kernels and distances for structured data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702528)