On approximating K-Most probable explanations of Bayesian networks using genetic algorithms
by Nalerk Sriwachirawat
Title: | On approximating K-Most probable explanations of Bayesian networks using genetic algorithms |
Author(s): | Nalerk Sriwachirawat |
Advisor: | Surapong Auwatanamongkol, advisor |
Degree name: | Master of Science |
Degree level: | Master's |
Degree discipline: | Computer Science |
Degree department: | School of Applied Statistics |
Degree grantor: | National Institute of Development Administration |
Issued date: | 2006 |
Publisher: | National Institute of Development Administration |
Description: |
Thesis (M.S. (Computer Science))--National Institute of Development Administration, 2006. |
Subject(s): | Genetic algorithms
Genetic programming (Computer science) Artificial intelligence |
Resource type: | Thesis |
Extent: | xiii, 117 leaves ; 30 cm. |
Type: | Text |
File type: | application/pdf |
Language: | eng |
Rights: | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. |
URI: | http://repository.nida.ac.th/handle/662723737/422 |
Files in this item (EXCERPT) |
|
| View |
Files in this item (CONTENT) |
|
| View |
This item appears in the following Collection(s) |
|
|