Algorithms for learning parsimonious context trees
From MaRDI portal
Publication:2425237
DOI10.1007/s10994-018-5770-9zbMath1493.68298OpenAlexW2901529395WikidataQ128960148 ScholiaQ128960148MaRDI QIDQ2425237
Mikko Koivisto, Ivo Grosse, Ralf Eggeling
Publication date: 26 June 2019
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10138/302822
Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional independence and chain event graphs
- Estimating the dimension of a model
- The stochastic EM algorithm: Estimation and asymptotic results
- Learning Bayesian networks: The combination of knowledge and statistical data
- Algorithms for optimal dyadic decision trees
- Variable length Markov chains
- Optimal dyadic decision trees
- Learning probabilistic decision graphs
- A survey of cost-sensitive decision tree induction algorithms
- A universal data compression system
- Optimal classification trees
- A new look at the statistical model identification
This page was built for publication: Algorithms for learning parsimonious context trees