10.1162/153244302760200696

From MaRDI portal
Publication:4779563

DOI10.1162/153244302760200696zbMATH Open1007.68179arXiv1302.3566OpenAlexW1586003574MaRDI QIDQ4779563FDOQ4779563

David Maxwell Chickering

Publication date: 27 November 2002

Published in: CrossRef Listing of Deleted DOIs (Search for Journal in Brave)

Abstract: Approaches to learning Bayesian networks from data typically combine a scoring function with a heuristic search procedure. Given a Bayesian network structure, many of the scoring functions derived in the literature return a score for the entire equivalence class to which the structure belongs. When using such a scoring function, it is appropriate for the heuristic search algorithm to search over equivalence classes of Bayesian networks as opposed to individual structures. We present the general formulation of a search space for which the states of the search correspond to equivalence classes of structures. Using this space, any one of a number of heuristic search algorithms can easily be applied. We compare greedy search performance in the proposed search space to greedy search performance in a search space for which the states correspond to individual Bayesian network structures.


Full work available at URL: https://arxiv.org/abs/1302.3566






Cited In (76)


   Recommendations





This page was built for publication: 10.1162/153244302760200696

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779563)