Executing Query Packs in ILP
نویسندگان
چکیده
Inductive logic programming systems usually send large numbers of queries to a database. The lattice structure from which these queries are typically selected causes many of these queries to be highly similar. As a consequence, independent execution of all queries may involve a lot of redundant computation. We propose a mechanism for executing a hierarchically structured set of queries (a \query pack") through which a lot of redundancy in the computation is removed. We have incorporated our query pack execution mechanism in the ILP systems Tilde and Warmr by implementing a new Prolog engine ilProlog which provides support for pack execution at a lower level. Experimental results demonstrate signiicant eeciency gains. Our query pack execution mechanism is very general in nature and could be incorporated in most other ILP systems, with similar eeciency improvements to be expected.
منابع مشابه
Query Optimization: Combining Query Packs and the Once-Transformation
In Inductive Logic Programming (ILP), several techniques have been introduced to improve the efficiency of query execution. One such technique is query pack execution. A set of queries with a common prefix, as it is generated by the refinement operator of a typical ILP system, can be executed faster after it is converted into a tree structure called a query pack. Query transformations, on the o...
متن کاملImproving the Efficiency of Inductive Logic Programming Through the Use of Query Packs
Inductive logic programming, or relational learning, is a powerful paradigm for machine learning or data mining. However, in order for ILP to become practically useful, the eÆciency of ILP systems must improve substantially. To this end, the notion of a query pack is introduced: it structures sets of similar queries. Furthermore, a mechanism is described for executing such query packs. A comple...
متن کاملAn Execution Mechanism for Combining Query Packs and Once-Transformations
In Inductive Logic Programming (ILP), several techniques have been introduced to improve the efficiency of query execution. One such technique is query pack execution. A set of queries with a common prefix, as it is generated by the refinement operator of a typical ILP system, can be executed faster after it is converted into a tree structure called a query pack. On the other hand, query transf...
متن کاملILP : - Just Trie It
Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques have been proposed to address the efficiency issue. Such proposals include query transformations, query packs, lazy evaluation and parallel execution of ILP systems, to mention just a few. We propose a novel technique to improv...
متن کاملExecuting Query Flocks for ILP
The aim of data mining is to derive rules that describe characteristics of sets of data. Inductive Logic Programming does this by repeatedly constructing sets of related queries and by determining the success or failure of all these queries for a given data set in order to select the best fitting query. In the ILP systems of the Leuven ML team, each query is actually a conjunction of calls to P...
متن کامل