#### Filter Results:

- Full text PDF available (383)

#### Publication Year

1975

2017

- This year (1)
- Last 5 years (75)
- Last 10 years (204)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng, Jörg Sander
- SIGMOD Conference
- 2000

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… (More)

- Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel
- VLDB
- 1996

In this paper, we propose a new method for indexing large amounts of point and spatial data in highdimensional space. An analysis shows that index structures such as the R*-tree are not adequate for indexing high-dimensional data sets. The major problem of R-tree-based index structures is the overlap of the bounding boxes in the directory, which increases… (More)

- Martin Ester, Hans-Peter Kriegel, Jörg Sander, Xiaowei Xu
- KDD
- 1996

Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clusters with arbitrary shape and good efficiency on large… (More)

- Maximilian Nickel, Volker Tresp, Hans-Peter Kriegel
- ICML
- 2011

Relational learning is becoming increasingly important in many areas of application. Here, we present a novel approach to relational learning based on the factorization of a three-way tensor. We show that unlike other tensor approaches, our method is able to perform collective learning via the latent components of the model and provide an efficient… (More)

- Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard Seeger
- SIGMOD Conference
- 1993

Spatial joins are one of the most important operations for combining spatial objects of several relations. The efficient processing of a spatial join is extremely important since its execution time is superlinear in the number of spatial objects of the participating relations, and this number of objects may be very high. In this paper, we present a first… (More)

MOTIVATION
Many problems in data integration in bioinformatics can be posed as one common question: Are two sets of observations generated by the same distribution? We propose a kernel-based statistical test for this problem, based on the fact that two distributions are different if and only if there exists at least one function having different expectation… (More)

- Jörg Sander, Martin Ester, Hans-Peter Kriegel, Xiaowei Xu
- Data Mining and Knowledge Discovery
- 1998

The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper, we generalize this algorithm in two important directions. The generalized algorithm—called GDBSCAN—can cluster point objects as well as spatially extended objects according to… (More)

- Stefan Berchtold, Christian Böhm, Hans-Peter Kriegel
- SIGMOD Conference
- 1998

In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The Pyramid-Technique is highly adapted to range query processing using the maximum metric L<subscrpt>max</subscrpt>. In contrast to all other index structures, the performance of the Pyramid-Technique does not deteriorate when processing range queries… (More)

Classification is one of the basic tasks of data mining in modern database applications including molecular biology, astronomy, mechanical engineering, medical imaging or meteorology. The underlying models have to consider spatial properties such as shape or extension as well as thematic attributes. We introduce 3D shape histograms as an intuitive and… (More)

Data warehouses provide a great deal of opportunities for performing data mining tasks such as classification and clustering. Typically, updates are collected and applied to the data warehouse periodically in a batch mode, e.g., during the night. Then, all patterns derived from the warehouse by some data mining algorithm have to be updated as well. Due to… (More)