Nicola Fanizzi, Stefano Ferilli  Home/Search
Context
Related
| dii.ing.unisi.it/a...fanizziaiia02.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dii.ing.unisi.it/aiia2002...paper (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. Yet, the non-existence of ideal refinement operators has been proven for the standard clausal search spaces based on subsumption or logical implication, which scales up to the spaces of theories. In different generalization models constrained by the assumption of object identity, we extend the results on the existence of ideal... (Update)
Active bibliography (related documents): More All
0.5: Learning Family Relationships Exploiting Multistrategy - Ferilli, Fanizzi, Basile.. (2002) (Correct)
0.3: Multistrategy Operators for Relational Learning.. - Esposito.. (2006) (Correct)
0.3: First-order Cascade ARTMAP - Basilio, Zaverucha, Barbosa (2001) (Correct)
Similar documents based on text: More All
1.0: Refinement of Datalog Programs - Esposito, Laterza, Malerba, Semeraro (1996) (Correct)
0.7: Intelligent Information Retrieval in a Digital Library Service - Fanizzi (Correct)
0.6: Learning from Parsed Sentences with INTHELEX - Esposito, Ferilli, Fanizzi.. (2000) (Correct)
BibTeX entry: (Update)
@misc{ fanizzi-ideal,
author = "Nicola Fanizzi and Stefano Ferilli",
title = "Ideal Refinement Operators for Theories in the OI-implication Generalization
Model",
url = "citeseer.ist.psu.edu/fanizzi02ideal.html" }
Citations (may not include all citations):492 Learning logical definitions from relations (context) - Quinlan - 1990
274 Generalization as search (context) - Mitchell - 1982
154 Machine invention of first-order predicates by inverting res.. (context) - Muggleton, Buntine - 1988
149 New Generation Computing (context) - Muggleton, Progol - 1995
69 A further note on inductive generalization (context) - Plotkin - 1971
44 Generalized subsumption and its application to induction and.. (context) - Buntine - 1988
36 Equality and domain closure in first order databases (context) - Reiter - 1980
34 Foundations of Inductive Logic Programming (context) - Nienhuys-Cheng, de Wolf - 1997
20 Information Processing Letters (context) - Gottlob, implication - 1987
4 Refinement operators can be (context) - Badea, Stanciu - 1999
3 Refining complete hypotheses in ILP (context) - Bratko - 1999
3 A generalization model based on OI-implication for ideal the.. (context) - Esposito, Fanizzi et al. - 2001
2 OI-implication: Soundness and refutation completeness (context) - Esposito, Fanizzi et al. - 2001
1 A bounded search space of clausal theories - Midelfart - 1999
1 Minimal generalizations under OI-implication (context) - Fanizzi, Ferilli - 2002
1 A refinement operator for theories (context) - Badea - 2001
Documents on the same site (http://www-dii.ing.unisi.it/aiia2002/paper.htm): More
Evidence Accumulation Method for Mobile Robot Localization - Restelli, Sorrenti, Marchese (2002) (Correct)
Towards An Adaptive Mail Classifier - Manco, Masciari, Ruffolo, Tagarelli (2002) (Correct)
Recupero di immagini tramite trasformata di Hough - Anelli, Micarelli, Sangineto (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC