Search improvements in multirelational learning.

作者: María de Lourdes Peña Castillo

DOI:

关键词:

摘要:

参考文章(55)
Richard E. Korf, Iterative-deepening-A: an optimal admissible tree search international joint conference on artificial intelligence. pp. 1034- 1036 ,(1985)
Luc De Raedt, Maurice Bruynooghe, None, A theory of clausal discovery international joint conference on artificial intelligence. pp. 1058- 1063 ,(1993)
Luc De Raedt, Maurice Bruynooghe, None, An overview of the interactive concept-learner and theory revisor CLINT Academic Press. ,(1992)
Robert C. Holte, Bruce W. Porter, Liane E. Acker, Concept learning and the problem of small disjuncts international joint conference on artificial intelligence. pp. 813- 818 ,(1989)
Andreas Junghanns, Jonathan Schaeffer, Pushing the limits: new developments in single-agent search Pushing the limits: new developments in single-agent search. pp. 178- 178 ,(1999) , 10.7939/R3W95103S
Ehud Y. Shapiro, An algorithm that infers theories from facts international joint conference on artificial intelligence. pp. 446- 451 ,(1981)
Stefan Wrobel, An Algorithm for Multi-relational Discovery of Subgroups european conference on principles of data mining and knowledge discovery. pp. 78- 87 ,(1997) , 10.1007/3-540-63223-9_108
Michael J. Pazzani, Clifford A. Brunk, Glenn Silverstein, A knowledge-intensive approach to learning relational concepts Machine Learning Proceedings 1991. pp. 432- 436 ,(1991) , 10.1016/B978-1-55860-200-7.50089-1
Luc Raedt, Wim Laer, Inductive Constraint Logic algorithmic learning theory. ,vol. 997, pp. 80- 94 ,(1995) , 10.1007/3-540-60454-5_30
J. R. Quinlan, R. M. Cameron-Jones, Oversearching and layered search in empirical learning international joint conference on artificial intelligence. ,vol. 2, pp. 1019- 1024 ,(1995)