On approximating K-Most probable explanations of Bayesian networks using genetic algorithms

Files
nida-ths-b150085.pdf(16.8 MB)
Publisher
National Institute of Development Administration
Issued Date
2006
Available Date
Copyright Date
Resource Type
Thesis
Series
Edition
Language
eng
File Type
application/pdf
No. of Pages/File Size
xiii, 117 leaves ; 30 cm.
ISBN
ISSN
eISSN
DOI
Other identifier(s)
Identifier(s)
Access Rights
Access Status
Rights
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Rights Holder(s)
Physical Location
National Institute of Development Administration. Library and Information Center
Bibliographic Citation
Citation
Nalerk Sriwachirawat (2006). On approximating K-Most probable explanations of Bayesian networks using genetic algorithms. Retrieved from: http://repository.nida.ac.th/handle/662723737/422.
Title
On approximating K-Most probable explanations of Bayesian networks using genetic algorithms
Alternative Title(s)
Author(s)
Nalerk Sriwachirawat
Editor(s)
Advisor(s)
Advisor's email
Contributor(s)
Contributor(s)
Abstract
Table of contents
Description
Thesis (M.S. (Computer Science))--National Institute of Development Administration, 2006.
Description
Sponsorship
Degree Name
Master of Science
Degree Level
Masters
Degree Department
School of Applied Statistics
Degree Discipline
Computer Science
Degree Grantor(s)
National Institute of Development Administration
Classification
LCC
QA 76.623 N147 2006
Subject(s)
Genetic algorithms
 Genetic programming (Computer science)
 Artificial intelligence
Keyword(s)
View online Resources
URI
http://repository.nida.ac.th/handle/662723737/422
Collections
GSAS: Theses