default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTammo Rukat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c8]Tristan Cinquin, Tammo Rukat, Philipp Schmidt, Martin Wistuba, Artur Bekasov:
Variational Boosted Soft Trees. AISTATS 2023: 5787-5801- [i5]Tristan Cinquin, Tammo Rukat, Philipp Schmidt, Martin Wistuba, Artur Bekasov:
Variational Boosted Soft Trees. CoRR abs/2302.10706 (2023) - 2021
- [j3]Felix Biessmann, Jacek Golebiowski, Tammo Rukat, Dustin Lange, Philipp Schmidt:
Automated Data Validation in Machine Learning Systems. IEEE Data Eng. Bull. 44(1): 51-65 (2021) - [c7]Sebastian Schelter, Tammo Rukat, Felix Biessmann:
JENGA - A Framework to Study the Impact of Data Errors on the Predictions of Machine Learning Models. EDBT 2021: 529-534 - 2020
- [c6]Sebastian Schelter
, Tammo Rukat, Felix Bießmann:
Learning to Validate the Predictions of Black Box Classifiers on Unseen Data. SIGMOD Conference 2020: 1289-1299
2010 – 2019
- 2019
- [j2]Felix Bießmann, Tammo Rukat, Philipp Schmidt, Prathik Naidu, Sebastian Schelter, Andrey Taptunov, Dustin Lange, David Salinas:
DataWig: Missing Value Imputation for Tables. J. Mach. Learn. Res. 20: 175:1-175:6 (2019) - [c5]Sebastian Schelter, Stefan Grafberger, Philipp Schmidt, Tammo Rukat, Mario Kießling, Andrey Taptunov, Felix Bießmann, Dustin Lange:
Differential Data Quality Verification on Partitioned Data. ICDE 2019: 1940-1945 - [c4]Sergey Redyuk, Sebastian Schelter, Tammo Rukat, Volker Markl, Felix Bießmann:
Learning to Validate the Predictions of Black Box Machine Learning Models on Unseen Data. HILDA@SIGMOD 2019: 4:1-4:4 - [c3]Sebastian Schelter, Felix Bießmann, Dustin Lange, Tammo Rukat, Philipp Schmidt, Stephan Seufert, Pierre Brunelle, Andrey Taptunov:
Unit Testing Data with Deequ. SIGMOD Conference 2019: 1993-1996 - [i4]Tammo Rukat, Christopher Yau:
Bayesian Nonparametric Boolean Factor Models. CoRR abs/1907.00063 (2019) - 2018
- [b1]Tammo Rukat:
Logical factorisation machines: probabilistic Boolean factor models for binary data. University of Oxford, UK, 2018 - [c2]Tammo Rukat, Christopher C. Holmes, Christopher Yau:
Probabilistic Boolean Tensor Decomposition. ICML 2018: 4410-4419 - [i3]Tammo Rukat, Christopher C. Holmes, Christopher Yau:
TensOrMachine: Probabilistic Boolean Tensor Decomposition. CoRR abs/1805.04582 (2018) - 2017
- [j1]Samuel Demharter, Nicholas Pearce, Kylie Beattie, Isabel Frost, Jinwoo Leem, Alistair Martin, Robert Oppenheimer, Cristian Regep, Tammo Rukat, Alexander Skates, Nicola Trendel, David J. Gavaghan, Charlotte M. Deane, Bernhard Knapp:
Ten simple rules for surviving an interdisciplinary PhD. PLoS Comput. Biol. 13(5) (2017) - [c1]Tammo Rukat, Christopher C. Holmes, Michalis K. Titsias, Christopher Yau:
Bayesian Boolean Matrix Factorisation. ICML 2017: 2969-2978 - [i2]Tammo Rukat, Christopher C. Holmes, Michalis K. Titsias, Christopher Yau:
Bayesian Boolean Matrix Factorisation. CoRR abs/1702.06166 (2017) - [i1]Tammo Rukat, Dustin Lange, Cédric Archambeau:
An interpretable latent variable model for attribute applicability in the Amazon catalogue. CoRR abs/1712.00126 (2017)
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-13 01:36 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:
