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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blockeel, H., De Raedt, L.: Top-Down Induction of First-Order Logical Decision Trees. Artificial Intelligence 101 (1998) 285–297
Blockeel, H., De Raedt, L., Jacobs, N., Demoen, B.: Scaling up Inductive Logic Programming by Learning from Interpretations. Data Mining and Knowledge Discovery. 3 (1999) 59–93
Brill, E.: Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech Tagging. Computational Linguistics. 21 (1995) 543–565
Califf, M.E., Mooney, R.: Advantages of Decision Lists and Implicit Negatives in Inductive Logic Programming. New Generation Computing. 16 (1998) 263–281
Califf, M.E., Mooney, R.:. Relational Learning of Pattern-Match Rules for Information Extraction. In Proceedings of the Sixteenth National Conference on Artificial Intelligence. AAAI Press Menlo Park, CA (1999) 328–334
Clark, P., Niblett, T.: The CN2 Induction Algorithm. Machine Learning, 3 (1989) 261–284
Manandhar, S., Děroski, S., Erjavec, T.: Learning Multilingual Morphology with CLOG. In Proceedings of the 8th International Workshop on Inductive Logic Programming. Springer-Verlag Berlin Heidelberg New York (1998) 135–144
Mooney, R., Califf, M.E.: Induction of First-Order Decision Lists: Results on Learning the Past Tense of English Verbs. Journal of Artificial Intelligence Research. 3 (1995) 1–24
Muggleton, S., Feng, C.: Efficient Induction of Logic Programs. In Proceedings of the First Conference on Algorithmic Learning Theory. Tokyo, Japan (1990) 368–381
Muggleton, S.: Inverse Entailment and Progol. New Generation Computing. 13 (1995) 647–657
Quinlan, J.R.: Learning Logical Definitions from Relations. Machine Learning. 5 (1990) 245–286
Quinlan, J.R.: Learning First-Order Definitions of Functions. Journal of Artificial Intelligence Research. 5 (1996) 139–161
Rivest, R.L.: Learning Decision Lists. Machine Learning. 2 (1987) 229–246
Webb, G.I., Brkič, N.: Learning Decision Lists by Prepending Inferred Rules. In Proceedings of the Australian Workshop on Machine Learning and Hybrid Systems. Melbourne, Australia (1993) 6–10
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Califf, M.E. (2003). Efficient and Effective Induction of First Order Decision Lists. In: Matwin, S., Sammut, C. (eds) Inductive Logic Programming. ILP 2002. Lecture Notes in Computer Science(), vol 2583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36468-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-36468-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00567-4
Online ISBN: 978-3-540-36468-9
eBook Packages: Springer Book Archive