Algorithms for learning parsimonious context trees
From MaRDI portal
Publication:2425237
DOI10.1007/S10994-018-5770-9zbMATH Open1493.68298OpenAlexW2901529395WikidataQ128960148 ScholiaQ128960148MaRDI QIDQ2425237FDOQ2425237
Authors: Ralf Eggeling, Ivo Grosse, Mikko Koivisto 
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
Recommendations
- Learning trees from strings: a strong learning algorithm for some context-free grammars
- Learning optimal decision trees using constraint programming
- Exact learning of multitrees and almost-trees using path queries
- Structure Learning for Extremal Tree Models
- A learning algorithm for a subclass of tree rewriting systems
- scientific article; zbMATH DE number 1954169
Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90)
Cites Work
- Conditional independence and chain event graphs
- Estimating the dimension of a model
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new look at the statistical model identification
- Learning Bayesian networks: The combination of knowledge and statistical data
- Efficient structure learning of Bayesian networks using constraints
- A survey of cost-sensitive decision tree induction algorithms
- The stochastic EM algorithm: Estimation and asymptotic results
- A universal data compression system
- Optimal dyadic decision trees
- Variable length Markov chains
- Title not available (Why is that?)
- Optimal classification trees
- Learning probabilistic decision graphs
- Algorithms for optimal dyadic decision trees
Cited In (2)
Uses Software
This page was built for publication: Algorithms for learning parsimonious context trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425237)
