Top-down induction of first-order logical decision trees
From MaRDI portal
Recommendations
Cites work
- Concept recognition: An approximate reasoning framework
- First-order \(jk\)-clausal theories are PAC-learnable
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3967882 (Why is no real title available?)
- scientific article; zbMATH DE number 67807 (Why is no real title available?)
- scientific article; zbMATH DE number 1149407 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- Inductive Logic Programming: Theory and methods
- Solving the multiple instance problem with axis-parallel rectangles.
Cited in
(60)- On the connection between the phase transition of the covering test and the learning success rate in ILP
- Generalized ordering-search for learning directed probabilistic logical models
- Inductive logic programming for gene regulation prediction
- Ensembles for multi-target regression with random output selections
- The complexity and generality of learning answer set programs
- Approximate classification with web ontologies through evidential terminological trees and forests
- A comparison of pruning criteria for probability trees
- Fast learning of relational kernels
- Probabilistic inductive constraint logic
- Learning programs by learning from failures
- Inductive logic programming at 30
- Learning higher-order logic programs
- Transfer learning by mapping and revising boosted relational dependency networks
- Incremental predictive clustering trees for online semi-supervised multi-target regression
- Multi-label feature ranking with ensemble methods
- Non-parametric learning of lifted restricted Boltzmann machines
- On the use of stochastic local search techniques to revise first-order logic theories from examples
- An empirical study of on-line models for relational data streams
- Bagging strategies for learning planning policies
- Semi-supervised online structure learning for composite event recognition
- Online probabilistic theory revision from examples with ProPPR
- First order random forests: Learning relational classifiers with complex aggregates
- Distribution-based aggregation for relational learning with identifier attributes
- Algebraic reinforcement learning. Hypothesis induction for relational reinforcement learning using term generalization.
- Top-Down Induction of Relational Model Trees in Multi-instance Learning
- Feature Discovery with Type Extension Trees
- Using trees to mine multirelational databases
- Relational information gain
- Induction of logic programs by example-guided unfolding
- Gradient-based boosting for statistical relational learning: the relational dependency network case
- Data and task parallelism in ILP using mapreduce
- scientific article; zbMATH DE number 1950768 (Why is no real title available?)
- Learning weak constraints in answer set programming
- Online learning of event definitions
- kLog: a language for logical and relational learning with kernels
- scientific article; zbMATH DE number 2087937 (Why is no real title available?)
- Type extension trees for feature construction and learning in relational domains
- FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data
- On Tackling Explanation Redundancy in Decision Trees
- Learning-driven goal generation
- Fast Frequent Querying with Lazy Control Flow Compilation
- Modeling machine learning and data mining problems with \(\mathrm{FO}(\cdot )\)
- Knowledge discovery and data mining in toxicology
- Relational Sequence Learning
- Seeing the Forest Through the Trees
- Building Relational World Models for Reinforcement Learning
- TopLog: ILP Using a Logic Program Declarative Bias
- Learning logic programs by explaining their failures
- Learning Distributional Programs for Relational Autocompletion
- Learning programs with magic values
- Non-parametric learning of embeddings for relational data using Gaifman locality theorem
- Logic-based learning of answer set programs
- Decision tree learning with spatial modal logics
- First order regression
- Mixtures of probabilistic logic programs
- A utility-driven approach to instance-based transfer learning for relational domains
- An empirical comparison of cost functions in inductive logic programming
- Learning relational dependency networks in hybrid domains
- Feature ranking for multi-target regression
- Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases
This page was built for publication: Top-down induction of first-order logical decision trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274285)
