Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Blockeel, H., De Raedt, L.: Top-Down Induction of First-Order Logical Decision Trees. Artificial Intelligence 101 (1998) 285–297
2. 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
3. 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
4. Califf, M.E., Mooney, R.: Advantages of Decision Lists and Implicit Negatives in Inductive Logic Programming. New Generation Computing. 16 (1998) 263–281
5. 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
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Possibilistic Inductive Logic Programming;Lecture Notes in Computer Science;2005