First order random forests: Learning relational classifiers with complex aggregates

Machine Learning

Volumn 64, Issue 1-3, 2006, Pages 149-182

  Van Assche, Anneleen ^a   Vens, Celine ^a   Blockeel, Hendrik ^a   Džeroski, Sašo ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b JO EF STEFAN INSTITUTE   (Slovenia)

Author keywords

Aggregation; Decision tree learning; Random forests; Relational learning

Indexed keywords

ALGORITHMS; DECISION THEORY; FUNCTIONS; LEARNING SYSTEMS; QUERY LANGUAGES; SET THEORY; TREES (MATHEMATICS);

DECISION TREE LEARNING; RANDOM FORESTS; RELATIONAL LEARNING;

RANDOM PROCESSES;

EID: 33748272679     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-006-8713-9     Document Type: Conference Paper

References (38)

1. Berka, P. (2000). Guide to the financial data set. In: A. Siebes & P. Berka (Eds.), The ECML/PKDD 2000 Discovery Challenge.
2. Blockeel, H., & Bruynooghe, M. (2003). Aggregation versus selection bias, and relational neural networks. In: IJCAI-2003 Workshop on Learning Statistical Models from Relational Data, SRL-2003, Acapulco, Mexico.
3. Blockeel, H., & De Raedt, L. (1997). Lookahead and discretization in ILP. In: Proceedings of the Seventh International Workshop on Inductive Logic Programming, vol. 1297 of Lecture Notes in Artificial Intelligence (pp. 77-85), Springer-Verlag.
4. Blockeel, H., & De Raedt, L. (1998). Top-down induction of first order logical decision trees. Artificial Intelligence, 101(1-2), 285-297.
5. Blockeel, H., Dehaspe, L., Dernoen, B., Janssens, G., Rarnon, J., & Vandecasteele, H. (2002). Improving the efficiency of inductive logic programming through the use of query packs. Journal of Artificial Intelligence Research, 16, 135-166.
6. Breiman, L. (1996a). Bagging predictors. Machine Learning, 24(2), 123-140.
7. Breiman, L. (1996b). Out-of-bag estimation. ftp.stat.berkeley.edu/pub/ users/breiman/OOBestimation.ps.
8. Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5-32.
9. de Castro Dutra, I., Page, D., Costa, V., & Shavlik, J. (2002). An empirical evalutation of bagging in inductive logic programming. In: Proceedings of the 12th International Conference on Inductive Logic Programming, vol. 2583 of Lecture Notes in Computer Science (pp. 48-65).
10. De Raedt, L., & Van Laer, W. (1995). Inductive constraint logic. In: K. P. Jantke, T. Shinohara, & T. Zeugmann (Eds.), Proceedings of the Sixth International Workshop on Algorithmic Learning Theory, vol. 997 of Lecture Notes in Artificial Intelligence (pp. 80-94), Springer-Verlag.
11. Dietterich, T. (2000). Ensemble methods in machine learning. In: Proceedings of the 1th International Workshop on Multiple Classifier Systems, vol. 1857 of Lecture Notes in Computer Science (pp. 1-15).
12. 13C NMR spectra with inductive logic programming. Applied Artificial Intelligence, 12(5), 363-384.
13. Emde, W., & Wettschereck, D. (1995). Relational instance based learning. In: Proceedings of the 1995 Workshop of the GI Special Interest Group on Machine Learning.
14. Freund, Y., & Schapire, R. E. (1996). Experiments with a new boosting algorithm. In: L. Saitta (Ed.), Proceedings of the Thirteenth International Conference on Machine Learning (pp. 148-156), Morgan Kaufmann.
15. Hansen, L., & Salamon, P. (1990). Neural network ensembles. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12, 993-1001.
16. Hoche, S., & Wrobel, S. (2001). Relational learning using constrained confidence-rated boosting. In: C. Rouveirol, & M. Sebag (Eds.), Proceedings of the Eleventh International Conference on Inductive Logic Programming, vol. 2157 of Lecture Notes in Artificial Intelligence (pp. 51-64), Springer-Verlag.
17. Knobbe, A., de Haas, M., & Siebes, A. (2001). Propositionalisation and aggregates. In: L. De Raedt, & A. Siebes (Eds.), Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery, vol. 2168 of Lecture Notes in Artificial Intelligence, (pp. 277-288), Springer.
18. Knobbe, A., Siebes, A., & Marseille, B. (2002). Involving aggregate functions in multi-relational search. In: Principles of Data Mining and Knowledge Discovery, Proceedings of the 6th European Conference (pp. 287-298), Springer-Verlag.
19. Koller, D. (1999). Probabilistic relational models. In: Proceedings of the Ninth International Workshop on Inductive Logic Programming, vol. 1634 of Lecture Notes in Artificial Intelligence (pp. 3-13), SpringerVerlag.
20. Krogel, M.-A., Rawles, S., Železný, F., Flach, P., Lavrač, N., & Wrobel, S. (2003). Comparative evaluation of approaches to propositionalization. In: Proceedings of the 13th International Conference on Inductive Logic Programming, vol. 2835 of Lecture Notes in Artificial Intelligence (pp. 194-217), Springer-Verlag.
21. Krogel, M.-A., & Wrobel, S. (2001). Transformation-based learning using multi-relational aggregation. In: Proceedings of the Eleventh International Conference on Inductive Logic Programming (pp. 142-155).
22. Krogel, M.-A., & Wrobel, S. (2003). Facets of aggregation approaches to propositionalization. In: T. Horváth, & A. Yamamoto (Eds.), Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming (pp. 30-39).
23. Lavrač, N., & Džeroski, S. (1994). Inductive Logic Programming: Techniques and Applications. Ellis Horwood.
24. Michalski, R. (1980). Pattern recognition as rule-guided inductive inference. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2, 349-361.
25. Muggleton, S. (Ed.) (1992). Inductive Logic Programming. Academic Press.
26. Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing, Special, issue on Inductive Logic Programming, 13(3-4), 245-286.
27. Neville, J., Jensen, D., Friedland, L., & Hay, M. (2003). Learning relational probability trees. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
28. Perlich, C., & Provost, F. (2003). Aggregation-based feature invention and relational concept classes. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 167-176), ACM Press.
29. Plotkin, G. (1969). A note on inductive generalization. Machine Intelligence, 5, 153-163.
30. Provost, F. J., & Fawcett, T. (2001). Robust classification for imprecise environments. Machine Learning, 42(3), 203-231.
31. Quinlan, J. (1990). Learning logical definitions from relations. Machine Learning, 5, 239-266.
32. Quinlan, J. (1996). Boosting first-order learning. In: Algorithmic Learning Theory, 7th International Workshop (ALT '96).
33. Quinlan, J. R. (1993). C4.5: Programs for Machine. Learning. Morgan Kaufmann series in Machine Learning. Morgan Kaufmann.
34. Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3), 297-336.
35. Srinivasan, A. (2003). The aleph manual. http://web.comlab.ox.ac.uk/oucl/ research/areas/machlearn/Aleph/.
36. Srinivasan, A., King, R., & Bristol, D. (1999). An assessment of ilp-assisted models for toxicology and the PTE-3 experiment. In: Proceedings of the Ninth International Workshop on Inductive Logic Programming, vol. 1634 of Lecture Notes in Artificial Intelligence (pp. 291-302), Springer-Verlag.
37. Srinivasan, A., Muggleton, S., & King, R. (1995). Comparing the use of background knowledge by Inductive Logic Programming systems. In: L. De Raedt (Ed.), Proceedings of the Fifth International Workshop on Inductive Logic Programming (pp. 199-230). Department of Computer Science, Katholieke Universiteit Leuven.
38. Uwents, W., & Blockeel, H. (2005). Classifying relational data with neural networks. In: Proceedings of 15th International Conference on Inductive Logic Programming, Bonn, Germany, vol. 3625 of Lecture Notes in Artificial Intelligence (pp. 384-396), Springer.