{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81946"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81946","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Efficient Bayesian Network Inference: Genetic Algorithms, Stochastic Local Search, and Abstraction","abstract":"Two major research results are presented that relate to creating hard synthetic Bayesian networks for empirical research on inference algorithms. One method translates deceptive problems studied in genetic algorithms to a Bayesian network setting, showing that Bayesian networks can be deceptive. The other result is based on translating satisfiability problems into Bayesian networks. We describe how connectivity, value of conditional probability tables as well as the degree of regularity of the underlying graph affect the speed of inference for Hugin and Stochastic Greedy Search.","abstract_html":"Two major research results are presented that relate to creating hard synthetic Bayesian networks for empirical research on inference algorithms. One method translates deceptive problems studied in genetic algorithms to a Bayesian network setting, showing that Bayesian networks can be deceptive. The other result is based on translating satisfiability problems into Bayesian networks. We describe how connectivity, value of conditional probability tables as well as the degree of regularity of the underlying graph affect the speed of inference for Hugin and Stochastic Greedy Search.","abstract_has_math":false,"creators":["Mengshoel, Ole Jakob"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Wilkins, David C."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:21:08Z","date_published":"2015-09-25T20:21:08Z","updated_at":"2026-07-22T22:26:17Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI9944937"],"render_values":[{"text":"(MiAaPQ)AAI9944937","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81946","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Wilkins, David C."]},{"key":"dc:creator","label":"Author","values":["Mengshoel, Ole Jakob"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:21:08Z","10000-01-01","1999"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81946","(MiAaPQ)AAI9944937"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Two major research results are presented that relate to creating hard synthetic Bayesian networks for empirical research on inference algorithms. One method translates deceptive problems studied in genetic algorithms to a Bayesian network setting, showing that Bayesian networks can be deceptive. The other result is based on translating satisfiability problems into Bayesian networks. We describe how connectivity, value of conditional probability tables as well as the degree of regularity of the underlying graph affect the speed of inference for Hugin and Stochastic Greedy Search.","Made available in DSpace on 2015-09-25T20:21:08Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9944937.pdf: 10062763 bytes, checksum: 942c1eea2f44bef2ddee12ec416d422b (MD5) Previous issue date: 1999","Embargo set by: Seth Robbins for item 83227 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","210 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999."]},{"key":"dc:title","label":"Title","values":["Efficient Bayesian Network Inference: Genetic Algorithms, Stochastic Local Search, and Abstraction"]}]}],"canonical_facts":{"dc:contributor":["Wilkins, David C."],"dc:creator":["Mengshoel, Ole Jakob"],"dc:date":["2015-09-25T20:21:08Z","10000-01-01","1999"],"dc:description":["Two major research results are presented that relate to creating hard synthetic Bayesian networks for empirical research on inference algorithms. One method translates deceptive problems studied in genetic algorithms to a Bayesian network setting, showing that Bayesian networks can be deceptive. The other result is based on translating satisfiability problems into Bayesian networks. We describe how connectivity, value of conditional probability tables as well as the degree of regularity of the underlying graph affect the speed of inference for Hugin and Stochastic Greedy Search.","Made available in DSpace on 2015-09-25T20:21:08Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9944937.pdf: 10062763 bytes, checksum: 942c1eea2f44bef2ddee12ec416d422b (MD5) Previous issue date: 1999","Embargo set by: Seth Robbins for item 83227 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","210 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999."],"dc:identifier":["http://hdl.handle.net/2142/81946","(MiAaPQ)AAI9944937"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Efficient Bayesian Network Inference: Genetic Algorithms, Stochastic Local Search, and Abstraction"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:17Z"}