default search action
Maximilian von Zastrow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Andreas Lohrer
, Daniyal Kazempour, Maximilian Hünemörder, Peer Kröger:
CoMadOut - a robust outlier detection algorithm based on CoMAD. Mach. Learn. 113(10): 8061-8135 (2024) - [c13]Jukka Ruohonen
An Exploratory Case Study on Data Breach Journalism. ARES 2024: 140:1-140:9 - [c12]Nadine Sarah Schüler, Ptolemaios D. Paxinos, Jing Yuan, Maximilian von Zastrow, Joris Peters, Peer Kröger:
There is Strength in Numbers: A Comprehensive Study of Machine Learning Algorithms for Sex Identification on Animal Bone Remains. e-Science 2024: 1-10 - [c11]Nadine Sarah Schüler, Maximilian von Zastrow, Nadja Pöllath, Claudius Zelenka, Joris Peters:
X Marks the Spot? Applying Recent Keypoint Detection Methods to Paleozoological Landmarking. e-Science 2024: 1-2 - [i2]Jukka Ruohonen, Kalle Hjerppe, Maximilian von Zastrow:
An Exploratory Case Study on Data Breach Journalism. CoRR abs/2405.01446 (2024) - 2023
- [b1]Maximilian Archimedes Xaver Hünemörder:
Advances in Unsupervised Learning and Applications: Background knowledge driven subspace clustering, semantic password guessing and learned index structures. University of Kiel, Germany, 2023 - [j1]Theresa Ullmann
Over-optimistic evaluation and reporting of novel cluster algorithms: an illustrative study. Adv. Data Anal. Classif. 17(1): 211-238 (2023) - [c10]Claudius Zelenka, Andrea Göhring, Daniyal Kazempour, Maximilian Hünemörder
A Simple and Explainable Method for Uncertainty Estimation using Attribute Prototype Networks. ICCV (Workshops) 2023: 4572-4581 - 2022
- [c9]Maximilian Hünemörder
SePass: Semantic Password Guessing Using k-nn Similarity Search in Word Embeddings. ADMA (2) 2022: 28-42 - [c8]Maximilian Hünemörder
Stirring the Pot - Teaching Reinforcement Learning Agents a "Push-Your-Luck" board game. CoG 2022: 600-603 - [i1]Andreas Lohrer, Daniyal Kazempour, Maximilian Hünemörder
CoMadOut - A Robust Outlier Detection Algorithm based on CoMAD. CoRR abs/2211.13314 (2022) - 2021
- [c7]Julian Busch, Maximilian Hünemörder
Implicit Hough Transform Neural Networks for Subspace Clustering. ICDM (Workshops) 2021: 441-448 - [c6]Andreas Lohrer, Jan Deller, Maximilian Hünemörder
OAB - An Open Anomaly Benchmark Framework for Unsupervised and Semisupervised Anomaly Detection on Image and Tabular Data Sets. ICDM (Workshops) 2021: 991-1000 - [c5]Andreas Lohrer, Anna Beer
AnyCORE - An Anytime Algorithm for Cluster Outlier REmoval. LWDA 2021: 145-156 - [c4]Maximilian Hünemörder
Towards a Learned Index Structure for Approximate Nearest Neighbor Search Query Processing. SISAP 2021: 95-103
2010 – 2019
- 2019
- [c3]Maximilian Archimedes Xaver Hünemörder, Anna Beer
CODEC - Detecting Linear Correlations in Dense Clusters using coMAD-based PCA. LWDA 2019: 111-114 - [c2]Maximilian Archimedes Xaver Hünemörder
SIDEKICK: Linear Correlation Clustering with Supervised Background Knowledge. SISAP 2019: 221-230 - [c1]Daniyal Kazempour, Max Hünemörder
On coMADs and Principal Component Analysis. SISAP 2019: 273-280
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-12-10 21:41 CET 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: