@article{
 title = {Compatible and incompatible abstractions in Bayesian networks},
 type = {article},
 year = {2014},
 keywords = {Abstraction,Bayesian networks,Graphical probabilistic models,Knowledge engineering,Knowledge-based models},
 pages = {84-97},
 volume = {62},
 websites = {http://www.sciencedirect.com/science/article/pii/S095070511400077X},
 month = {5},
 id = {83d9462d-f47b-3e68-a5c2-5ffd41828e3d},
 created = {2015-04-11T19:52:19.000Z},
 accessed = {2015-04-11},
 file_attached = {false},
 profile_id = {95e10851-cdf3-31de-9f82-1ab629e601b0},
 group_id = {9bdefc5c-e377-3144-a22f-2977669d3a99},
 last_modified = {2017-03-14T14:29:17.118Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 private_publication = {false},
 abstract = {The graphical structure of a Bayesian network (BN) makes it a technology well-suited for developing decision support models from a combination of domain knowledge and data. The domain knowledge of experts is used to determine the graphical structure of the BN, corresponding to the relationships and between variables, and data is used for learning the strength of these relationships. However, the available data seldom match the variables in the structure that is elicited from experts, whose models may be quite detailed; consequently, the structure needs to be abstracted to match the data. Up to now, this abstraction has been informal, loosening the link between the final model and the experts’ knowledge. In this paper, we propose a method for abstracting the BN structure by using four ‘abstraction’ operations: node removal, node merging, state-space collapsing and edge removal. Some of these steps introduce approximations, which can be identified from changes in the set of conditional independence (CI) assertions of a network.},
 bibtype = {article},
 author = {Yet, Barbaros and Marsh, D. William R.},
 doi = {10.1016/j.knosys.2014.02.020},
 journal = {Knowledge-Based Systems}
}

{"_id":"968LsRhWn6gXzhZgx","authorIDs":[],"author_short":["Yet, B.","Marsh, D., W., R."],"bibbaseid":"yet-marsh-compatibleandincompatibleabstractionsinbayesiannetworks-2014","bibdata":{"title":"Compatible and incompatible abstractions in Bayesian networks","type":"article","year":"2014","keywords":"Abstraction,Bayesian networks,Graphical probabilistic models,Knowledge engineering,Knowledge-based models","pages":"84-97","volume":"62","websites":"http://www.sciencedirect.com/science/article/pii/S095070511400077X","month":"5","id":"83d9462d-f47b-3e68-a5c2-5ffd41828e3d","created":"2015-04-11T19:52:19.000Z","accessed":"2015-04-11","file_attached":false,"profile_id":"95e10851-cdf3-31de-9f82-1ab629e601b0","group_id":"9bdefc5c-e377-3144-a22f-2977669d3a99","last_modified":"2017-03-14T14:29:17.118Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"private_publication":false,"abstract":"The graphical structure of a Bayesian network (BN) makes it a technology well-suited for developing decision support models from a combination of domain knowledge and data. The domain knowledge of experts is used to determine the graphical structure of the BN, corresponding to the relationships and between variables, and data is used for learning the strength of these relationships. However, the available data seldom match the variables in the structure that is elicited from experts, whose models may be quite detailed; consequently, the structure needs to be abstracted to match the data. Up to now, this abstraction has been informal, loosening the link between the final model and the experts’ knowledge. In this paper, we propose a method for abstracting the BN structure by using four ‘abstraction’ operations: node removal, node merging, state-space collapsing and edge removal. Some of these steps introduce approximations, which can be identified from changes in the set of conditional independence (CI) assertions of a network.","bibtype":"article","author":"Yet, Barbaros and Marsh, D. William R.","doi":"10.1016/j.knosys.2014.02.020","journal":"Knowledge-Based Systems","bibtex":"@article{\n title = {Compatible and incompatible abstractions in Bayesian networks},\n type = {article},\n year = {2014},\n keywords = {Abstraction,Bayesian networks,Graphical probabilistic models,Knowledge engineering,Knowledge-based models},\n pages = {84-97},\n volume = {62},\n websites = {http://www.sciencedirect.com/science/article/pii/S095070511400077X},\n month = {5},\n id = {83d9462d-f47b-3e68-a5c2-5ffd41828e3d},\n created = {2015-04-11T19:52:19.000Z},\n accessed = {2015-04-11},\n file_attached = {false},\n profile_id = {95e10851-cdf3-31de-9f82-1ab629e601b0},\n group_id = {9bdefc5c-e377-3144-a22f-2977669d3a99},\n last_modified = {2017-03-14T14:29:17.118Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n private_publication = {false},\n abstract = {The graphical structure of a Bayesian network (BN) makes it a technology well-suited for developing decision support models from a combination of domain knowledge and data. The domain knowledge of experts is used to determine the graphical structure of the BN, corresponding to the relationships and between variables, and data is used for learning the strength of these relationships. However, the available data seldom match the variables in the structure that is elicited from experts, whose models may be quite detailed; consequently, the structure needs to be abstracted to match the data. Up to now, this abstraction has been informal, loosening the link between the final model and the experts’ knowledge. In this paper, we propose a method for abstracting the BN structure by using four ‘abstraction’ operations: node removal, node merging, state-space collapsing and edge removal. Some of these steps introduce approximations, which can be identified from changes in the set of conditional independence (CI) assertions of a network.},\n bibtype = {article},\n author = {Yet, Barbaros and Marsh, D. William R.},\n doi = {10.1016/j.knosys.2014.02.020},\n journal = {Knowledge-Based Systems}\n}","author_short":["Yet, B.","Marsh, D., W., R."],"urls":{"Website":"http://www.sciencedirect.com/science/article/pii/S095070511400077X"},"biburl":"https://bibbase.org/service/mendeley/95e10851-cdf3-31de-9f82-1ab629e601b0","bibbaseid":"yet-marsh-compatibleandincompatibleabstractionsinbayesiannetworks-2014","role":"author","keyword":["Abstraction","Bayesian networks","Graphical probabilistic models","Knowledge engineering","Knowledge-based models"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"https://bibbase.org/service/mendeley/95e10851-cdf3-31de-9f82-1ab629e601b0","creationDate":"2015-04-11T20:06:47.219Z","downloads":0,"keywords":["abstraction","bayesian networks","graphical probabilistic models","knowledge engineering","knowledge-based models"],"search_terms":["compatible","incompatible","abstractions","bayesian","networks","yet","marsh"],"title":"Compatible and incompatible abstractions in Bayesian networks","year":2014,"dataSources":["ya2CyA73rpZseyrZ8","2252seNhipfTmjEBQ"]}