Pages that link to "Item:Q1274285"
From MaRDI portal
The following pages link to Top-down induction of first-order logical decision trees (Q1274285):
Displaying 50 items.
- Using trees to mine multirelational databases (Q408677) (← links)
- Relational information gain (Q413866) (← links)
- Gradient-based boosting for statistical relational learning: the relational dependency network case (Q439014) (← links)
- Data and task parallelism in ILP using mapreduce (Q439026) (← links)
- kLog: a language for logical and relational learning with kernels (Q464624) (← links)
- Type extension trees for feature construction and learning in relational domains (Q490428) (← links)
- First order regression (Q678589) (← links)
- Learning relational dependency networks in hybrid domains (Q747248) (← links)
- Feature ranking for multi-target regression (Q782468) (← links)
- Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases (Q894696) (← links)
- On the connection between the phase transition of the covering test and the learning success rate in ILP (Q1009240) (← links)
- Generalized ordering-search for learning directed probabilistic logical models (Q1009243) (← links)
- Inductive logic programming for gene regulation prediction (Q1009247) (← links)
- Ensembles for multi-target regression with random output selections (Q1631826) (← links)
- The complexity and generality of learning answer set programs (Q1647512) (← links)
- Approximate classification with web ontologies through evidential terminological trees and forests (Q1687300) (← links)
- A comparison of pruning criteria for probability trees (Q1959552) (← links)
- Fast learning of relational kernels (Q1959554) (← links)
- Probabilistic inductive constraint logic (Q2051275) (← links)
- Learning programs by learning from failures (Q2051282) (← links)
- Inductive logic programming at 30 (Q2127222) (← links)
- Learning higher-order logic programs (Q2203320) (← links)
- Transfer learning by mapping and revising boosted relational dependency networks (Q2203326) (← links)
- Incremental predictive clustering trees for online semi-supervised multi-target regression (Q2217403) (← links)
- Multi-label feature ranking with ensemble methods (Q2217404) (← links)
- Non-parametric learning of lifted restricted Boltzmann machines (Q2310287) (← links)
- On the use of stochastic local search techniques to revise first-order logic theories from examples (Q2361575) (← links)
- An empirical study of on-line models for relational data streams (Q2361576) (← links)
- Bagging strategies for learning planning policies (Q2364365) (← links)
- Semi-supervised online structure learning for composite event recognition (Q2425248) (← links)
- Online probabilistic theory revision from examples with ProPPR (Q2425252) (← links)
- First order random forests: Learning relational classifiers with complex aggregates (Q2433184) (← links)
- Distribution-based aggregation for relational learning with identifier attributes (Q2491368) (← links)
- Algebraic Reinforcement Learning (Q2945728) (← links)
- Top-Down Induction of Relational Model Trees in Multi-instance Learning (Q3543268) (← links)
- Feature Discovery with Type Extension Trees (Q3543273) (← links)
- (Q4413480) (← links)
- Learning weak constraints in answer set programming (Q4592994) (← links)
- Online learning of event definitions (Q4593061) (← links)
- FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data (Q5038469) (← links)
- On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
- Learning-driven goal generation (Q5145430) (← links)
- Fast Frequent Querying with Lazy Control Flow Compilation (Q5297633) (← links)
- Knowledge discovery and data mining in toxicology (Q5424020) (← links)
- Relational Sequence Learning (Q5452021) (← links)
- Seeing the Forest Through the Trees (Q5452097) (← links)
- Building Relational World Models for Reinforcement Learning (Q5452098) (← links)
- Learning logic programs by explaining their failures (Q6053808) (← links)
- Learning Distributional Programs for Relational Autocompletion (Q6063874) (← links)
- Learning programs with magic values (Q6161212) (← links)
