Complexity-based induction

MaRDI QIDQ1345141zbMATH OpenFDO

Authors Darrell Conklin, Ian H. Witten

Publication date 26 February 1995

Published in Machine Learning (Search for Journal in Brave)

zbMATH Keywords

inductive logic programmingmodel complexity

Mathematics Subject Classification ID

Logic programming (68N17) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On the complexity of induction of structural descriptions
• Inductive Logic Programming: Theory and methods
• scientific article; zbMATH DE number 1453038
• Complexity in the case against accuracy estimation
• On the complexity of inductive inference

Cited in

(9)

• On the complexity of induction of structural descriptions
• Complexity in the case against accuracy estimation
• Facility location problems: a parameterized view
• Facility Location Problems: A Parameterized View
• Inductive Complexity of Goodstein’s Theorem
• Inductive Logic Programming
• Explanatory and creative alternatives to the MDL principle
• Boolean matrix logic programming for active learning of gene functions in genome-scale metabolic network models
• An empirical comparison of cost functions in inductive logic programming

This page was built for publication: Complexity-based induction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345141)