{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:44:14Z","timestamp":1760597054113,"version":"3.30.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0167-8655(01)00123-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T23:55:37Z","timestamp":1034639737000},"page":"261-277","source":"Crossref","is-referenced-by-count":33,"title":["Searching for the best elimination sequence in Bayesian networks by using ant colony optimization"],"prefix":"10.1016","volume":"23","author":[{"given":"Jos\u00e9 A.","family":"G\u00e1mez","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 M.","family":"Puerta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8655(01)00123-4_BIB1","series-title":"Proc. 11th Internat. Joint Conf. on Artificial Intelligence, Detroit","first-page":"1080","article-title":"Hugin: a shell for building belief universes for expert systems","author":"Andersen","year":"1989"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB2","series-title":"Proc. 12th Conf. on Uncertainty in Artificial Intelligence","first-page":"81","article-title":"A sufficiently fast algorithm for finding close to optimal junction trees","author":"Becker","year":"1996"},{"year":"1999","series-title":"Swarm Intelligence: From Natural to Artificial Systems","author":"Bonabeau","key":"10.1016\/S0167-8655(01)00123-4_BIB3"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB4","first-page":"166","article-title":"Heuristic algorithms for the triangulation of graphs","volume":"Vol. 1","author":"Cano","year":"1994"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB5","unstructured":"Casillas, J., Cord\u00f3n, O., Herrera, F., 2000. Learning cooperative fuzzy linguistic rules using ant colony optimization algorithms. Technical report #DECSAI-00-01-19, Departamento de Ciencias de la Computaci\u00f3n e Inteligencia Artificial, Universidad de Granada"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB6","series-title":"Monographs in Computer Science","article-title":"Expert systems and probabilistic network models","author":"Castillo","year":"1997"},{"issue":"11\u201313","key":"10.1016\/S0167-8655(01)00123-4_BIB7","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 Lett."},{"key":"10.1016\/S0167-8655(01)00123-4_BIB8","first-page":"1270","article-title":"On the problem of performing exact partial abductive inference in Bayesian belief networks using junction trees","volume":"Vol. 3","author":"de Campos","year":"2000"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB9","unstructured":"Dorigo, M., 1992. Optimization, learning and natural algorithms. Ph.D. thesis, Politecnico di Milano, Italy (in Italian)"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB10","series-title":"New Ideas in Optimization","article-title":"The ant colony optimization meta-heuristic","author":"Dorigo","year":"1999"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","article-title":"Ant algorithms for discrete optimization","volume":"5","author":"Dorigo","year":"1999","journal-title":"Art. Life"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: a cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/S0167-8655(01)00123-4_BIB13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"The ant system: optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Trans. Systems Man Cybernet. B"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB14","series-title":"IEEE Internat. Symposium on Circuits and Systems, San Francisco, CA","first-page":"172","article-title":"An efficient algorithm of finding a minimal triangulation of a graph","author":"Fujisawa","year":"1974"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB15","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1016\/0167-8655(95)00046-J","article-title":"Abductive reasoning in Bayesian belief networks using a genetic algorithm","volume":"16","author":"Gelsema","year":"1995","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(01)00123-4_BIB16","unstructured":"Hern\u00e1ndez, L., 1995. Dise\u00f1o y validaci\u00f3n de nuevos algoritmos para el tratamiento de grafos de dependencias. Ph.D. thesis, Departamento de Ciencias de la Computaci\u00f3n e Inteligencia Artificial, Universidad de Granada"},{"year":"1996","series-title":"An Introduction to Bayesian Networks","author":"Jensen","key":"10.1016\/S0167-8655(01)00123-4_BIB17"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB18","unstructured":"Kj\u00e6rulff, U., 1990. Triangulation of graphs \u2013 algorithms giving small total space. Technical report R 90-09, Department of Mathematics and Computer Science, Institute of Electronic Systems, Aalborg University"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB19","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01890544","article-title":"Optimal decomposition of probabilistic networks by simulated annealing","volume":"2","author":"Kj\u00e6rulff","year":"1992","journal-title":"Statist. Comput."},{"key":"10.1016\/S0167-8655(01)00123-4_BIB20","first-page":"462","article-title":"Moral graph, triangulation of","volume":"Update Vol. 3","author":"Larra\u00f1aga","year":"1999"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB21","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":"Statist. Comput."},{"issue":"2","key":"10.1016\/S0167-8655(01)00123-4_BIB22","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","article-title":"Local computations with probabilities on graphical structures and their application to expert systems","volume":"50","author":"Lauritzen","year":"1988","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"year":"1992","series-title":"Genetic Algorithms+Data Structures=Evolution Programs","author":"Michalewicz","key":"10.1016\/S0167-8655(01)00123-4_BIB23"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB24","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1008990218483","article-title":"An efficient algorithm for finding the M most probable configurations in Bayesian networks","volume":"2","author":"Nilsson","year":"1998","journal-title":"Statist. Comput."},{"key":"10.1016\/S0167-8655(01)00123-4_BIB25","unstructured":"Olesen, K.G., Madsen, A.L., 1999. Maximal prime subgraph decomposition of Bayesian networks. Technical report R-99-5006, Department of Computer Science, Aalborg University"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB26","series-title":"Genetic Algorithms and their Applications: Proc. Second Internat. Conf., Cambridge, MA","first-page":"224","article-title":"A study of permutation crossover operators on the TSP","author":"Oliver","year":"1987"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB27","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(86)90072-X","article-title":"Fusion, propagation and structuring in belief networks","volume":"29","author":"Pearl","year":"1986","journal-title":"Art. Intell."},{"key":"10.1016\/S0167-8655(01)00123-4_BIB28","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0004-3702(87)90034-8","article-title":"Distributed revision of composite beliefs","volume":"33","author":"Pearl","year":"1987","journal-title":"Art. Intell."},{"year":"1988","series-title":"Probabilistic Reasoning in Intelligent Systems","author":"Pearl","key":"10.1016\/S0167-8655(01)00123-4_BIB29"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB30","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-8655(01)00123-4_BIB31","first-page":"169","article-title":"Axioms for probability and belief-function propagation","volume":"Vol. 4","author":"Shenoy","year":"1990"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB32","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-8655(01)00123-4_BIB33","series-title":"Proc. Australian 1990 Joint Conf. on Artificial Intelligence","first-page":"103","article-title":"Decomposing belief networks by simulated annealing","author":"Wen","year":"1990"},{"key":"10.1016\/S0167-8655(01)00123-4_BIB34","first-page":"209","article-title":"Optimal decomposition of belief networks","volume":"Vol. 6","author":"Wen","year":"1991"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865501001234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865501001234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T13:47:54Z","timestamp":1733233674000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865501001234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":34,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0167865501001234"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(01)00123-4","relation":{},"ISSN":["0167-8655"],"issn-type":[{"type":"print","value":"0167-8655"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}