Kernels and distances for structured data
From MaRDI portal
Publication:702528
DOI10.1023/B:MACH.0000039777.23772.30zbMath1079.68086OpenAlexW2042313354WikidataQ58503944 ScholiaQ58503944MaRDI QIDQ702528
John W. Lloyd, Thomas Gärtner, Peter A. 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
Related Items (20)
Binary vectors for fast distance and similarity estimation ⋮ A flexible multi-layer self-organizing map for generic processing of tree-structured data ⋮ The Vapnik-Chervonenkis dimension of graph and recursive neural networks ⋮ Mining the semantic web statistical learning for next generation knowledge bases ⋮ kProbLog: an algebraic Prolog for machine learning ⋮ Randomised restarted search in ILP ⋮ Unnamed Item ⋮ Fast learning of relational kernels ⋮ Indefinite Proximity Learning: A Review ⋮ Learning with Kernels in Description Logics ⋮ Querying and Merging Heterogeneous Data by Approximate Joins on Higher-Order Terms ⋮ An efficient kernel matrix evaluation measure ⋮ Crossclus: user-guided multi-relational clustering ⋮ Learning with Kernels and Logical Representations ⋮ Clustering Relational Data Based on Randomized Propositionalization ⋮ Model-aware categorical data embedding: a data-driven approach ⋮ INDUCTION OF CLASSIFIERS THROUGH NON-PARAMETRIC METHODS FOR APPROXIMATE CLASSIFICATION AND RETRIEVAL WITH ONTOLOGIES ⋮ Predicting the fault-proneness of class hierarchy in object-oriented software using a layered kernel ⋮ Matrix representations, linear transformations, and kernels for disambiguation in natural language ⋮ Unnamed Item
This page was built for publication: Kernels and distances for structured data