A framework for defining distances between first-order logic objects
Lecture notes in computer sciencePublished 1 January 1998Open access
Jan Ramon, Maurice Bruynooghe
Citations55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper develops a general framework for distances between distances between objects and reports a preliminary evaluation.
Abstract
© Springer-Verlag Berlin Heidelberg 1998. Several learning systems, such as systems based on clustering and instance based learning, use a measure of distance between objects. Good measures of distance exist when objects are described by a fixed set of attributes as in attribute value learners. More recent learning systems however, use a first order logic representation. These systems represent objects as models or clauses. This paper develops a general framework for distances between such objects and reports a preliminary evaluation.
Keywords
Computer Science
Medical Entomology and ZoologyElements of Machine Learning
517 Citations1995Pat Langley
Elements of Machine Learning by Pat Langley examines the science of machine learning, methodology, and prospects for machine learning in the coming years.
arXiv (Cornell University)Top-down induction of clustering trees
398 Citations2000Hendrik Blockeel, Luc De Raedt +1 more
Machine LearningClausal Discovery
238 Citations1997Luc De Raedt, Luc De Raedt
CLAUDIEN is an inductive logic programming engine that fits in the descriptive data mining paradigm and employs a novel declarative bias mechanism to define the set of clauses that may appear in a hypothesis.
Acta InformaticaDistance measures for point sets and their computation
191 Citations1997Thomas Eiter, Heikki Mannila
The metric infimum of the minimum link measure is presented, a new distance function which is more appealing than the other distance functions mentioned and shown to be in NP for a broad class of instances; it is NP-hard for a natural problem class.
Relational instance-based learning
174 Citations1996Werner Emde, Dietrich Wettschereck
Artificial IntelligenceLogical settings for concept-learning
152 Citations1997Luc De Raedt
It is shown that learning from interpretations reduces toLearning from entailment, which in turn reduces to learning from satisfiability, which reduces to inductive logic programming and computational learning theory.
Artificial IntelligenceFirst-order jk-clausal theories are PAC-learnable
142 Citations1994Luc De Raedt, Sašo Džeroski
Positive PAC-learning results for the nonmonotonic inductive logic programming setting are presented and first-order range-restricted clausal theories that consist of clauses with up to k literals of size at most j each are shown to be PAC-learnable with one-sided error from positive examples only.
Lecture notes in computer scienceInductive constraint logic
117 Citations1995Luc De Raedt, Wim Van Laer
A novel approach to learning first order logic formulae from positive and negative examples is presented, which corresponds to a conjuctive normal form where each conjunct forms a constraint on positive examples.
Lecture notes in computer scienceDistance between Herbrand interpretations: A measure for approximations to a target concept
65 Citations1997Shan-Hwei Nienhuys-Cheng
This paper defines a metric d on the set of expressions, motivated by the structure and complexity of the expressions and the symbols used therein, which allows us to measure the distance between Herbrand interpretations, by considering the elements in their symmetric difference.
European Conference on Artificial IntelligenceConceptual clustering in a first order logic representation
64 Citations1992Gilles Bisson
The Conceptual Clustering system KBG structures information from a set of observations and a domain theory into a directed graph of concepts, generated by an iterative use of clustering and generalization operators, both guided by similarity measures.
Lecture notes in computer scienceA framework for defining distances between first-order logic objects
55 Citations1998Jan Ramon, Maurice Bruynooghe
This paper develops a general framework for distances between distances between objects and reports a preliminary evaluation.
Lecture notes in computer scienceMetrics on terms and clauses
50 Citations1997Alan Hutchinson
Families of pseudometrics are presented which will be applicable to generalization from sets of ground clauses, to discovery of heuristic guidance for theorem proving, and to inductive logic programming.
Applied Artificial IntelligenceDiterpene structure elucidation from 13cnmr spectra with inductive logic programming
36 Citations1998Sašo Džeroski, Steffen Schulze-Kremer +4 more
A novel application ofuctive Logic Programming (ILP) to the problem of diterpene structure elucidation from 13 CNMR spectra to discover correlations between peak patterns and chemical structure.
Lecture notes in computer scienceApplying ILP to diterpene structure elucidation from 13C NMR spectra
20 Citations1997Sašo Džeroski, Steffen Schulze-Kremer +3 more
A novel application of ILP to the problem of diterpene structure elucidation from 13C NMR spectra is presented, i.e., relational learning is applied to theproblem of classifying spectra without assigned atom numbers.
Lirias (KU Leuven)Distance measures between atoms
19 Citations1998Jan Ramon, Maurice Bruynooghe +1 more
This paper develops a new measure for the distance between non-ground atoms, which is applicable to systems based on clustering and instance based learning systems.