To Örebro University

oru.seÖrebro University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Constraint-Based Querying for Bayesian Network Exploration
KU Leuven, Leuven, Belgium.
KU Leuven, Leuven, Belgium.
KU Leuven, Leuven, Belgium; Universiteit Leiden, Ca Leiden, The Netherlands.
KU Leuven, Leuven, Belgium.ORCID iD: 0000-0002-6860-6303
2015 (English)In: Advances in Intelligent Data Analysis XIV: 14th International Symposium, IDA 2015, Saint Etienne, France, October 22 -24, 2015. Proceedings / [ed] Elisa Fromont, Tilj De Bie, Matthijs van Leeuwen, Cham: Springer International Publishing , 2015, Vol. 9385, p. 13-24Conference paper, Published paper (Refereed)
Abstract [en]

Understanding the knowledge that resides in a Bayesian network can be hard, certainly when a large network is to be used for the first time, or when the network is complex or has just been updated. Tools to assist users in the analysis of Bayesian networks can help. In this paper, we introduce a novel general framework and tool for answering exploratory queries over Bayesian networks. The framework is inspired by queries from the constraint-based mining literature designed for the exploratory analysis of data. Adapted to Bayesian networks, these queries specify a set of constraints on explanations of interest, where an explanation is an assignment to a subset of variables in a network. Characteristic for the methodology is that it searches over different subsets of the explanations, corresponding to different marginalizations. A general purpose framework, based on principles of constraint programming, data mining and knowledge compilation, is used to answer all possible queries. This CP4BN framework employs a rich set of constraints and is able to emulate a range of existing queries from both the Bayesian network and the constraint-based data mining literature.

Place, publisher, year, edition, pages
Cham: Springer International Publishing , 2015. Vol. 9385, p. 13-24
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 9385
Keywords [en]
Bayesian Network Literature, Constraint Programming (CP), Exploratory Queries, Constraint-based Pattern Mining, Arithmetic Circuits
National Category
Cancer and Oncology
Identifiers
URN: urn:nbn:se:oru:diva-91640DOI: 10.1007/978-3-319-24465-5_2ISI: 000389228500002Scopus ID: 2-s2.0-84951994780ISBN: 978-3-319-24464-8 (print)ISBN: 978-3-319-24465-5 (electronic)OAI: oai:DiVA.org:oru-91640DiVA, id: diva2:1552806
Conference
14th International Symposium on Intelligent Data Analysis (IDA 2015), Saint Etienne, France, October 22-24, 2015
Available from: 2021-05-06 Created: 2021-05-06 Last updated: 2021-05-06Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

De Raedt, Luc

Search in DiVA

By author/editor
De Raedt, Luc
Cancer and Oncology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 121 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf