Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Searching for the best elimination sequence in Bayesian networks by using ant colony optimization

From MaRDI portal
Publication:2778119
Jump to:navigation, search

DOI10.1016/S0167-8655(01)00123-4zbMath1050.68136MaRDI QIDQ2778119

José A. Gámez, José M. Puerta

Publication date: 18 June 2002

Published in: Pattern Recognition Letters (Search for Journal in Brave)


zbMATH Keywords

junction treeprobabilistic expert system


Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)


Related Items (5)

Ant colony optimization for learning Bayesian networks. ⋮ Structural learning of Bayesian networks by bacterial foraging optimization ⋮ ACS-TS: Train scheduling using ant colony system ⋮ Ant search based control optimisation strategy for a class of chaotic system ⋮ Triangulation of Bayesian networks by retriangulation




This page was built for publication: Searching for the best elimination sequence in Bayesian networks by using ant colony optimization

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2778119&oldid=15663755"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 16:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki