Jörg Sander

Jörg Sander

Auto-generated profile, based on publicly available information

Jörg Sander

Department of Computing Science, University of Alberta, Edmonton, Canada

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

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

Representative Publications

View All Publications
16 May 2000
Verified
Conference Paper
Open access
PDF file
MBMarkus M. Breunig
Markus M. Breunig
HKHans-Peter Kriegel
Hans-Peter Kriegel
RNRaymond T. Ng
Raymond T. Ng
JSJörg Sander
Jörg Sander
For many KDD applications, such as detecting criminal activities in E-commerce, finding the rare instances or the outliers, can be more interesting than finding the common patterns. Existing work in outlier detection regards being an outlier as a binary property. In this paper, we contend that for many scenarios, it is more meaningful to assign to each object a degree of being an outlier. This degree is called the local outlier factor (LOF) of an object. It is local in that the degree depends on how isolated the object is with respect to the surrounding neighborhood. We give a detailed formal analysis showing that LOF enjoys many desirable properties. Using real-world datasets, we demonstrate that LOF can be used to find outliers which appear to be meaningful, but can otherwise not be identified with existing approaches. Finally, a careful performance evaluation of our algorithm confirms we show that our approach of finding local outliers can be practical.

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.

1 January 2013
Verified
Book Chapter
Closed access
PDF file
RCRicardo J. G. B. Campello
Ricardo J. G. B. Campello
DMDavoud Moulavi
Davoud Moulavi
JSJoerg Sander
Joerg Sander

1 June 1999
Verified
Conference Paper
Open access
PDF file
MAMihael Ankerst
Mihael Ankerst
MBMarkus M. Breunig
Markus M. Breunig
HKHans-Peter Kriegel
Hans-Peter Kriegel
JSJörg Sander
Jörg Sander

1 June 1998 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
JSJörg Sander
Jörg Sander
MEMartin Ester
Martin Ester
HKHans-Peter Kriegel
Hans-Peter Kriegel
XXXiaowei Xu
Xiaowei Xu

22 July 2015 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
RCRicardo J. G. B. Campello
Ricardo J. G. B. Campello
DMDavoud Moulavi
Davoud Moulavi
AZArthur Zimek
Arthur Zimek
JSJörg Sander
Jörg Sander
An integrated framework for density-based cluster analysis, outlier detection, and data visualization is introduced in this article. The main module consists of an algorithm to compute hierarchical estimates of the level sets of a density, following Hartigan’s classic model of density-contour clusters and trees. Such an algorithm generalizes and improves existing density-based clustering techniques with respect to different aspects. It provides as a result a complete clustering hierarchy composed of all possible density-based clusters following the nonparametric model adopted, for an infinite range of density thresholds. The resulting hierarchy can be easily processed so as to provide multiple ways for data visualization and exploration. It can also be further postprocessed so that: (i) a normalized score of “outlierness” can be assigned to each data object, which unifies both the global and local perspectives of outliers into a single definition; and (ii) a “flat” (i.e., nonhierarchical) clustering solution composed of clusters extracted from local cuts through the cluster tree (possibly corresponding to different density thresholds) can be obtained, either in an unsupervised or in a semisupervised way. In the unsupervised scenario, the algorithm corresponding to this postprocessing module provides a global, optimal solution to the formal problem of maximizing the overall stability of the extracted clusters. If partially labeled objects or instance-level constraints are provided by the user, the algorithm can solve the problem by considering both constraints violations/satisfactions and cluster stability criteria. An asymptotic complexity analysis, both in terms of running time and memory space, is described. Experiments are reported that involve a variety of synthetic and real datasets, including comparisons with state-of-the-art, density-based clustering and (global and local) outlier detection methods.