Query Transformations for Improving the Efficiency of ILP Systems

No abstract is available for this paper.

• Publication year

  2003

• Venue

  Journal of machine learning research

• Publication date

  2003-12-01

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• gprof: a call graph execution profiler

  2004cited by this paper
• Induction in first order logic from noisy training examples and fixed example set sizes

  2000cited by this paper
• Two Advanced Transormations for Improving the Efficiency of an ILP system

  2000cited by this paper
• A Note on Two Simple Transformations for Improving the Efficiency of an ILP System

  2000influential reference
• Executing Query Packs in ILP

  2000influential reference
• A Study of Two Sampling Methods for Analyzing Large Datasets with ILP

  1999cited by this paper
• An Assessment of ILP-Assisted Models for Toxicology and the PTE-3 Experiment

  1999cited by this paper
• Top‐down induction of first order logical decision trees

  1999influential reference
• Discovery of frequent DATALOG patterns

  1999cited by this paper
• Completeness and Properness of Refinement Operators in Inductive Logic Programming

  1998cited by this paper
• Part-of-Speech Tagging Using Progol

  1997cited by this paper
• Carcinogenesis Predictions Using ILP

  1997cited by this paper
• Tractable Induction and Classification in First Order Logic Via Stochastic Matching

  1997cited by this paper
• Exploiting Goal Independence in the Analysis of Logic Programs

  1997cited by this paper
• Foundations of Inductive Logic Programming

  1997cited by this paper
• Theories for Mutagenicity: A Study in First-Order and Feature-Based Induction

  1996cited by this paper
• Structural Regression Trees

  1996cited by this paper
• Structure-activity relationships derived by machine learning: the use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming.

  1996cited by this paper
• Declarative Bias in ILP

  1996cited by this paper
• Efficient Theta-Subsumption Based on Graph Algorithms

  1996cited by this paper
• Relational Instance-Based Learning

  1996cited by this paper
• Inductive Constraint Logic

  1995cited by this paper
• An Efficient Subsumption Algorithm for Inductive Logic Programming

  1994cited by this paper
• Effectiveness of Global Analysis in Strict Independence-Based Automatic Parallelization

  1994cited by this paper
• Learning Semantic Grammars with Constructive Inductive Logic Programming

  1993cited by this paper
• Inductive logic programming: derivations, successes and shortcomings

  1993cited by this paper
• The Application of Inductive Logic Programming to Finite Element Mesh Design

  1992cited by this paper
• Static Analysis of Logic Programs for Independent And-Parallelism

  1992cited by this paper
• Protein secondary structure prediction using logic-based machine learning.

  1992cited by this paper
• Abstract Interpretation and Application to Logic Programs

  1992cited by this paper
• Drug design by machine learning: the use of inductive logic programming to model the structure-activity relationships of trimethoprim analogues binding to dihydrofolate reductase.

  1992cited by this paper
• Inductive Learning Applied to Program Construction and Verification

  1992influential reference
• Inducing Temporal Fault Diagnostic Rules from a Qualitative Model

  1991cited by this paper
• Efficient Induction of Logic Programs

  1990cited by this paper
• Learning logical definitions from relations

  1990cited by this paper
• Foundations of logic programming; (2nd extended ed.)

  1987cited by this paper
• Foundations of Logic Programming

  1984cited by this paper
• Query Optimization in Database Systems

  1984cited by this paper
• Program Improvement by Source-to-Source Transformation

  1977cited by this paper
• An empirical study of FORTRAN programs

  1971cited by this paper

• SIB: Sorted‐Integers‐Based Index for Compact and Fast Caching in Top‐Down Logic Rule Mining Targeting KB Compression

  2025cites this paper
• Learning big logical rules by joining small rules

  2024cites this paper
• Learning programs by learning from failures

  2021cites this paper
• Learning programs by learning from failures

  2020cites this paper
• Logically Scalable and Efficient Relational Learning

  2018cites this paper
• Logical scalability and efficiency of relational learning algorithms

  2018cites this paper
• Authenticus – List of Publications

  2018cites this paper
• Parallel Algorithms for Multirelational Data Mining: Application to Life Science Problems

  2016cites this paper
• Relational Learning with GPUs: Accelerating Rule Coverage

  2016cites this paper
• Policy-based memoization for ILP-based concept discovery systems

  2016influential citation
• Schema Independent Relational Learning

  2015cites this paper
• Utilizing Coverage Lists as a Pruning Mechanism for Concept Discovery

  2014cites this paper
• QuickFOIL: Scalable Inductive Logic Programming

  2014cites this paper
• AND Parallelism for ILP: The APIS System

  2013cites this paper
• What Kinds of Relational Features Are Useful for Statistical Learning?

  2012cites this paper
• Chapter 11 Mining Chains of Relations

  2012cites this paper
• Improving Hash Table Hit Ratio of an ILP-Based Concept Discovery System with Memoization Capabilities

  2012cites this paper
• Theory and Practice of Logic Programming

  2012cites this paper
• Tümevaran Mantık Programlama Tabanlı Kavram Keşif Sistemleri için Paralel bir Yöntem

  2012cites this paper
• Data and task parallelism in ILP using MapReduce

  2011cites this paper
• Learning Methodologies for Detection and Classification of Mutagens

  2011cites this paper
• A design and implementation of the Extended Andorra Model 1

  2011cites this paper
• A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets

  2011cites this paper
• Improving the Efficiency of Approximate Inference for Probabilistic Logical Models by means of Program Specialization

  2011cites this paper
• A workbench to develop ILP systems

  2010cites this paper
• Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization

  2010cites this paper
• When Does It Pay Off to Use Sophisticated Entailment Engines in ILP?

  2010cites this paper
• Efficient learning and evaluation of complex concepts in inductive logic programming

  2010cites this paper
• Adaptively finding and combining first-order rules for large, skewed data sets

  2009influential citation
• The ACE Data Mining System User's Manual

  2009cites this paper
• Improving the efficiency of inductive logic programming systems

  2009cites this paper
• Parallel ILP for distributed-memory architectures

  2009cites this paper
• Compile the Hypothesis Space: Do it Once, Use it Often

  2008cites this paper
• Induction as a search procedure

  2008cites this paper
• TopLog: ILP Using a Logic Program Declarative Bias

  2008cites this paper
• Dealing with large predicates: exo-compilation in the WAM and in Mercury

  2007cites this paper
• Big facts, void variables, the WAM and exo-compilation

  2007cites this paper
• Learning Horn Expressions with LOGAN-H

  2007cites this paper
• Proceedings of CICLOPS 2007 7 th International Colloquium on Implementation of Constraint and LOgic Programming Systems

  2007cites this paper
• ILP : - Just Trie It

  2007cites this paper
• Prolog Performance on Larger Datasets

  2007cites this paper
• ILP: Compute Once, Reuse Often

  2007cites this paper
• Efficient and Scalable Induction of Logic Programs Using a Deductive Database System

  2007cites this paper
• Guiding the Search in the NO Region of the Phase Transition Problem with a Partial Subsumption Test

  2006cites this paper
• An inductive logic programming approach to statistical relational learning

  2006cites this paper
• April - An Inductive Logic Programming System

  2006cites this paper
• Guiding ILP Search in the Sparse Solutions Region with a Partial Subsumption Test

  2006cites this paper
• Nuno Alberto Paulino da Fonseca Parallelism in Inductive Logic Programming Systems

  2006cites this paper
• On Applying Tabling to Inductive Logic Programming

  2005cites this paper
• Strategies to Parallelize ILP Systems

  2005cites this paper
• Analyzing & debugging ILP data mining query execution

  2005cites this paper
• Efficient Sampling in Relational Feature Spaces

  2005cites this paper
• Mining chains of relations

  2005cites this paper
• CLASSIC'CL: An Integrated ILP System

  2005cites this paper
• A Framework for Set-Oriented Computation in Inductive Logic Programming and Its Application in Generalizing Inverse Entailment

  2005cites this paper
• On Predicting Protein Secondary Structure from their Aminoacid Sequences using Inductive Logic Programming

  2005cites this paper
• A Study of Applying Dimensionality Reduction to Restrict the Size of a Hypothesis Space

  2005cites this paper
• Techniques for Improving the Efficiency of Inductive Logic Programming in the Context of Data Mining (Technieken voor het verhogen van de efficiëntie van inductief logisch programmeren in de context van datamining)

  2004cites this paper
• Learning an Approximation to Inductive Logic Programming Clause Evaluation

  2004cites this paper
• On Avoiding Redundancy in Inductive Logic Programming

  2004cites this paper
• Fast Theta-Subsumption with Constraint Satisfaction Algorithms

  2004influential citation
• An Efficient Algorithm for Reducing Clauses Based on Constraint Satisfaction Techniques

  2004influential citation
• From sequential to parallel Inductive Logic Programming

  2004cites this paper
• Condensed Representations for Inductive Logic Programming

  2004cites this paper
• As lazy as it can be

  2003cites this paper
• Alternatives for compile & run in the WAM

  2003cites this paper
• Improving the Efficiency of ILP Systems

  2003cites this paper
• Induction with April : A preliminary report

  2003influential citation
• Query Optimization in Inductive Logic Programming by Reordering Literals

  2003influential citation
• A Multi-relational Decision Tree Learning Algorithm - Implementation and Experiments

  2003cites this paper
• Efficient Data Structures for Inductive Logic Programming

  2003cites this paper
• Query optimization: Combining query packs and the once-tranformation

  2003influential citation
• Speeding Up Relational Data Mining by Learning to Estimate Candidate Hypothesis Scores

  2003cites this paper
• An execution mechanism for combining query packs and once-transformations

  2003influential citation
• A parallel ILP algorithm that incorporates incremental batch learning

  2003cites this paper
• On the Implementation of an ILP System with Prolog

  2003influential citation
• On avoiding redundancy in Inductive Logic Programming systems

  2003cites this paper
• Scalability and efficiency in multi-relational data mining

  2003cites this paper
• Fast relational data mining - Query optimization for improving the efficiency of relational data mining systems

  2003cites this paper
• Under Consideration for Publication in Theory and Practice of Logic Programming Subsumer: a Prolog Θ-subsumption Engine

  year unknowninfluential citation
• Under Consideration for Publication in Theory and Practice of Logic Programming a Design and Implementation of the Extended Andorra Model *

  year unknowncites this paper