On multi-class problems and discretization in inductive logic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1325, Issue , 1997, Pages 277-286

  van Laer, Wim ^a   De Raedt, Luc ^a   Džeroski, Sašo ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b JO EF STEFAN INSTITUTE   (Slovenia)

Author keywords

Classification; Discretization; Inductive logic programming; Knowledge discovery; Learning

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIODEGRADATION; CHEMICAL COMPOUNDS; CLASSIFICATION (OF INFORMATION); DATA MINING; FORMAL LOGIC; INTELLIGENT SYSTEMS; LEARNING SYSTEMS; LOGIC PROGRAMMING;

ATTRIBUTE VALUES; DISCRETIZATIONS; FINITE ELEMENT MESHES; FIRST ORDER LOGIC; LEARNING; MULTI-CLASS PROBLEMS; NEGATIVE EXAMPLES; OVER FITTING PROBLEM;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 84947803898     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. H. Blocked and L. De Raedt. Experiments with top-down induction of logical decision trees. Technical Report CW 247, Dept. of Computer Science, K. U. Leuven, January 1997.
2. J. Catlett. On changing continuous attributes into rdered discrete attributes. In Yves Kodratoff, editor, Proceedings of the 5th European Working Session on Learning, volume 482 of Lecture Notes in Artificial Intelligence, pages 164-178. Springer-Verlag, 1991.
3. P. Clark and R. Boswell. Rule induction with CN2: Some recent improvements. In Yves Kodratoff, editor, Proceedings of the 5th European Working Session on Learning, volume 482 of Lecture Notes in Artificial Intelligence, pages 151-163. Springer-Verlag, 1991.
4. L. De Raedt. Induction in logic. In R. S. Michalski and Wnek J., editors, Proceedings of the 3rd International Workshop on Multistrategy Learning, pages 29-38, 1996.
5. L. De Raedt and L. Dehaspe. Clausal discovery. Machine Learning, 26: 99-146, 1997.
6. L. De Raedt and S. Déroski. First order Ik-clausal theories are PAC-learnable. Artificial Intelligence, 70: 375-392, 1994.
7. L. De Raedt and W. Van Laer. Inductive constraint logic. In Proceedings of the 5th Workshop on Algorithmic Learning Theory, volume 997 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1995.
8. B. Dolãk and S. Muggleton. The application of Inductive Logic Programming to finite element mesh design. In S. Muggleton, editor, Inductive logic programming, pages 453-472. Academic Press, 1992.
9. J. Dougherty, R. Kohavi, and M. Sahami. Supervised and unsupervised discretlzation of continuous features. In A. Prieditis and S. Russell, editors, Proc. Telth International Conference on Machine Learning. Morgan Kaufmann, 1995.
10. S. Déroski, B. Kompare, and W. Van Laer. Predicting biodegradability from chemical structure using ILP. Submitted.
11. U. M. Fayyad and K. B. Irani. Multi-interval discretization of continuous-valued attributes for classification learning. In Proceedings of the I Jth International Joint Conference on ArtificialIntelligence, pages 1022-1027, San Mateo, CA, 1993. Morgan Kaufmann.
12. M. Genesereth and N. Nilsson. Logical foundations of artificial intelligence. Morgan Kaufmann, 1987.
13. D. Kazakov, L. Popelinsky, and O. Stepankova. ILP datasets page [http://www. grad. de/ml-archive/dataset a/ilp-res, html], 1996.
14. J. W. Lloyd. Foundations of logic programming. Springer-Verlag, 2nd edition, 1987.
15. R. J. Mooney. Encouraging experimental results on learning cnf. Machine Learning, 19: 79-92, 1995.
16. U. Pompe and I. Kononenko. Probabilistic first-order classification, 1997. Submitted.
17. A. Srinivnsan, S. H. Muggleton, M. J. E. Sternberg, and R. D. King. Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence, 85, 1996.
18. L. Valiant. A theory of the learnable. Communications of the A CM, 27: 1134-1142, 1984.