Inductive Logic Programming: 12th International Conference, ILP 2002, Sydney, Australia, July 9-11, 2002. Revised Papers
Stan Matwin, Claude Sammut
Springer, Apr 10, 2003 - Logic programming - 351 pages
This book constitutes the thoroughly refereed post-proceedings of the 12th International Conference on Inductive Logic Programming, ILP 2002, held in Sydney, Australia in July 2002. The 22 revised full papers presented were carefully selected during two rounds of reviewing and revision from 45 submissions. Among the topics addressed are first order decision lists, learning with description logics, bagging in ILP, kernel methods, concept learning, relational learners, description logic programs, Bayesian classifiers, knowledge discovery, data mining, logical sequences, theory learning, stochastic logic programs, machine discovery, and relational pattern discovery.
66 pages matching problem in this book
Results 1-3 of 66
What people are saying - Write a review
We haven't found any reviews in the usual places.
Efficient and Effective Induction of First Order Decision Lists
Learning with Feature Description Logics
19 other sections not shown
abstract accuracy application approach Artificial Intelligence atoms autocorrelation background knowledge Bayesian network bias binary BUFOIDL C-set classifier clause Computer concept conceptual graphs constraint construction covered Data Mining database dataset decision lists defined Definition described description logic different seeds discovery distribution domain Dzeroski efficient encoding ensemble evaluation Event Calculus experiments first-order FOIDL function genetic genetic algorithm heuristic hyperedges ILP systems individuals Inductive Logic Programming input intron iteration kernel knowledge representation labels language learning algorithms LNAI logical sequence Machine Learning method models Muggleton multisets negative examples nodes objects parameter patterns performance polynomial population positive examples predicate probabilistic probability problem Proc procedure Proceedings Progol pruning Raedt random relational data representation represented revision robot ROC curve rules s-literals sampling search space selection SG-GP Springer-Verlag structure SubdueCL subset substructure subsumption task term tree test set theory training set variables