{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:50:21Z","timestamp":1762429821821,"version":"3.43.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Statistics and Computing"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1023\/a:1018553211613","type":"journal-article","created":{"date-parts":[[2003,2,6]],"date-time":"2003-02-06T18:01:37Z","timestamp":1044554497000},"page":"19-34","source":"Crossref","is-referenced-by-count":54,"title":["Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms"],"prefix":"10.1007","volume":"7","author":[{"given":"Pedro","family":"Larra\u00f1aga","sequence":"first","affiliation":[]},{"given":"Cindy M. H.","family":"Kuijpers","sequence":"additional","affiliation":[]},{"given":"Mikel","family":"Poza","sequence":"additional","affiliation":[]},{"given":"Roberto H.","family":"Murga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"173889_CR1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00203625","volume":"64","author":"W. Banzhaf","year":"1990","unstructured":"Banzhaf, W. (1990) The \u2018molecular\u2019 traveling salesman. Biological Cybernetics, 64, 7\u201314.","journal-title":"Biological Cybernetics"},{"key":"173889_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(93)90027-7","volume":"46","author":"U. K. Chakraborty","year":"1993","unstructured":"Chakraborty, U. K. and Dastidar, D. G. (1993) Using reliability analysis to estimate the number of generations to convergence in genetic algorithms. Information Processing Letters, 46, 199\u2013209.","journal-title":"Information Processing Letters"},{"key":"173889_CR3","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230200510","volume":"20","author":"R. M. Chavez","year":"1990","unstructured":"Chavez, R. M. and Cooper, G. F. (1990) A randomized approximation algorithm for probabilistic inference on Bayesian belief networks. Networks, 20, 661\u201385.","journal-title":"Networks"},{"key":"173889_CR4","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0004-3702(90)90060-D","volume":"42","author":"G. F. Cooper","year":"1990","unstructured":"Cooper, G. F. (1990) The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 42, 393\u2013405.","journal-title":"Artificial Intelligence"},{"key":"173889_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0004-3702(93)90036-B","volume":"60","author":"P. Dagum","year":"1993","unstructured":"Dagum, P. and Luby, M. (1993) Approximating probabilistic inference in Bayesian belief networks is NP-hard. Artificial Intelligence, 60, 141\u201353.","journal-title":"Artificial Intelligence"},{"key":"173889_CR6","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1002\/net.3230230506","volume":"23","author":"P. Dagum","year":"1993","unstructured":"Dagum, P. and Horvitz, E. (1993) A Bayesian analysis of simulation algorithms for inference in belief networks. Networks, 23, 499\u2013516.","journal-title":"Networks"},{"key":"173889_CR7","unstructured":"Davis, L. (1985) Applying adaptive algorithms to epistatic domains. In Proceedings International Joint Conference on Artificial Intelligence, Los Angeles, CA, pp. 162\u20134."},{"key":"173889_CR8","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"Davis, L. (1991) Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York."},{"key":"173889_CR9","unstructured":"De Jong, K. A. (1975) An analysis of the behaviour of a class of genetic adaptive systems. Ph.D. Dissertation, University of Michigan."},{"key":"173889_CR10","volume-title":"Global convergence of genetics algorithms: an infinite Markov chain analysis","author":"A. E. Eiben","year":"1990","unstructured":"Eiben, A. E., Aarts, E. H. L. and Van Hee, K. M. (1990) Global convergence of genetics algorithms: an infinite Markov chain analysis. Computing Science Notes, Eindhoven University of Technology, The Netherlands."},{"key":"173889_CR11","unstructured":"Fogel, D. B. (1990) A parallel processing approach to a multiple traveling salesman problem using evolutionary programming. In Proceedings of the Fourth Annual Parallel Processing Symposium, Fullerton, CA, pp. 318\u201326."},{"key":"173889_CR12","doi-asserted-by":"crossref","unstructured":"Fox B. R. and McMahon, M. B. (1991) Genetic operators for sequencing problems. In Foundations of Genetic Algorithms: First Workshop on the Foundations of Genetic Algorithms and Classifier Systems (G. Rawlins, ed.), pp. 284\u2013300. Morgan Kaufmann, Los Altos, CA.","DOI":"10.1016\/B978-0-08-050684-5.50021-5"},{"key":"173889_CR13","unstructured":"Fujisawa, T. and Orino, H. (1974) An efficient algorithm of finding a minimal triangulation of a graph. In IEEE International Symposium on Circuits and Systems, San Francisco, California, pp. 172\u20135."},{"key":"173889_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/B978-0-444-88738-2.50023-3","volume-title":"Uncertainty in Artificial Intelligence 5","author":"R. M. Fung","year":"1990","unstructured":"Fung, R. M. and Chang, K. C. (1990) Weighing and integrating evidence for stochastic simulation in Bayesian networks. In Uncertainty in Artificial Intelligence 5, (M. Henrion, R. D. Shachter, L. N. Kanal, and J. F. Lemmer, eds), pp. 209\u201320, Elsevier, Amsterdam."},{"key":"173889_CR15","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. E. Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA."},{"key":"173889_CR16","unstructured":"Goldberg, D. E. and Lingle, Jr. R. (1985) Alleles, loci and the traveling salesman problem. In Proceedings of an International Conference on Genetic Algorithms and Their Applications, Pittsburgh, PA, pp. 154\u20139."},{"key":"173889_CR17","unstructured":"Grefenstette, J., Gopal, R., Rosmaita, B. and Van Gucht, D. (1985) Genetic algorithms for the traveling salesman problem. In Proceedings of an International Conference on Genetic Algorithms and Their Applications, Pittsburgh, PA, pp. 160\u20135."},{"key":"173889_CR18","doi-asserted-by":"crossref","unstructured":"Henrion, M. (1988) Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In Uncertainty in Artificial Intelligence 2, (J. F. Lemmer and L. N. Kanal, eds), pp. 149\u201363, North-Holland, Amsterdam.","DOI":"10.1016\/B978-0-444-70396-5.50019-4"},{"key":"173889_CR19","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"Holland, J. (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor."},{"key":"173889_CR20","volume-title":"A new approach on the traveling salesman problem by genetic algorithm","author":"A. Homaifar","year":"1991","unstructured":"Homaifar, A. and Guan, S. (1991) A new approach on the traveling salesman problem by genetic algorithm. Technical Report, North Carolina A & T State University."},{"key":"173889_CR21","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0004-3702(90)90020-Z","volume":"46","author":"T. Hryceij","year":"1990","unstructured":"Hryceij, T. (1990) Gibbs sampling in Bayesian networks. Artificial Intelligence, 46, 351\u201363.","journal-title":"Artificial Intelligence"},{"key":"173889_CR22","series-title":"Technical Report","volume-title":"Implementation aspects of various propagation algorithms in Hugin","author":"F. Jensen","year":"1994","unstructured":"Jensen, F. (1994) Implementation aspects of various propagation algorithms in Hugin. Technical Report R 94\u20132014, University of Aalborg, Denmark."},{"key":"173889_CR23","volume-title":"An Introduction to Bayesian Networks","author":"F. V. Jensen","year":"1996","unstructured":"Jensen, F. V. (1996) An Introduction to Bayesian Networks. UCL Press, London."},{"key":"173889_CR24","series-title":"Technical Report","volume-title":"Blocking Gibbs sampling in very large probabilistic expert systems","author":"C. S. Jensen","year":"1993","unstructured":"Jensen, C. S., Kong, A. and Kj\u00e6rulff, U. (1993) Blocking Gibbs sampling in very large probabilistic expert systems. Technical Report R 93\u20132031, University of Aalborg, Denmark."},{"key":"173889_CR25","unstructured":"Jog, P., Suh, J. Y. and Van Gucht, D. (1989) The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. In Proceedings on the Third International Conference on Genetic Algorithms, Arlington, VA, pp. 110\u201315."},{"key":"173889_CR26","series-title":"Technical Report","volume-title":"Triangulation of graphs-Algorithms giving small total state space","author":"U. Kj\u00e6rulff","year":"1990","unstructured":"Kj\u00e6rulff, U. (1990) Triangulation of graphs-Algorithms giving small total state space. Technical Report R 90\u201309, University of Aalborg, Denmark."},{"key":"173889_CR27","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01890544","volume":"2","author":"U. Kj\u00e6rulff","year":"1992","unstructured":"Kj\u00e6rulff, U. (1992) Optimal decomposition of probabilistic networks by simulated annealing. Statistics and Computing, 2, 7\u201317.","journal-title":"Statistics and Computing"},{"key":"173889_CR28","doi-asserted-by":"crossref","unstructured":"Larra\u00f1aga, P., Gra\u00f1a, M., D'Anjou, A. and Torrealdea, F. J. (1993) Genetics algorithms elitist probabilistic of degree 1, a generalization of simulated annealing. In Proceedings of the Third Congress of the Italian Association for Artificial Intelligence, IA*AI '93, Torino, Italy, pp. 208\u201317.","DOI":"10.1007\/3-540-57292-9_59"},{"key":"173889_CR29","series-title":"Internal Report","volume-title":"Optimal decomposition of Bayesian networks by genetic algorithms","author":"P. Larra\u00f1aga","year":"1994","unstructured":"Larra\u00f1aga, P., Kuijpers, C. M. H., Poza, M. and Murga, R. H. (1994) Optimal decomposition of Bayesian networks by genetic algorithms. Internal Report EHU-KZAA-IKT\u20133\u201394, University of the Basque Country, Spain."},{"issue":"4","key":"173889_CR30","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1109\/3468.508827","volume":"26","author":"P. Larra\u00f1aga","year":"1996","unstructured":"Larra\u00f1aga, P., Kuijpers, C. M. H., Murga, R. H. and Yurramendi, Y. (1996a) Learning Bayesian network structures by searching for the best ordering with genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics. Vol. 26, No. 4, pp. 487\u201393.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"173889_CR31","doi-asserted-by":"crossref","unstructured":"Larra\u00f1aga, P., Poza, M., Yurramendi, Y., Murga, R. H., and Kuijpers, C. M. H. (1996b) Structure learning of Bayesian network by genetic algorithms: a performance analysis of control parameters. IEEE Transactions on Pattern Analysis and Machine Intelligence (to appear).","DOI":"10.1109\/34.537345"},{"key":"173889_CR32","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-1-4612-2404-4_16","volume-title":"Learning from Data: Artificial Intelligence and Statistics V","author":"P. Larra\u00f1aga","year":"1996","unstructured":"Larra\u00f1aga, P., Murga, R. H., Poza, M. and Kuijpers, C. M. H. (1996c) Structure learning of Bayesian networks by hybrid genetic algorithms. In Learning from Data: Artificial Intelligence and Statistics V, (D. Fisher and H. Lenz, eds), Springer-Verlag, New York, pp. 165\u201374."},{"key":"173889_CR33","unstructured":"Larra\u00f1aga, P., Kuijpers, C. M. H. and Murga, R. H. (1996d) >Evolutionary algorithms for the travelling salesman problem: A review of representations and operators. Artificial Intelligence Review (to appear)."},{"key":"173889_CR34","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S. L. Lauritzen","year":"1988","unstructured":"Lauritzen, S. L. and Spiegelhalter, D. J. (1988) Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B, 50, 157\u2013224.","journal-title":"Journal of the Royal Statistical Society"},{"key":"173889_CR35","unstructured":"Lidd, M. L. (1991) The traveling salesman problem domain application of a fundamentally new approach to utilizing genetic algorithms. Technical Report, MITRE Corporation."},{"key":"173889_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z. Michalewicz","year":"1992","unstructured":"Michalewicz, Z. (1992) Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin."},{"key":"173889_CR37","unstructured":"M\u00fchlenbein, H. (1989) Parallel genetic algorithms, population genetics and combinatorial optimization. In Proceedings on the Third International Conference on Genetic Algorithms, Arlington, VA, pp. 416\u201321."},{"key":"173889_CR38","volume-title":"Probabilistic Reasoning in Expert Systems, Theory and Algorithms","author":"R. E. Neapolitan","year":"1990","unstructured":"Neapolitan, R. E. (1990) Probabilistic Reasoning in Expert Systems, Theory and Algorithms. Wiley, New York."},{"key":"173889_CR39","first-page":"224","volume-title":"Genetic Algorithms and Their Applications: Proceedings of the Second International Conference","author":"I. M. Oliver","year":"1987","unstructured":"Oliver, I. M., Smith, D. J. and Holland, J. R. C. (1987) A study of permutation crossover operators on the TSP. In Genetic Algorithms and Their Applications: Proceedings of the Second International Conference, Cambridge, MA, pp. 224\u201330."},{"key":"173889_CR40","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(86)90072-X","volume":"29","author":"J. Pearl","year":"1986","unstructured":"Pearl, J. (1986) Fusion, propagation, and structuring in belief networks. Artificial Intelligence, 29, 241\u201388.","journal-title":"Artificial Intelligence"},{"key":"173889_CR41","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0004-3702(87)90012-9","volume":"32","author":"J. Pearl","year":"1987","unstructured":"Pearl, J. (1987) Evidential reasoning using stochastic simulation of causal models. Artificial Intelligence, 32, 245\u201357.","journal-title":"Artificial Intelligence"},{"key":"173889_CR42","volume-title":"Probabilistic Reasoning in Intelligent Systems","author":"J. Pearl","year":"1988","unstructured":"Pearl, J. (1988) Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, Palo Alto, CA."},{"key":"173889_CR43","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. J. Rose","year":"1976","unstructured":"Rose, D. J., Tarjan, R. E. and Lueker, G. S. (1976) Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5, 266\u201383.","journal-title":"SIAM Journal on Computing"},{"key":"173889_CR44","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G. Rudolph","year":"1994","unstructured":"Rudolph, G. (1994) Convergence analysis of canonical genetic algorithms. IEEETransactions on Neural Networks, 5, 96\u2013101.","journal-title":"IEEETransactions on Neural Networks"},{"key":"173889_CR45","unstructured":"Seniw, D. (1991) A genetic algorithm for the traveling salesman problem. M.Sc. Thesis, University of North Carolina at Charlotte."},{"key":"173889_CR46","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1287\/opre.36.4.589","volume":"36","author":"R. D. Shachter","year":"1988","unstructured":"Shachter, R. D. (1988) Probabilistic inference and influence diagrams. Operations Research, 36, 589\u2013604.","journal-title":"Operations Research"},{"key":"173889_CR47","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/B978-0-444-88738-2.50024-5","volume-title":"Uncertainty in Artificial Intelligence 5","author":"R. D. Shachter","year":"1990","unstructured":"Shachter, R. D. and Peot, M. A. (1990) Simulation approaches to general probabilistic inference on belief networks. In Uncertainty in Artificial Intelligence 5 (M. Henrion, R. D. Shachter, L. N. Kanal and J. F. Lemmer, eds), pp. 221\u201334. Elsevier, Amsterdam."},{"key":"173889_CR48","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/0010-4809(91)90020-W","volume":"24","author":"M. Shwe","year":"1991","unstructured":"Shwe, M. and Cooper, G. (1991) An empirical analysis of likelihood-weighting simulation on a large, multiply connected medical belief network. Computers and Biomedical Research, 24, 453\u201375.","journal-title":"Computers and Biomedical Research"},{"key":"173889_CR49","unstructured":"Suh, J. Y. and Van Gucht, D. (1987) Incorporating heuristic information into genetic search. In Genetic Algorithms and Their Applications: Proceedings of the Second International Conference, Cambridge, MA, pp. 100\u20137."},{"key":"173889_CR50","first-page":"332","volume-title":"Handbook of Genetic Algorithms","author":"G. Syswerda","year":"1991","unstructured":"Syswerda, G. (1991) Schedule optimization using genetic algorithms. In Handbook of Genetic Algorithms, (L. Davis, ed.), pp. 332\u201349. Van Nostrand Reinhold, New York."},{"key":"173889_CR51","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. E. Tarjan","year":"1984","unstructured":"Tarjan, R. E. and Yannakakis, M. (1984) Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13, 566\u201379.","journal-title":"SIAM Journal on Computing"},{"key":"173889_CR52","first-page":"103","volume-title":"Proceedings of the Australian 1990 Joint Conference on Artificial Intelligence","author":"W. X. Wen","year":"1990","unstructured":"Wen, W. X. (1990) Decomposing belief networks by simulated annealing. In (C. P. Tsang, ed.) Proceedings of the Australian 1990 Joint Conference on Artificial Intelligence, pp. 103\u201318. World Scientific Publishers, Perth, WA."},{"key":"173889_CR53","unstructured":"Wen, W. X. (1991) Optimal decomposition of belief networks. In Uncertainty in Artificial Intelligence 6 (P. P. Bonissone, M. Henrion, L. N. Kanal, and J. F. Lemmer, eds), pp. 209\u201324. North-Holland, Amsterdam."},{"key":"173889_CR54","unstructured":"Whitley, D. (1989) The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In Proceedings on the Third International Conference on Genetic Algorithms, Arlington, VA, pp. 116\u201321."},{"key":"173889_CR55","unstructured":"Whitley D. and Hanson, T. (1987) Optimizing neural networks using faster, more accurate genetic search. In Genetic Algorithms and Their Applications: Proceedings of the Second International Conference, Cambridge, MA, pp. 391\u20136."},{"key":"173889_CR56","unstructured":"Whitley, D., Starkweather, T. and Fuquay, D. (1989) Scheduling problems and travelling salesman: The genetic edge recombination operator. In Proceedings on the Third International Conference on Genetic Algorithms, Arlington, VA, pp. 133\u201340."},{"key":"173889_CR57","first-page":"350","volume-title":"Handbook of Genetic Algorithms","author":"D. Whitley","year":"1991","unstructured":"Whitley, D., Starkweather, T. and Shaner, D. (1991) The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination. In Handbook of Genetic Algorithms (L. Davis, ed), pp. 350\u201372. Van Nostrand Reinhold, New York."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018553211613.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018553211613\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018553211613.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:24:38Z","timestamp":1754630678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018553211613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["173889"],"URL":"https:\/\/doi.org\/10.1023\/a:1018553211613","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}