Pfahringer / Kramer | Inductive Logic Programming | Buch | 978-3-540-28177-1 | sack.de

Buch, Englisch, Band 3625, 434 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1380 g

Reihe: Lecture Notes in Computer Science

Pfahringer / Kramer

Inductive Logic Programming

15th International Conference, ILP 2005, Bonn, Germany, August 10-13, 2005, Proceedings
2005
ISBN: 978-3-540-28177-1
Verlag: Springer Berlin Heidelberg

15th International Conference, ILP 2005, Bonn, Germany, August 10-13, 2005, Proceedings

Buch, Englisch, Band 3625, 434 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1380 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-28177-1
Verlag: Springer Berlin Heidelberg


1 “Change is inevitable.” Embracing this quote we have tried to carefully exp- iment with the format of this conference, the 15th International Conference on Inductive Logic Programming, hopefully making it even better than it already was. But it will be up to you, the inquisitive reader of this book, to judge our success. The major changes comprised broadening the scope of the conference to include more diverse forms of non-propositional learning, to once again have tutorials on exciting new areas, and, for the ?rst time, to also have a discovery challenge as a platform for collaborative work. This year the conference was co-located with ICML 2005, the 22nd Inter- tional Conference on Machine Learning, and also in close proximity to IJCAI 2005, the 19th International Joint Conference on Arti?cial Intelligence. - location can be tricky, but we greatly bene?ted from the local support provided by Codrina Lauth, Michael May, and others. We were also able to invite all ILP and ICML participants to shared events including a poster session, an invited talk, and a tutorial about the exciting new area of “statistical relational lea- ing”. Two more invited talks were exclusively given to ILP participants and were presented as a kind of stock-taking—?ttingly so for the 15th event in a series—but also tried to provide a recipe for future endeavours.

Pfahringer / Kramer Inductive Logic Programming jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Research Papers.- An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees.- Guiding Inference Through Relational Reinforcement Learning.- Converting Semantic Meta-knowledge into Inductive Bias.- Learning Teleoreactive Logic Programs from Problem Solving.- A Framework for Set-Oriented Computation in Inductive Logic Programming and Its Application in Generalizing Inverse Entailment.- Distance Based Generalisation.- Automatic Induction of Abduction and Abstraction Theories from Observations.- Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models.- Strategies to Parallelize ILP Systems.- Inducing Causal Laws by Regular Inference.- Online Closure-Based Learning of Relational Theories.- Learning Closed Sets of Labeled Graphs for Chemical Applications.- ILP Meets Knowledge Engineering: A Case Study.- Spatial Clustering of Structured Objects.- Generalization Behaviour of Alkemic Decision Trees.- Predicate Selection for Structural Decision Trees.- Induction of the Indirect Effects of Actions by Monotonic Methods.- Probabilistic First-Order Theory Revision from Examples.- Inductive Equivalence of Logic Programs.- Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops.- A Study of Applying Dimensionality Reduction to Restrict the Size of a Hypothesis Space.- Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data.- Classifying Relational Data with Neural Networks.- Efficient Sampling in Relational Feature Spaces.- Invited Papers.- Why Computers Need to Learn About Music.- Tutorial on Statistical Relational Learning.- Machine Learning for Systems Biology.- Five Problems in Five Areas for Five Years.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.