Pages that link to "Item:Q1274285"
From MaRDI portal
The following pages link to Top-down induction of first-order logical decision trees (Q1274285):
Displayed 18 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)
- 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)
- A comparison of pruning criteria for probability trees (Q1959552) (← links)
- Fast learning of relational kernels (Q1959554) (← links)
- First order random forests: Learning relational classifiers with complex aggregates (Q2433184) (← links)
- Distribution-based aggregation for relational learning with identifier attributes (Q2491368) (← links)
- Top-Down Induction of Relational Model Trees in Multi-instance Learning (Q3543268) (← links)
- Feature Discovery with Type Extension Trees (Q3543273) (← 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)