Discovering Causal Graphs with Cycles and Latent Confounders: An Exact Branch-and-Bound Approach

Show simple item record

dc.contributor.author Rantanen, Kari
dc.contributor.author Hyttinen, Antti
dc.contributor.author Järvisalo, Matti
dc.date.accessioned 2021-11-17T22:39:54Z
dc.date.available 2021-12-18T03:45:25Z
dc.date.issued 2020-02
dc.identifier.citation Rantanen , K , Hyttinen , A & Järvisalo , M 2020 , ' Discovering Causal Graphs with Cycles and Latent Confounders: An Exact Branch-and-Bound Approach ' , International Journal of Approximate Reasoning , vol. 117 , pp. 29-49 . https://doi.org/10.1016/j.ijar.2019.10.009
dc.identifier.other PURE: 129106888
dc.identifier.other PURE UUID: 1a81eadb-4af7-4dfd-aa4f-c5a5d9b49f3d
dc.identifier.other WOS: 000508760400003
dc.identifier.other ORCID: /0000-0003-2572-063X/work/70947195
dc.identifier.uri http://hdl.handle.net/10138/336471
dc.format.extent 21
dc.language.iso eng
dc.relation.ispartof International Journal of Approximate Reasoning
dc.rights cc_by_nc_nd
dc.rights.uri info:eu-repo/semantics/openAccess
dc.subject 113 Computer and information sciences
dc.title Discovering Causal Graphs with Cycles and Latent Confounders: An Exact Branch-and-Bound Approach en
dc.type Article
dc.contributor.organization Department of Computer Science
dc.contributor.organization Helsinki Institute for Information Technology
dc.contributor.organization Constraint Reasoning and Optimization research group / Matti Järvisalo
dc.description.reviewstatus Peer reviewed
dc.relation.doi https://doi.org/10.1016/j.ijar.2019.10.009
dc.relation.issn 0888-613X
dc.rights.accesslevel openAccess
dc.type.version acceptedVersion

Files in this item

Total number of downloads: Loading...

Files Size Format View
paper.pdf 563.3Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record