Randomised restarted search in ILP

Authors:
Filip Železný;Ashwin Srinivasan;C. David Page, Jr.
Affiliations:
Czech Technical University, Prague, Czech Republic;IBM India Research Laboratory, New Delhi, India;University of Wisconsin, Madison, USA
Venue:
Machine Learning
Year:
2006

Citing 14
Cited 11

Stochastic search in inductive logic programming

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Theories for mutagenicity: a study in first-order and feature-based induction

Artificial Intelligence - Special volume on empirical methods
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Relational data mining applications: an overview

Relational Data Mining
The Role of Occam‘s Razor in Knowledge Discovery

Data Mining and Knowledge Discovery
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

Journal of Automated Reasoning
Phase Transitions in Relational Learning

Machine Learning
Process-Oriented Estimation of Generalization Error

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Formal Models of Heavy-Tailed Behavior in Combinatorial Search

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Dynamic restart policies

Eighteenth national conference on Artificial intelligence
On the Fine Structure of Large Search Spaces

ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Relational learning as search in a critical region

The Journal of Machine Learning Research
Kernels and Distances for Structured Data

Machine Learning
Lattice-search runtime distributions may be heavy-tailed

ILP'02 Proceedings of the 12th international conference on Inductive logic programming

Fast estimation of first-order clause coverage through randomization and maximum likelihood

Proceedings of the 25th international conference on Machine learning
Feature Construction Using Theory-Guided Sampling and Randomised Search

ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
A Restarted Strategy for Efficient Subsumption Testing

Fundamenta Informaticae - Progress on Multi-Relational Data Mining
Parallel ILP for distributed-memory architectures

Machine Learning
An investigation into feature construction to assist word sense disambiguation

Machine Learning
Taming the Complexity of Inductive Logic Programming

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Revising first-order logic theories from examples through stochastic local search

ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Context-sensitive refinements for stochastic optimisation algorithms in inductive logic programming

Artificial Intelligence Review
Boosting learning and inference in Markov logic through metaheuristics

Applied Intelligence
Stochastic refinement

ILP'10 Proceedings of the 20th international conference on Inductive logic programming
A Restarted Strategy for Efficient Subsumption Testing

Fundamenta Informaticae - Progress on Multi-Relational Data Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well known that many hard tasks considered in machine learning and data mining can be solved in a rather simple and robust way with an instance- and distance-based approach. In this work we present another difficult task: learning, from large numbers ...