default search action
Marcel Gehrke
Person information
- affiliation (PhD 2022): University of Lübeck, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Magnus Bender
, Tanya Braun
Unsupervised Estimation of Subjective Content Descriptions in an Information System. Int. J. Semantic Comput. 18(1): 51-75 (2024) - [c34]Malte Luttermann, Tanya Braun, Ralf Möller, Marcel Gehrke:
Colour Passing Revisited: Lifted Model Construction with Commutative Factors. AAAI 2024: 20500-20507 - [c33]Malte Luttermann, Mattis Hartwig, Tanya Braun, Ralf Möller, Marcel Gehrke:
Lifted Causal Inference in Relational Domains. CLeaR 2024: 827-842 - [c32]Malte Luttermann, Johann Machemer, Marcel Gehrke:
Efficient Detection of Exchangeable Factors in Factor Graphs. FLAIRS 2024 - [c31]Magnus Bender
ReFrESH - Relation-preserving Feedback-reliant Enhancement of Subjective Content Descriptions. ICSC 2024: 17-24 - [i11]Malte Luttermann, Johann Machemer, Marcel Gehrke:
Efficient Detection of Exchangeable Factors in Factor Graphs. CoRR abs/2403.10167 (2024) - [i10]Malte Luttermann, Mattis Hartwig, Tanya Braun, Ralf Möller, Marcel Gehrke:
Lifted Causal Inference in Relational Domains. CoRR abs/2403.10184 (2024) - [i9]Magnus Bender, Tanya Braun, Ralf Möller, Marcel Gehrke:
Enhancement of Subjective Content Descriptions by using Human Feedback. CoRR abs/2405.15786 (2024) - [i8]Malte Luttermann, Ralf Möller, Marcel Gehrke:
Lifting Factor Graphs with Some Unknown Factors. CoRR abs/2406.01275 (2024) - [i7]Malte Luttermann, Johann Machemer, Marcel Gehrke:
Efficient Detection of Commutative Factors in Factor Graphs. CoRR abs/2407.16280 (2024) - 2023
- [c30]Magnus Bender
FrESH - Feedback-reliant Enhancement of Subjective Content Descriptions by Humans. CHAI@KI 2023: 15-24 - [c29]Nadja Redzuan, Ralf Möller, Marcel Gehrke, Tanya Braun:
On Domain-specific Topic Modelling Using the Case of a Humanities Journal. CHAI@KI 2023: 25-37 - [c28]Florian Andreas Marwitz
PETS: Predicting Efficiently Using Temporal Symmetries in Temporal PGMs. ECSQARU 2023: 322-333 - [c27]Malte Luttermann
Lifting Factor Graphs with Some Unknown Factors. ECSQARU 2023: 337-347 - [c26]Magnus Bender
LESS is More: LEan Computing for Selective Summaries. KI 2023: 1-14 - [c25]Magnus Bender
Unsupervised Estimation of Subjective Content Descriptions. ICSC 2023: 266-273 - [i6]Yara Schütt, Johannes Liebenow, Tanya Braun, Marcel Gehrke, Florian Thaeter, Esfandiar Mohammadi:
DPM: Clustering Sensitive Data through Separation. CoRR abs/2307.02969 (2023) - [i5]Malte Luttermann, Tanya Braun, Ralf Möller, Marcel Gehrke:
Colour Passing Revisited: Lifted Model Construction with Commutative Factors. CoRR abs/2309.11236 (2023) - 2022
- [b1]Marcel Gehrke:
Taming exact inference in temporal probabilistic relational models. University of Lübeck, Germany, 2022 - [c24]Tanya Braun
Explainable and Explorable Decision Support. ICCS 2022: 99-114 - [c23]Marcel Gehrke, Ralf Möller, Tanya Braun:
Who did it? Identifying the Most Likely Origins of Events. PGM 2022: 217-228 - [c22]Tanya Braun, Marcel Gehrke, Florian Lau, Ralf Möller:
Lifting in multi-agent systems under uncertainty. UAI 2022: 233-243 - 2021
- [j1]Magnus Bender
Identifying and Translating Subjective Content Descriptions Among Texts. Int. J. Semantic Comput. 15(4): 461-485 (2021) - [c21]Nils Finke, Tanya Braun, Marcel Gehrke
Dynamic Domain Sizes in Temporal Probabilistic Relational Models. FLAIRS 2021 - [c20]Nils Finke, Tanya Braun, Marcel Gehrke
Concept Drift Detection in Dynamic Probabilistic Relational Models. FLAIRS 2021 - [c19]Magnus Bender
Identifying Subjective Content Descriptions among Texts. ICSC 2021: 9-16 - [e1]Tanya Braun
Graph-Based Representation and Reasoning - 26th International Conference on Conceptual Structures, ICCS 2021, Virtual Event, September 20-22, 2021, Proceedings. Lecture Notes in Computer Science 12879, Springer 2021, ISBN 978-3-030-86981-6 [contents] - [i4]Marcel Gehrke:
On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm. CoRR abs/2110.09197 (2021) - 2020
- [c18]Marcel Gehrke
Taming Reasoning in Temporal Probabilistic Relational Models. ECAI 2020: 2592-2599 - [c17]Stefan Lüdtke, Marcel Gehrke
Lifted Marginal Filtering for Asymmetric Models by Clustering-Based Merging. ECAI 2020: 2608-2615 - [c16]Marcel Gehrke
Restricting the Maximum Number of Actions for Decision Support Under Uncertainty. ICCS 2020: 145-160 - [c15]Nils Finke, Marcel Gehrke, Tanya Braun, Tristan Potten, Ralf Möller:
Investigating Matureness of Probabilistic Graphical Models for Dry-Bulk Shipping. PGM 2020: 197-208
2010 – 2019
- 2019
- [c14]Marcel Gehrke
Uncertain Evidence for Probabilistic Relational Models. Canadian AI 2019: 80-93 - [c13]Marcel Gehrke
Lifted Temporal Maximum Expected Utility. Canadian AI 2019: 380-386 - [c12]Marcel Gehrke
Efficient Multiple Query Answering in Switched Probabilistic Relational Models. Australasian Conference on Artificial Intelligence 2019: 104-116 - [c11]Marcel Gehrke, Tanya Braun, Ralf Möller:
Relational Forward Backward Algorithm for Multiple Queries. FLAIRS 2019: 464-469 - [c10]Marcel Gehrke
Which Patient to Treat Next? Probabilistic Stream-Based Reasoning for Decision Support and Monitoring. ICBK 2019: 73-80 - [c9]Mattis Hartwig, Marcel Gehrke
Approximate Query Answering in Complex Gaussian Mixture Models. ICBK 2019: 81-86 - [c8]Marcel Gehrke
Lifted Temporal Most Probable Explanation. ICCS 2019: 72-85 - [i3]Marcel Gehrke, Ralf Möller, Tanya Braun:
Taming Reasoning in Temporal Probabilistic Relational Models. CoRR abs/1911.07040 (2019) - 2018
- [c7]Marcel Gehrke
Answering Multiple Conjunctive Queries with the Lifted Dynamic Junction Tree Algorithm. Australasian Conference on Artificial Intelligence 2018: 543-555 - [c6]Marcel Gehrke
Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm. Australasian Conference on Artificial Intelligence 2018: 556-562 - [c5]Simon Schiff, Marcel Gehrke
Efficient Enriching of Synthesized Relational Patient Data with Time Series Data. EUSPN/ICTH 2018: 531-538 - [c4]Marcel Gehrke
Lifted Dynamic Junction Tree Algorithm. ICCS 2018: 55-69 - [c3]Marcel Gehrke, Tanya Braun, Ralf Möller, Alexander Waschkau, Christoph Strumann, Jost Steinhäuser:
Towards lifted maximum expected utility. AIH@IJCAI 2018: 93-96 - [c2]Marcel Gehrke
Lifted Maximum Expected Utility. AIH@IJCAI (Revised Selected Papers) 2018: 131-141 - [c1]Marcel Gehrke
Towards Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm. KI 2018: 38-45 - [i2]Marcel Gehrke, Tanya Braun, Ralf Möller:
Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm. CoRR abs/1807.00744 (2018) - [i1]Marcel Gehrke, Tanya Braun, Ralf Möller:
Answering Hindsight Queries with Lifted Dynamic Junction Trees. CoRR abs/1807.01586 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-30 20:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: