{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:33:23Z","timestamp":1738215203070,"version":"3.34.0"},"reference-count":21,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2008,3]]},"abstract":"<jats:p> In this paper, we propose a new method, named Greedy Equivalence Search-Expectation Maximization (GES-EM), for learning Bayesian networks from incomplete data. Our method extends the recently proposed Greedy Equivalence Search (GES) algorithm<jats:sup>10<\/jats:sup> to deal with incomplete data. For the quality evaluation of learned networks, we make use of the expected Bayesian Information Criterion (BIC) scoring function. In addition, we propose a new structural evaluation criterion. This so-called SEC criterion is more suitable than existing structural evaluation criteria, since it is based on the comparison of learned networks to the generating ones through Completed Partially Directed Acyclic Graphs (CPDAGs). Experimental results show that GES-EM algorithm yields more accurate structures than the standard Alternating Model Selection-Expectation Maximization (AMS-EM) algorithm.<jats:sup>15<\/jats:sup>. <\/jats:p>","DOI":"10.1142\/s0218001408006193","type":"journal-article","created":{"date-parts":[[2008,3,24]],"date-time":"2008-03-24T07:47:43Z","timestamp":1206344863000},"page":"253-278","source":"Crossref","is-referenced-by-count":6,"title":["LEARNING AND EVALUATING BAYESIAN NETWORK EQUIVALENCE CLASSES FROM INCOMPLETE DATA"],"prefix":"10.1142","volume":"22","author":[{"given":"HANEN","family":"BORCHANI","sequence":"first","affiliation":[{"name":"LARODEC, Institut Sup\u00e9rieur de Gestion de Tunis, 41 Avenue de la libert\u00e9, 2000 Le Bardo, Tunisie"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"NAHLA BEN","family":"AMOR","sequence":"additional","affiliation":[{"name":"LARODEC, Institut Sup\u00e9rieur de Gestion de Tunis, 41 Avenue de la libert\u00e9, 2000 Le Bardo, Tunisie"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00c9DIA","family":"KHALFALLAH","sequence":"additional","affiliation":[{"name":"LARODEC, Institut Sup\u00e9rieur de Gestion de Tunis, 41 Avenue de la libert\u00e9, 2000 Le Bardo, Tunisie"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018901032102"},{"key":"rf3","first-page":"505","volume":"25","author":"Andersson S. A.","journal-title":"Ann. Stat."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007421730016"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/69.494161"},{"key":"rf6","first-page":"527","volume":"4","author":"Castelo R.","journal-title":"J. Mach. Learn. Res."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2404-4_12"},{"key":"rf10","first-page":"507","volume":"3","author":"Chickering D. M.","journal-title":"J. Mach. Learn. Res."},{"key":"rf11","first-page":"309","volume":"9","author":"Cooper G. F.","journal-title":"Mach. Learn."},{"key":"rf12","first-page":"1","volume":"39","author":"Dempster A. P.","journal-title":"J. Roy. Stat. Soc. B"},{"key":"rf18","first-page":"149","volume":"2","author":"Henrion M.","journal-title":"Uncert. Artif. Intell."},{"volume-title":"An Introduction to Bayesian Networks","year":"1996","author":"Jensen F. V.","key":"rf19"},{"key":"rf22","first-page":"157","volume":"50","author":"Lauritzen S. L.","journal-title":"J. Roy. Stat. Soc."},{"volume":"10","journal-title":"NIPS","author":"Meila M.","key":"rf24"},{"volume-title":"Learning in Graphical Models","year":"1998","author":"Neal R. M.","key":"rf25"},{"volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","year":"1988","author":"Pearl J.","key":"rf26"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0069178"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003332"},{"key":"rf30","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/63.3.581"},{"key":"rf31","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"rf33","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200507"},{"key":"rf36","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001405004423"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001408006193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:43:07Z","timestamp":1565181787000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001408006193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":21,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2008,3]]}},"alternative-id":["10.1142\/S0218001408006193"],"URL":"https:\/\/doi.org\/10.1142\/s0218001408006193","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"type":"print","value":"0218-0014"},{"type":"electronic","value":"1793-6381"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}