Hans-Peter  Kriegel
Hans-Peter Kriegel
Professor für Informatik, Ludwig-Maximilians-University Munich
Verified email at dbs.ifi.lmu.de
Cited by
Cited by
A density-based algorithm for discovering clusters in large spatial databases with noise.
M Ester, HP Kriegel, J Sander, X Xu
Kdd 96 (34), 226-231, 1996
The R*-tree: an efficient and robust access method for points and rectangles
N Beckmann, HP Kriegel, R Schneider, B Seeger
Proceedings of the 1990 ACM SIGMOD international conference on Management of …, 1990
LOF: identifying density-based local outliers
MM Breunig, HP Kriegel, RT Ng, J Sander
Proceedings of the 2000 ACM SIGMOD international conference on Management of …, 2000
OPTICS: ordering points to identify the clustering structure
M Ankerst, MM Breunig, HP Kriegel, J Sander
ACM Sigmod record 28 (2), 49-60, 1999
The X-tree: An index structure for high-dimensional data
S Berchtold, DA Keim, HP Kriegel
Very Large Data-Bases, 28-39, 1996
Density-based clustering in spatial databases: The algorithm gdbscan and its applications
J Sander, M Ester, HP Kriegel, X Xu
Data mining and knowledge discovery 2 (2), 169-194, 1998
Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering
HP Kriegel, P Kröger, A Zimek
ACM Transactions on Knowledge Discovery from Data (TKDD) 3 (1), 1-58, 2009
A three-way model for collective learning on multi-relational data.
M Nickel, V Tresp, HP Kriegel
Icml 11, 809-816, 2011
Efficient processing of spatial joins using R-trees
T Brinkhoff, HP Kriegel, B Seeger
ACM SIGMOD Record 22 (2), 237-246, 1993
3D shape histograms for similarity search and classification in spatial databases
M Ankerst, G Kastenmüller, HP Kriegel, T Seidl
International symposium on spatial databases, 207-226, 1999
The pyramid-technique:towards breaking the curse of dimensionality
HPK S Berchtold,C Böhm
ACM SIGMOD Int.Conference on Management of Data 1998 (1998), 142-153, 1998
Shortest-path kernels on graphs
KM Borgwardt, HP Kriegel
Fifth IEEE international conference on data mining (ICDM'05), 8 pp., 2005
Incremental generalization for mining in a data warehousing environment
M Ester, R Wittmann
International Conference on Extending Database Technology, 135-149, 1998
Incremental Clustering for Mining in a Data Warehousing Environment
XX M Esrer,HP Kriegel,J Sander,M Wimmer
Proc.24th VLDB Conference 24 (1998), 323-333, 1998
Integrating structured biological data by kernel maximum mean discrepancy
KM Borgwardt, A Gretton, MJ Rasch, HP Kriegel, B Schölkopf, AJ Smola
Bioinformatics 22 (14), e49-e57, 2006
Protein function prediction via graph kernels
KM Borgwardt, CS Ong, S Schönauer, SVN Vishwanathan, AJ Smola, ...
Bioinformatics 21 (suppl_1), i47-i56, 2005
Optimal multi-step k-nearest neighbor search
T Seidl, HP Kriegel
Proceedings of the 1998 ACM SIGMOD international conference on Management of …, 1998
Density‐based clustering
HP Kriegel, P Kröger, J Sander, A Zimek
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 1 (3 …, 2011
Angle-based outlier detection in high-dimensional data
HP Kriegel, M Schubert, A Zimek
Proceedings of the 14th ACM SIGKDD international conference on Knowledge …, 2008
Visualization techniques for mining large databases: A comparison
DA Keim, HP Kriegel
IEEE Transactions on knowledge and data engineering 8 (6), 923-938, 1996
The system can't perform the operation now. Try again later.
Articles 1–20