Parent Assignment Is Hard for the MDL, AIC, and NML Costs

DOI10.1007/11776420_23zbMath1143.68404OpenAlexW1531497638MaRDI QIDQ5307575

Mikko Koivisto

Publication date: 14 September 2007

Published in: Learning Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11776420_23

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Entropy-based pruning for learning Bayesian networks using BIC ⋮ Improved building blocks for secure multi-party computation based on secret sharing with honest majority

This page was built for publication: Parent Assignment Is Hard for the MDL, AIC, and NML Costs