Christian Böhm

Christian Böhm

Auto-generated profile, based on publicly available information

Christian Böhm

Ludwig-Maximilians-Universität München, Munich, Germany

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
1 May 1997
Verified
Conference Paper
Open access
PDF file
SBStefan Berchtold
Stefan Berchtold
CBChristian Böhm
Christian Böhm
DKDaniel A. Keim
Daniel A. Keim
HKHans-Peter Kriegel
Hans-Peter Kriegel

13 June 2004
Verified
Conference Paper
Open access
PDF file
CBChristian Böhm
Christian Böhm
KKKarin Kailing
Karin Kailing
PKPeer Kröger
Peer Kröger
AZArthur Zimek
Arthur Zimek
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the features or some association of cause and effect between them. This association can be arbitrarily complex, i.e. one or more features might be dependent from a combination of several other features. Well-known methods like the principal components analysis (PCA) can perfectly find correlations which are global, linear, not hidden in a set of noise vectors, and uniform, i.e. the same type of correlation is exhibited in all feature vectors. In many applications such as medical diagnosis, molecular biology, time sequences, or electronic commerce, however, correlations are not global since the dependency between features can be different in different subgroups of the set. 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. Our algorithm is based on a combination of PCA and density-based clustering (DBSCAN). Our method has a determinate result and is robust against noise. A broad comparative evaluation demonstrates the superior performance of 4C over competing methods such as DBSCAN, CLIQUE and ORCLUS.

1 June 2000 in ACM Transactions on Database Systems
Verified
Journal Article
Open access
CBChristian Böhm
Christian Böhm
During the last decade, multimedia databases have become increasingly important in many application areas such as medicine, CAD, geography, and molecular biology. An important research topic in multimedia databases is similarity search in large data sets. Most current approaches that address similarity search use the feature approach, which transforms important properties of the stored objects into points of a high-dimensional space (feature vectors). Thus, similarity search is transformed into a neighborhood search in feature space. Multidimensional index structures are usually applied when managing feature vectors. Query processing can be improved substantially with optimization techniques such as blocksize optimization, data space quantization, and dimension reduction. To determine optimal parameters, an accurate estimate of index-based query processing performance is crucial. In this paper we develop a cost model for index structures for point databases such as the R*-tree and the X-tree. It provides accurate estimates of the number of data page accesses for range queries and nearest-neighbor queries under a Euclidean metric and a maximum metric and a maximum metric. The problems specific to high-dimensional data spaces, called boundary effects, are considered. The concept of the fractal dimension is used to take the effects of correlated data into account.

27 June 2006
Verified
Conference Paper
Open access
PDF file
EAElke Achtert
Elke Achtert
CBChristian Böhm
Christian Böhm
PKPeer Kröger
Peer Kröger
PKPeter Kunath
Peter Kunath
APAlexey Pryakhin
Alexey Pryakhin
MRMatthias Renz
Matthias Renz

2 November 2009
Verified
Conference Paper
Open access
CBChristian Böhm
Christian Böhm
RNRobert Noll
Robert Noll
Claudia PlantClaudia Plant
Claudia Plant
BWBianca Wackersreuther
Bianca Wackersreuther

25 July 2010
Verified
Conference Paper
Open access
CBChristian Böhm
Christian Böhm
Claudia PlantClaudia Plant
Claudia Plant
JSJunming Shao
Junming Shao
QYQinli Yang
Qinli Yang
Synchronization is a powerful basic concept in nature regulating a large variety of complex processes ranging from the metabolism in the cell to social behavior in groups of individuals. Therefore, synchronization phenomena have been extensively studied and models robustly capturing the dynamical synchronization process have been proposed, e.g. the Extensive Kuramoto Model. Inspired by the powerful concept of synchronization, we propose Sync, a novel approach to clustering. The basic idea is to view each data object as a phase oscillator and simulate the interaction behavior of the objects over time. As time evolves, similar objects naturally synchronize together and form distinct clusters. Inherited from synchronization, Sync has several desirable properties: The clusters revealed by dynamic synchronization truly reflect the intrinsic structure of the data set, Sync does not rely on any distribution assumption and allows detecting clusters of arbitrary number, shape and size. Moreover, the concept of synchronization allows natural outlier handling, since outliers do not synchronize with cluster objects. For fully automatic clustering, we propose to combine Sync with the Minimum Description Length principle. Extensive experiments on synthetic and real world data demonstrate the effectiveness and efficiency of our approach.