Algorithms for learning parsimonious context trees

DOI10.1007/S10994-018-5770-9MaRDI QIDQ2425237zbMATH OpenOpenAlexWikidataFDO

Authors Ralf Eggeling, Ivo Grosse, Mikko Koivisto

Publication date 26 June 2019

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://hdl.handle.net/10138/302822

zbMATH Keywords

structure learningcontext-specific independenceexact algorithmsbranch and boundsequential data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90)

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

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 2243374 (Why is no real title available?)
• A new look at the statistical model identification
• A survey of cost-sensitive decision tree induction algorithms
• A universal data compression system
• Algorithms for optimal dyadic decision trees
• Conditional independence and chain event graphs
• Efficient structure learning of Bayesian networks using constraints
• Estimating the dimension of a model
• Learning Bayesian networks: The combination of knowledge and statistical data
• Learning probabilistic decision graphs
• Optimal classification trees
• Optimal dyadic decision trees
• The stochastic EM algorithm: Estimation and asymptotic results
• Variable length Markov chains

Cited in

(2)

• Learning extended tree augmented naive structures
• CPD tree learning using contexts as background knowledge

Describes a project that uses

Uses Software

• UniProt
• JASPAR
• Jstacs
• UCI

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)