Block-wise construction of tree-like relational features with monotone reducibility and redundancy.
- Published in:
- Machine Learning, 2011, v. 83, n. 2, p. 163, doi. 10.1007/s10994-010-5208-5
- By:
- Publication type:
- Article
Works matching IS 08856125 AND DT 2011 AND VI 83 AND IP 2
Results: 6
1
2
Constraint-based probabilistic modeling for statistical abduction.
- Published in:
- Machine Learning, 2011, v. 83, n. 2, p. 241, doi. 10.1007/s10994-010-5206-7
- By:
- Publication type:
- Article
3
Efficient mining for structurally diverse subgraph patterns in large molecular databases.
- Published in:
- Machine Learning, 2011, v. 83, n. 2, p. 193, doi. 10.1007/s10994-010-5187-6
- By:
- Publication type:
- Article
4
Guest editorial to the special issue on inductive logic programming, mining and learning in graphs and statistical relational learning.
- Published in:
- 2011
- By:
- Publication type:
- Editorial
5
Relational information gain.
- Published in:
- Machine Learning, 2011, v. 83, n. 2, p. 219, doi. 10.1007/s10994-010-5194-7
- By:
- Publication type:
- Article
6
Effective feature construction by maximum common subgraph sampling.
- Published in:
- Machine Learning, 2011, v. 83, n. 2, p. 137, doi. 10.1007/s10994-010-5193-8
- By:
- Publication type:
- Article