Efficient and effective induction of first order decision lists

Authors:
Mary Elaine Califf
Affiliations:
Department of Applied Computer Science, Illinois State University, Normal, IL
Venue:
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Year:
2002

Citing 12
Cited 2

Transformation-based error-driven learning and natural language processing: a case study in part-of-speech tagging

Computational Linguistics
Advantages of decision lists and implicit negatives in inductive logic programming

New Generation Computing
Relational learning of pattern-match rules for information extraction

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Scaling Up Inductive Logic Programming by Learning from Interpretations

Data Mining and Knowledge Discovery
Learning Logical Definitions from Relations

Machine Learning
Learning Decision Lists

Machine Learning
The CN2 Induction Algorithm

Machine Learning
Learning Multilingual Morphology with CLOG

ILP '98 Proceedings of the 8th International Workshop on Inductive Logic Programming
Induction of first-order decision lists: results on learning the past tense of English verbs

Journal of Artificial Intelligence Research
Learning first-order definitions of functions

Journal of Artificial Intelligence Research
Learning first-order definitions of functions

Journal of Artificial Intelligence Research
Top-down induction of first-order logical decision trees

Artificial Intelligence

Introducing possibilistic logic in ILP for dealing with exceptions

Artificial Intelligence
Possibilistic inductive logic programming

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present BUFOIDL, a new bottom-up algorithm for learning first order decision lists. Although first order decision lists have potential as a representation for learning concepts that include exceptions, such as language constructs, previous systems suffered from limitations that we seek to overcome in BUFOIDL. We present experiments comparing BUFOIDL to previous work in the area, demonstrating the system's potential.