default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTue Herlau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c13]Tue Herlau, Rasmus Larsen
:
Reinforcement Learning of Causal Variables Using Mediation Analysis. AAAI 2022: 6910-6917- [c12]Tue Herlau, Mikkel N. Schmidt, Morten Mørup:
Bayesian dropout. ANT/EDI40 2022: 771-776 - [c11]Tue Herlau:
Active learning of causal probability trees. ICMLA 2022: 1196-1202 - [i5]Tue Herlau:
Active learning of causal probability trees. CoRR abs/2205.08178 (2022) - [i4]Tue Herlau:
Moral reinforcement learning using actual causation. CoRR abs/2205.08192 (2022) - [i3]Tue Herlau:
Probability trees and the value of a single intervention. CoRR abs/2205.08779 (2022) - 2020
- [i2]Tue Herlau:
Causal variables from reinforcement learning using generalized Bellman equations. CoRR abs/2010.15745 (2020)
2010 – 2019
- 2016
- [c10]Philip H. Jørgensen, Morten Mørup, Mikkel N. Schmidt, Tue Herlau:
Bayesian latent feature modeling for modeling bipartite networks with overlapping groups. MLSP 2016: 1-6 - [c9]Tue Herlau, Mikkel N. Schmidt, Morten Mørup:
Completely random measures for modelling block-structured sparse networks. NIPS 2016: 4260-4268 - 2014
- [j1]Fumiko Kano Glückstad, Tue Herlau, Mikkel N. Schmidt, Morten Mørup:
Cross-categorization of legal concepts across boundaries of legal systems: in consideration of inferential links. Artif. Intell. Law 22(1): 61-108 (2014) - [c8]Mikkel N. Schmidt, Tue Herlau, Morten Mørup:
Discovering hierarchical structure in normal relational data. CIP 2014: 1-6 - [c7]Morten Mørup, Fumiko Kano Glückstad, Tue Herlau, Mikkel N. Schmidt:
Nonparametric statistical structuring of knowledge systems using binary feature matches. MLSP 2014: 1-6 - [i1]Bjarne Ørum Fruergaard, Tue Herlau:
Efficient inference of overlapping communities in complex networks. CoRR abs/1411.7864 (2014) - 2013
- [c6]Tue Herlau, Morten Mørup, Mikkel N. Schmidt:
Modeling Temporal Evolution and Multiscale Structure in Networks. ICML (3) 2013: 960-968 - [c5]Karen Sandø Ambrosen, Tue Herlau, Tim B. Dyrby, Mikkel N. Schmidt, Morten Mørup:
Comparing Structural Brain Connectivity by the Infinite Relational Model. PRNI 2013: 50-53 - [c4]Fumiko Kano Glückstad, Tue Herlau, Mikkel N. Schmidt, Morten Mørup:
Unsupervised Knowledge Structuring: Application of Infinite Relational Models to the FCA Visualization. SITIS 2013: 233-240 - [c3]Fumiko Kano Glückstad, Tue Herlau, Mikkel N. Schmidt, Morten Mørup, Rafal Rzepka, Kenji Araki:
Analysis of Conceptualization Patterns across Groups of People. TAAI 2013: 349-354 - 2012
- [c2]Tue Herlau, Morten Mørup, Mikkel N. Schmidt, Lars Kai Hansen:
Detecting hierarchical structure in networks. CIP 2012: 1-6 - [c1]Tue Herlau, Morten Mørup, Mikkel N. Schmidt, Lars Kai Hansen:
Modelling dense relational data. MLSP 2012: 1-6
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-09-05 02:08 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:
