Top program construction and reduction for polynomial time Meta-Interpretive learning.
- Published in:
- Machine Learning, 2021, v. 110, n. 4, p. 755, doi. 10.1007/s10994-020-05945-w
- By:
- Publication type:
- Article
Works matching IS 08856125 AND DT 2021 AND VI 110 AND IP 4
Results: 8
1
2
Learning programs by learning from failures.
- Published in:
- Machine Learning, 2021, v. 110, n. 4, p. 801, doi. 10.1007/s10994-020-05934-z
- By:
- Publication type:
- Article
3
Beneficial and harmful explanatory machine learning.
- Published in:
- Machine Learning, 2021, v. 110, n. 4, p. 695, doi. 10.1007/s10994-020-05941-0
- By:
- Publication type:
- Article
4
SPEED: secure, PrivatE, and efficient deep learning.
- Published in:
- Machine Learning, 2021, v. 110, n. 4, p. 675, doi. 10.1007/s10994-021-05970-3
- By:
- Publication type:
- Article
5
An extended DEIM algorithm for subset selection and class identification.
- Published in:
- Machine Learning, 2021, v. 110, n. 4, p. 621, doi. 10.1007/s10994-021-05954-3
- By:
- Publication type:
- Article
6
Protect privacy of deep classification networks by exploiting their generative power.
- Published in:
- Machine Learning, 2021, v. 110, n. 4, p. 651, doi. 10.1007/s10994-021-05951-6
- By:
- Publication type:
- Article
7
AUTOMAT[R]IX: learning simple matrix pipelines.
- Published in:
- Machine Learning, 2021, v. 110, n. 4, p. 779, doi. 10.1007/s10994-021-05950-7
- By:
- Publication type:
- Article
8
Probabilistic inductive constraint logic.
- Published in:
- Machine Learning, 2021, v. 110, n. 4, p. 723, doi. 10.1007/s10994-020-05911-6
- By:
- Publication type:
- Article