default search action
Sandra Gilhuber
Person information
- affiliation: LMU Munich, Institute of Informatics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Sandra Gilhuber, Anna Beer, Yunpu Ma, Thomas Seidl:
FALCUN: A Simple and Efficient Deep Active Learning Strategy. ECML/PKDD (3) 2024: 421-439 - [i5]Valentin Margraf, Marcel Wever, Sandra Gilhuber, Gabriel Marques Tavares, Thomas Seidl, Eyke Hüllermeier:
ALPBench: A Benchmark for Active Learning Pipelines on Tabular Data. CoRR abs/2406.17322 (2024) - 2023
- [c7]Sandra Gilhuber, Julian Busch, Daniel Rotthues, Christian M. M. Frey, Thomas Seidl:
DiffusAL: Coupling Active Learning with Graph Diffusion for Label-Efficient Node Classification. ECML/PKDD (1) 2023: 75-91 - [c6]Sandra Gilhuber, Rasmus Hvingelby, Mang Ling Ada Fok, Thomas Seidl:
How to Overcome Confirmation Bias in Semi-Supervised Image Classification by Active Learning. ECML/PKDD (2) 2023: 330-347 - [i4]Sandra Gilhuber, Julian Busch, Daniel Rotthues, Christian M. M. Frey, Thomas Seidl:
DiffusAL: Coupling Active Learning with Graph Diffusion for Label-Efficient Node Classification. CoRR abs/2308.00146 (2023) - [i3]Sandra Gilhuber, Rasmus Hvingelby, Mang Ling Ada Fok, Thomas Seidl:
How To Overcome Confirmation Bias in Semi-Supervised Image Classification By Active Learning. CoRR abs/2308.08224 (2023) - 2022
- [c5]Sandra Gilhuber, Philipp Jahn
, Yunpu Ma, Thomas Seidl:
VERIPS: Verified Pseudo-label Selection for Deep Active Learning. ICDM 2022: 951-956 - [c4]Sandra Gilhuber, Max Berrendorf, Yunpu Ma, Thomas Seidl:
Accelerating Diversity Sampling for Deep Active Learning By Low-Dimensional Representations. IAL@PKDD/ECML 2022: 43-48 - 2021
- [c3]Sandra Obermeier, Anna Beer
Cluster Flow - an Advanced Concept for Ensemble-Enabling, Interactive Clustering. BTW 2021: 175-194 - [c2]Michael Fromm, Max Berrendorf, Sandra Obermeier, Thomas Seidl, Evgeniy Faerman:
Diversity Aware Relevance Learning for Argument Search. ECIR (2) 2021: 264-271 - [e1]Thomas Seidl, Michael Fromm, Sandra Obermeier:
Proceedings of the LWDA 2021 Workshops: FGWM, KDML, FGWI-BIA, and FGIR, Online, September 1-3, 2021. CEUR Workshop Proceedings 2993, CEUR-WS.org 2021 [contents] - 2020
- [c1]Sandra Obermeier, Max Berrendorf
Memory-Efficient RkNN Retrieval by Nonlinear k-Distance Approximation. WI/IAT 2020: 387-390 - [i2]Sandra Obermeier, Max Berrendorf, Peer Kröger:
Memory-Efficient RkNN Retrieval by Nonlinear k-Distance Approximation. CoRR abs/2011.01773 (2020) - [i1]Michael Fromm, Max Berrendorf, Sandra Obermeier, Thomas Seidl, Evgeniy Faerman:
Diversity Aware Relevance Learning for Argument Search. CoRR abs/2011.02177 (2020)
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-10-15 20:44 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: