the proceedings contain 26 papers from the conference on inductivelogicprogramming15thinternationalconference, ilp 2005. the topics discussed include: guiding inference through relational reinforcement learning;c...
详细信息
the proceedings contain 26 papers from the conference on inductivelogicprogramming15thinternationalconference, ilp 2005. the topics discussed include: guiding inference through relational reinforcement learning;converting semantic meta-knowledge into inductive bias;distance based generaliztion;automatic induction of abduction and abstraction theories from observations;strategies to parallelize ilp systems;inducing casual laws by regular inferece;spatial clustering of structured objects;predicate selection for structural decision trees;inductive equivalence of logic programs;and a study of applying dimensionality reduction to restrict the size of a hypothesis space.
It is well known by inductivelogicprogramming (ilp) practioners that ilp systems usually take a long time to find valuable models (theories). the problem is specially critical for large datasets, preventing ilp syst...
详细信息
Anytime algorithms refers to algorithms that "always can produce a result. Often the result of the algorithm depends on the time at hand, the longer the time, the better the answer. In this paper we present an ea...
详细信息
ISBN:
(纸本)1880843323
Anytime algorithms refers to algorithms that "always can produce a result. Often the result of the algorithm depends on the time at hand, the longer the time, the better the answer. In this paper we present an easy way of turning regular inductivelogicprogramming (ilp) algorithms such as Divide-And-Conquer (DAC.) and Separate-And-Conquer (SAC) into anytime algorithms. We conduct experiments withthese anytime algorithms and introduce a simple heuristic called squared quota, that we compare with an established one, information gain. It seems that squared quota is better suited for a small window size of example data, and hence better to use in anytime systems. A comparison between SAC and DAC reveals that they excel in different combinations of examples/background knowledge.
We propose a new approach to inductivelogicprogramming i that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computation, is more amenable to the use of s...
详细信息
In this paper, we focus on the problem of learning reactive skills for use by physical agents. We propose a new representation for such procedures, teleoreactive logic programs, along with an interpreter that utilizes...
详细信息
ISBN:
(纸本)3540281770
In this paper, we focus on the problem of learning reactive skills for use by physical agents. We propose a new representation for such procedures, teleoreactive logic programs, along with an interpreter that utilizes them to achieve goals. After this, we describe a learning method that acquires these structures in a cumulative manner through problem solving. We report experiments in three domains that involve multiple levels of skilled behavior. We also review related work and discuss directions for future research.
this paper presents a brief introduction of the relation between logicprogramming and machine learning. the area researching the relation is usually called inductivelogicprogramming (ilp, for short). In this paper ...
详细信息
ISBN:
(纸本)9783540692331
this paper presents a brief introduction of the relation between logicprogramming and machine learning. the area researching the relation is usually called inductivelogicprogramming (ilp, for short). In this paper we will give the details of neither ilp systems nor ilptheories. We explain how to substitute concepts used in logicprogramming to items needed in formulating learning theories. We also show some theoretical applications to which the substitution are contributing.
this study was performed to extract rules for reducing body fat mass so as to prevent lifestyle-related diseases. Lifestyle-related diseases have been increasing in Japan, even among younger people. Body fat mass is r...
详细信息
this paper studies equivalence issues in inductivelogicprogramming. A background theory B-1 is inductively equivalent to another background theory B-2 if B-1 and B-2 induce the same hypotheses for any given set of e...
详细信息
ISBN:
(纸本)3540281770
this paper studies equivalence issues in inductivelogicprogramming. A background theory B-1 is inductively equivalent to another background theory B-2 if B-1 and B-2 induce the same hypotheses for any given set of examples. inductive equivalence is useful to compare inductive capabilities among agents having different background theories. Moreover, it provides conditions for optimizing background theories through appropriate program transformations. In this paper, we consider three different classes of background theories: clausal theories, Horn logic programs, and nonmonotonic extended logic programs. We show that logical equivalence is the necessary and sufficient condition for inductive equivalence in clausal theories and Horn logic programs. In nonmonotonic extended logic programs, on the other hand, strong equivalence is necessary and sufficient for inductive equivalence in general. Interestingly, however, we observe that several existing induction algorithms require weaker conditions of equivalence under restricted problem settings. We also discuss connection to equivalence in abductive logic and conclude that the notion of strong equivalence is useful to characterize equivalence of non-deductive reasoning.
the handling of exceptions in multiclass problems is a tricky issue in inductivelogicprogramming (ilp). In this paper we propose a new formalization of the ilp problem which accounts for default reasoning, and is en...
详细信息
the handling of exceptions in multiclass problems is a tricky issue in inductivelogicprogramming (ilp). In this paper we propose a new formalization of the ilp problem which accounts for default reasoning, and is encoded with first-order possibilistic logic. We show that this formalization allows us to handle rules with exceptions, and to prevent an example to be classified in more than one class. the possibilistic logic view of ilp problem, can be easily handled at the algorithmic level as an optimization problem.
1 “Change is inevitable.” Embracing this quote we have tried to carefully exp- iment withthe format of this conference, the 15th international conference on inductive logic programming, hopefully making it even bet...
详细信息
ISBN:
(数字)9783540318514
ISBN:
(纸本)9783540281771
1 “Change is inevitable.” Embracing this quote we have tried to carefully exp- iment withthe 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 19thinternational 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.
暂无评论