We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Learning decomposable markov networks in pseudo-independent domains with local evaluation.
- Authors
Y. Xiang; J. Lee
- Abstract
<span class="AbstractHeading">Abstract </span>We consider learning probabilistic graphical models in a problem domain of unknown dependence structure. Common learning algorithms rely on single-link lookahead search, which assumes the underlying domain is not pseudo-independent. Since the dependence structure of the domain is unknown, such assumption is fallible. We study learning algorithms that make no such assumption and return an approximate dependence structure no matter whether the domain is pseudo-independent or not. The focus of this paper is on learning decomposable Markov networks, which can directly be used for model-based inference or as the intermediate step for further learning of directed graphical models. We identify a small subset of domain variables, termed crux, in the graphical models currently being examined during search. We prove that crux is sufficient for computing the incremental change of both model description length as well as data description length given the model. Based on crux, we propose algorithms that reduce evaluation of alternative graphical models to local computation, improve efficiency significantly, and introduce no error to the selection of alternative models.
- Publication
Machine Learning, 2006, Vol 65, Issue 1, p199
- ISSN
0885-6125
- Publication type
Article
- DOI
10.1007/s10994-006-8366-8