Relational Learning and Boosting-Reference-Cited by-同舟云学术

Relational Learning and Boosting

Published:2001 Issue: Volume: Page:292-306
ISSN:
Container-title:Relational Data Mining
language:
Short-container-title:

Author:

Quinlan Ross

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-04599-2_12

Reference36 articles.

1. M. Bain. Learning Logical Exceptions in Chess. PhD Thesis. University of Strathclyde, Glasgow, 1994

2. S. Bell and S. Weber. On the close logical relationship between FOIL and the frameworks of Helft and Plotkin. In Proceedings of the Third International Workshop on Inductive Logic Programming, pages 127–147. Jozef Stefan Institute, Ljubljana, Slovenia, 1993.

3. F. Bergadano and D. Gunetti. An interactive system to learn functional logic programs. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pages 1044–1049. Morgan Kaufmann, San Mateo, CA, 1993.

4. L. Breiman. Bagging predictors. Machine Learning, 24: 123–140,1996.

5. L. Breiman. Bias, variance, and arcing classifiers. Technical Report 460. Statistics Department, University of California, Berkeley, CA, 1996.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A machine learning-based method for rough roads recognition in ALS system;2023 7th CAA International Conference on Vehicular Control and Intelligence (CVCI);2023-10-27

2. Boosting First-Order Clauses for Large, Skewed Data Sets;Inductive Logic Programming;2010

3. Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves;Machine Learning;2006-06-30

4. From Inductive Logic Programming to Relational Data Mining;Logics in Artificial Intelligence;2006

5. From Ensemble Methods to Comprehensible Models;Discovery Science;2002