• Publications
  • Influence
Density-Connected Subspace Clustering for High-Dimensional Data
TLDR
We introduce SUBCLU (density-connected Subspace Clustering), an effective and efficient approach to the subspace clustering problem. Expand
  • 401
  • 53
  • PDF
Density connected clustering with local subspace preferences
TLDR
In this paper, we introduce the concept of local subspace preferences, which captures the main directions of high point density. Expand
  • 172
  • 23
  • PDF
Computing Clusters of Correlation Connected objects
TLDR
In this paper, we propose a method called 4C (Computing Correlation Connected Clusters) to identify local subgroups of the data objects sharing a uniform but arbitrarily complex correlation. Expand
  • 176
  • 10
  • PDF
Subspace selection for clustering high-dimensional data
TLDR
We present a feature selection technique called SURFING (subspaces relevant for clustering) that finds all relevant subspaces in high dimensional, sparse data sets and sorts them by relevance and produces better results than comparative methods. Expand
  • 66
  • 9
  • PDF
DUST: a generalized notion of similarity between uncertain time series
TLDR
We propose a novel distance measure that accommodates uncertainty and degenerates to the Euclidean distance when the distance is large compared to the error. Expand
  • 54
  • 7
  • PDF
Efficient Similarity Search for Hierarchical Data in Large Databases
TLDR
We present a set of new filter methods for structural and for content-based information in tree-structured data as well as ways to flexibly combine different filter criteria. Expand
  • 90
  • 6
  • PDF
Towards Traceability across Sovereign, Distributed RFID Databases
TLDR
In this paper, we introduce the formal concept of traceability networks and highlight the technical challenges involved in sharing data in such a network. Expand
  • 71
  • 4
  • PDF
Clustering Multi-represented Objects with Noise
TLDR
We present an efficient density-based approach to cluster multi-represented data, taking all available representations into account. Expand
  • 70
  • 4
  • PDF
Ranking Interesting Subspaces for Clustering High Dimensional Data
TLDR
We present a pre-processing step for traditional clustering algorithms, which detects all interesting subspaces of high-dimensional data containing clusters. Expand
  • 81
  • 4
  • PDF
Discovery Services-Enabling RFID Traceability in EPCglobal Networks
TLDR
The EPCglobal consortium defines standards to enable data sharing of electronic product code related information within and between enterprises, which typically comprises events of RFID readers as well as product information. Expand
  • 75
  • 4
  • PDF