The following pages link to Logical and Relational Learning (Q3514981):
Displayed 50 items.
- Relational concept analysis: mining concept lattices from multi-relational data (Q354609) (← links)
- Effective feature construction by maximum common subgraph sampling (Q413859) (← links)
- Relational information gain (Q413866) (← links)
- Reference classes and relational learning (Q432965) (← links)
- ILP turns 20. Biography and future challenges (Q439010) (← 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)
- Relational linear programming (Q511779) (← links)
- Constraint acquisition (Q511791) (← links)
- On the complexity of propositional and relational credal networks (Q518627) (← links)
- Information systems in modeling interactive computations on granules (Q642541) (← links)
- Interactive information systems: toward perception based computing (Q714829) (← links)
- An expressive dissimilarity measure for relational clustering using neighbourhood trees (Q1698849) (← links)
- Relational data factorization (Q1699908) (← links)
- kProbLog: an algebraic Prolog for machine learning (Q1699913) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Using the bottom clause and mode declarations in FOL theory revision from examples (Q1959495) (← links)
- Cluster-grouping: from subgroup discovery to clustering (Q1959523) (← links)
- Fast learning of relational kernels (Q1959554) (← links)
- Speeding up parameter and rule learning for acyclic probabilistic logic programs (Q1999576) (← links)
- Learning programs by learning from failures (Q2051282) (← links)
- Inductive logic programming at 30 (Q2127222) (← links)
- Inductive general game playing (Q2203324) (← links)
- Propositionalization and embeddings: two sides of the same coin (Q2203327) (← links)
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
- Some thoughts on knowledge-enhanced machine learning (Q2237522) (← links)
- Making sense of sensory input (Q2238610) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws (Q2283277) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- Complexity results for probabilistic answer set programming (Q2302961) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
- Lifted graphical models: a survey (Q2347709) (← links)
- The effect of combination functions on the complexity of relational Bayesian networks (Q2409113) (← links)
- Semi-supervised online structure learning for composite event recognition (Q2425248) (← links)
- Online probabilistic theory revision from examples with ProPPR (Q2425252) (← links)
- Association discovery from relational data via granular computing (Q2446397) (← links)
- (Q3384892) (← links)
- Relational and Semantic Data Mining (Q3449187) (← links)
- Inference and learning in probabilistic logic programs using weighted Boolean formulas (Q4592983) (← links)
- Online learning of event definitions (Q4593061) (← links)
- (Q4625699) (← links)
- (Q4633042) (← links)
- (Q4969094) (← links)
- Predicting the Evolution of Communities with Online Inductive Logic Programming (Q5079768) (← links)
- (Q5079773) (← links)
- A Comprehensive Framework for Learning Declarative Action Models (Q5094057) (← links)
- Machine learning and logic: a new frontier in artificial intelligence (Q6056641) (← links)
- Fuzzy OWL-Boost: learning fuzzy concept inclusions via real-valued boosting (Q6058113) (← links)