Towards scalable and data efficient learning of Markov boundaries
type: Item
instance of: scholarly article
title: Towards scalable and data efficient learning of Markov boundaries
zbMATH Open document ID: 1122.68136
author: Roland Nilsson
author: Johan Björkegren
author: Jesper Tegnér
author: Jose M. Peña
published in: International Journal of Approximate Reasoning
publication date: 2007-07-19T00:00:00Z
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 5173140
zbMATH Keywords: Bayesian networks
zbMATH Keywords: feature subset selection
zbMATH Keywords: classification
describes a project that uses: TETRAD
describes a project that uses: MLC++
MaRDI profile type: Publication
full work available at URL: j.ijar.2006.06.008
OpenAlex ID: W2013374740
cites work: Q3093331
cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty
cites work: Statistical challenges in functional genomics. (With comments and a rejoinder).
cites work: Causation, prediction, and search
cites work: Q4663408
cites work: The max-min hill-climbing Bayesian network structure learning algorithm
DOI: 10.1016/J.IJAR.2006.06.008
description: scientific article; zbMATH DE number 5173140