z-logo
open-access-imgOpen Access
Distance induction in first order logic
Author(s) -
Michèle Sébag
Publication year - 1997
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-63514-9
DOI - 10.1007/3540635149_55
Subject(s) - euclidean distance , computer science , cluster analysis , granularity , distance matrix , distance measures , euclidean space , artificial intelligence , algorithm , mathematics , combinatorics , operating system
This paper tackles the supervised induction of a distance from examples describedas Horn clauses or constrained clauses. In opposition to syntax-drivenapproaches, this approach is discrimination-driven: it proceeds by defining asmall set of complex discriminant hypotheses. These hypotheses serve as newconcepts, used to redescribe the initial examples. Further, this redescriptioncan be embedded into the space of natural integers, and a distance betweenexamples thus naturally follows.This...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom