Erich Schubert
Auto-generated profile, based on publicly available information

Erich Schubert

TU Dortmund University, Data Mining

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 July 2017 in ACM Transactions on Database Systems
Verified
Journal Article
Open access
PDF file
ESErich Schubert
Erich Schubert
JSJörg Sander
Jörg Sander
MEMartin Ester
Martin Ester
HKHans Peter Kriegel
Hans Peter Kriegel
XXXiaowei Xu
Xiaowei Xu
At SIGMOD 2015, an article was presented with the title “DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation” that won the conference’s best paper award. In this technical correspondence, we want to point out some inaccuracies in the way DBSCAN was represented, and why the criticism should have been directed at the assumption about the performance of spatial index structures such as R-trees and not at an algorithm that can use such indexes. We will also discuss the relationship of DBSCAN performance and the indexability of the dataset, and discuss some heuristics for choosing appropriate DBSCAN parameters. Some indicators of bad parameters will be proposed to help guide future users of this algorithm in choosing parameters such as to obtain both meaningful results and good performance. In new experiments, we show that the new SIGMOD 2015 methods do not appear to offer practical benefits if the DBSCAN parameters are well chosen and thus they are primarily of theoretical interest. In conclusion, the original DBSCAN algorithm with effective indexes and reasonably chosen parameter values performs competitively compared to the method proposed by Gan and Tao.

27 August 2012 in Statistical Analysis and Data Mining: An ASA Data Science Journal
Verified
Journal Article
Closed access
PDF file
AZArthur Zimek
Arthur Zimek
ESErich Schubert
Erich Schubert
HKHans‐Peter Kriegel
Hans‐Peter Kriegel

16 January 2016 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
GCGuilherme O. Campos
Guilherme O. Campos
AZArthur Zimek
Arthur Zimek
JSJörg Sander
Jörg Sander
RCRicardo J. G. B. Campello
Ricardo J. G. B. Campello
BMBarbora Micenková
Barbora Micenková
MHMichael E. Houle
Michael E. Houle

2 November 2009
Verified
Conference Paper
Open access
PDF file
HKHans-Peter Kriegel
Hans-Peter Kriegel
PKPeer Kröger
Peer Kröger
ESErich Schubert
Erich Schubert
AZArthur Zimek
Arthur Zimek
Many outlier detection methods do not merely provide the decision for a single data object being or not being an outlier but give also an outlier score or "outlier factor" signaling "how much" the respective data object is an outlier. A major problem for any user not very acquainted with the outlier detection method in question is how to interpret this "factor" in order to decide for the numeric score again whether or not the data object indeed is an outlier. Here, we formulate a local density based outlier detection method providing an outlier "score" in the range of [0, 1] that is directly interpretable as a probability of a data object for being an outlier.

18 December 2012 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
ESErich Schubert
Erich Schubert
AZArthur Zimek
Arthur Zimek
HKHans-Peter Kriegel
Hans-Peter Kriegel