Algorithms for learning parsimonious context trees

DOI10.1007/S10994-018-5770-9zbMATH Open1493.68298OpenAlexW2901529395WikidataQ128960148 ScholiaQ128960148MaRDI QIDQ2425237FDOQ2425237

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conditional independence and chain event graphs
• Estimating the dimension of a model
• A new look at the statistical model identification
• Learning Bayesian networks: The combination of knowledge and statistical data
• 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
• Optimal classification trees
• Learning probabilistic decision graphs
• Algorithms for optimal dyadic decision trees

Cited In (1)

• Learning extended tree augmented naive structures

Uses Software

• UCI-ml
• Jstacs
• JASPAR
• UniProt

Recommendations

• Learning optimal decision trees using constraint programming 👍 👎
• Structure Learning for Extremal Tree Models 👍 👎
• Exact learning of multitrees and almost-trees using path queries 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)