{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:46:01Z","timestamp":1694634361031},"reference-count":37,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":2090,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003176","name":"Ministerio de Educaci\u00f3n, Cultura y Deporte","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003176","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1016\/j.ijar.2008.09.002","type":"journal-article","created":{"date-parts":[[2008,10,8]],"date-time":"2008-10-08T18:07:05Z","timestamp":1223489225000},"page":"472-484","source":"Crossref","is-referenced-by-count":20,"title":["Triangulation of Bayesian networks with recursive estimation of distribution algorithms"],"prefix":"10.1016","volume":"50","author":[{"given":"Txomin","family":"Romero","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Larra\u00f1aga","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ijar.2008.09.002_bib1","unstructured":"S. Andreassen, F.V. Jensen, S.K. Andersen, B. Falck, U. Kj\u00e6rulff, M. Woldbye, A.R. S\u00f8rensen, A. Rosenfalck, F. Jensen, Munin. an emg assistant, Computer-aided surface needle electromyography, Expert Systems in Diagnosis, (1989)."},{"key":"10.1016\/j.ijar.2008.09.002_bib2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM Journal of Algorithms and Discrete Methods"},{"issue":"2","key":"10.1016\/j.ijar.2008.09.002_bib3","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.ijar.2008.09.002_bib4","unstructured":"A. Becker, D. Geiger, A sufficiently fast algorithm for finding close to optimal junction trees, in: Morgan Kaufmann (Ed.), Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, 1996, pp. 81\u201389."},{"key":"10.1016\/j.ijar.2008.09.002_bib5","doi-asserted-by":"crossref","unstructured":"E. Bengoetxea, Inexact graph matching using estimation of distribution algorithms. Ph.D Thesis, Ecole Nationale Sup\u00e9rieure des T\u00e9l\u00e9communications, Paris, France, December 2002.","DOI":"10.1016\/S0031-3203(01)00232-1"},{"issue":"12","key":"10.1016\/j.ijar.2008.09.002_bib6","doi-asserted-by":"crossref","first-page":"2867","DOI":"10.1016\/S0031-3203(01)00232-1","article-title":"Learning and simulation of Bayesian networks applied to inexact graph matching","volume":"35","author":"Bengoetxea","year":"2002","journal-title":"Pattern Recognition"},{"key":"10.1016\/j.ijar.2008.09.002_bib7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/int.10084","article-title":"Learning Bayesian networks in the space of structures by estimation of distribution algorithms","volume":"18","author":"Blanco","year":"2003","journal-title":"International Journal of Intelligent Systems"},{"key":"10.1016\/j.ijar.2008.09.002_bib8","unstructured":"H. Bodlaender, A. Koster, F. van den Eijkhof, L. van der Gaag, Preprocessing for triangulation of probabilistic networks, in: Morgan Kaufmann (Ed.), Uncertainty in Artificial Intelligence (UAI-01), 2001, pp. 32\u201339."},{"key":"10.1016\/j.ijar.2008.09.002_bib9","doi-asserted-by":"crossref","unstructured":"A. Cano, S. Moral, Heuristic algorithms for the triangulation of graphs, in: Information Processing and Management of Uncertainty in Knowledge-Based Systems, Par\u00eds, 1994, pp. 98\u2013107.","DOI":"10.1007\/BFb0035941"},{"key":"10.1016\/j.ijar.2008.09.002_bib10","series-title":"Expert Systems and Probabilistic Network Models","author":"Castillo","year":"1997"},{"key":"10.1016\/j.ijar.2008.09.002_bib11","doi-asserted-by":"crossref","unstructured":"A. Darwiche, M. Hopkins. Using recursive decomposition to construct elimination orders, jointrees, and dtrees, in: ECSQARU\u201901: Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Springer-Verlag, London, UK, 2001, pp. 180\u2013191.","DOI":"10.1007\/3-540-44652-4_17"},{"key":"10.1016\/j.ijar.2008.09.002_bib12","unstructured":"J.S. de Bonet, C.L. Isbell, P. Viola. MIMIC. Finding optima by estimating probability densities. in: Advances in Neural Information Processing Systems, vol. 9, 1997, pp. 424\u2013430."},{"issue":"11\u201313","key":"10.1016\/j.ijar.2008.09.002_bib13","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1016\/S0167-8655(99)00088-4","article-title":"Partial abductive inference in Bayesian belief networks using a genetic algorithm","volume":"20","author":"de Campos","year":"1999","journal-title":"Pattern Recognition Letters"},{"issue":"2","key":"10.1016\/j.ijar.2008.09.002_bib14","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/int.10079","article-title":"Triangulation of Bayesian networks by retriangulation","volume":"18","author":"Flores","year":"2003","journal-title":"International Journal of Intelligent Systems"},{"key":"10.1016\/j.ijar.2008.09.002_bib15","doi-asserted-by":"crossref","unstructured":"M.J. Flores, J.A. G\u00e1mez, Review on distinct methods and approaches to perform triangulation for Bayesian networks, Advances in Probabilistic Graphical Models, Studies in Fuzziness and Soft Computing, vol. 213, Springer-Verlag, 2007 (chapter A).","DOI":"10.1007\/978-3-540-68996-6_6"},{"issue":"1\u20133","key":"10.1016\/j.ijar.2008.09.002_bib16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0167-8655(01)00123-4","article-title":"Searching for the best elimination sequence in Bayesian networks by using ant colony based optimization","volume":"23","author":"G\u00e1mez","year":"2002","journal-title":"Pattern Recognition Letters"},{"key":"10.1016\/j.ijar.2008.09.002_bib17","first-page":"16","article-title":"Propagating uncertainty in Bayesian networks by probabilistic logic sampling","volume":"2","author":"Henrion","year":"1988"},{"key":"10.1016\/j.ijar.2008.09.002_bib18","series-title":"An Introduction to Bayesian Networks","author":"Jensen","year":"1996"},{"key":"10.1016\/j.ijar.2008.09.002_bib19","first-page":"269","article-title":"Bayesian updating in causal probablistic networks by local computations","volume":"4","author":"Jensen","year":"1990","journal-title":"In Computational Statistics Quaterly"},{"key":"10.1016\/j.ijar.2008.09.002_bib20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/j.ijar.2008.09.002_bib21","unstructured":"U. Kjaerulff, Triangulation of graphs \u2013 algorithms giving small total state space, Technical Report R90-09, Department of Computer Science, University of Aalborg, March 1990."},{"key":"10.1016\/j.ijar.2008.09.002_bib22","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01890544","article-title":"Optimal decomposition of probabilistic networks by simulated annealing","volume":"2","author":"Kjaerulff","year":"1992","journal-title":"Statistics and Computing"},{"key":"10.1016\/j.ijar.2008.09.002_bib23","unstructured":"P. Larra\u00f1aga, R. Etxeberria, J.A. Lozano, J.M. Pe\u00f1a, Combinatorial optimization by learning and simulation of Bayesian networks, in: Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, 2000, pp. 343\u2013352."},{"issue":"1","key":"10.1016\/j.ijar.2008.09.002_bib24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/A:1018553211613","article-title":"Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms","volume":"7","author":"Larra\u00f1aga","year":"1997","journal-title":"Statistics and Computing"},{"key":"10.1016\/j.ijar.2008.09.002_bib25","series-title":"Estimation of distribution algorithms","author":"Larra\u00f1aga","year":"2001"},{"issue":"2","key":"10.1016\/j.ijar.2008.09.002_bib26","first-page":"157","article-title":"Local computations with probabilities on graphical structures and their application on expert systems","volume":"50","author":"Lauritzen","year":"1988","journal-title":"Journal of the Royal Statistical Society B"},{"key":"10.1016\/j.ijar.2008.09.002_bib27","doi-asserted-by":"crossref","unstructured":"J.A. Lozano, P. Larra\u00f1aga, I. Inza, E. Bengoetxea, Towards a new evolutionary computation: advances on estimation of distribution algorithms, Studies in Fuzziness and Soft Computing, vol. 192, Springer-Verlag, 2006.","DOI":"10.1007\/3-540-32494-1"},{"key":"10.1016\/j.ijar.2008.09.002_bib28","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","article-title":"The equation for response to selection and its use for prediction","volume":"5","author":"M\u00fchlenbein","year":"1998","journal-title":"Evolutionary Computation"},{"key":"10.1016\/j.ijar.2008.09.002_bib29","series-title":"Metaheuristics: Theory and Applications","first-page":"53","article-title":"Gene pool recombination in genetic algorithms","author":"M\u00fchlenbein","year":"1996"},{"key":"10.1016\/j.ijar.2008.09.002_bib30","series-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl","year":"1988"},{"key":"10.1016\/j.ijar.2008.09.002_bib31","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1142\/S0218488504002588","article-title":"Unsupervised learning of Bayesian networks via estimation of distribution algorithms: an application to gene expression data clustering","volume":"12","author":"Pe\u00f1a","year":"2004","journal-title":"In International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"10.1016\/j.ijar.2008.09.002_bib32","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","article-title":"Graph minors XIII the disjoint paths problem","volume":"63","author":"Robertson","year":"1995","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.ijar.2008.09.002_bib33","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1142\/S0218001404003332","article-title":"Learning Bayesian networks in the space of orderings with estimation of distribution algorithms","volume":"18","author":"Romero","year":"2004","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"10.1016\/j.ijar.2008.09.002_bib34","first-page":"183","article-title":"A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations","author":"Rose","year":"1973","journal-title":"Graph Theory and Computing"},{"issue":"5","key":"10.1016\/j.ijar.2008.09.002_bib35","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/mnsc.35.5.527","article-title":"Gaussian influence diagrams","volume":"35","author":"Shachter","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/j.ijar.2008.09.002_bib36","unstructured":"W.X. Wen, Optimal decomposition of belief networks, in: Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence (UAI-90), Elsevier Science Inc., New York, NY, USA, 1990, pp. 209\u2013224."},{"key":"10.1016\/j.ijar.2008.09.002_bib37","doi-asserted-by":"crossref","unstructured":"S.K.M Wong, D. Wu, C.J. Butz. Triangulation of Bayesian networks: a relational database perspective, in: TSCTC\u201902: Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing, Springer-Verlag, London, UK, 2002, pp. 389\u2013396.","DOI":"10.1007\/3-540-45813-1_51"}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X08001606?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X08001606?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T19:15:06Z","timestamp":1656789306000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X08001606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["S0888613X08001606"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.ijar.2008.09.002","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}
