Peer Kröger
Peer Kröger
Christian-Albrechts-University Kiel
Bestätigte E-Mail-Adresse bei dbs.ifi.lmu.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
12242009
Density‐based clustering
HP Kriegel, P Kröger, J Sander, A Zimek
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 1 (3 …, 2011
6842011
Density-connected subspace clustering for high-dimensional data
K Kailing, HP Kriegel, P Kröger
Proceedings of the 2004 SIAM international conference on data mining, 246-256, 2004
4842004
Density-connected subspace clustering for high-dimensional data
P Kröger, HP Kriegel, K Kailing
Proceedings of the Fourth SIAM International Conference on Data Mining (SDM …, 2004
484*2004
LoOP: local outlier probabilities
HP Kriegel, P Kröger, E Schubert, A Zimek
Proceedings of the 18th ACM conference on Information and knowledge …, 2009
4432009
Can shared-neighbor distances defeat the curse of dimensionality?
ME Houle, HP Kriegel, P Kröger, E Schubert, A Zimek
International Conference on Scientific and Statistical Database Management …, 2010
2692010
Outlier detection techniques
HP Kriegel, P Kröger, A Zimek
Tutorial at KDD 10, 1-76, 2010
2672010
Outlier detection in axis-parallel subspaces of high dimensional data
HP Kriegel, P Kröger, E Schubert, A Zimek
Pacific-asia conference on knowledge discovery and data mining, 831-838, 2009
2412009
Interpreting and unifying outlier scores
HP Kriegel, P Kroger, E Schubert, A Zimek
Proceedings of the 2011 SIAM International Conference on Data Mining, 13-24, 2011
2262011
Future trends in data mining
HP Kriegel, KM Borgwardt, P Kröger, A Pryakhin, M Schubert, A Zimek
Data Mining and Knowledge Discovery 15 (1), 87-97, 2007
2212007
Computing clusters of correlation connected objects
C Böhm, K Kailing, P Kröger, A Zimek
Proceedings of the 2004 ACM SIGMOD international conference on Management of …, 2004
2092004
A generic framework for efficient subspace clustering of high-dimensional data
HP Kriegel, P Kroger, M Renz, S Wurst
fifth IEEE international conference on data mining (ICDM'05), 8 pp., 2005
2052005
Density connected clustering with local subspace preferences
C Bohm, K Railing, HP Kriegel, P Kroger
Fourth IEEE International Conference on Data Mining (ICDM'04), 27-34, 2004
2042004
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
E Achtert, C Böhm, P Kröger, P Kunath, A Pryakhin, M Renz
Proceedings of the 2006 ACM SIGMOD international conference on Management of …, 2006
1612006
On using class-labels in evaluation of clusterings
I Färber, S Günnemann, HP Kriegel, P Kröger, E Müller, E Schubert, ...
MultiClust: 1st international workshop on discovering, summarizing and using …, 2010
1302010
A general framework for increasing the robustness of PCA-based correlation clustering algorithms
HP Kriegel, P Kröger, E Schubert, A Zimek
International Conference on Scientific and Statistical Database Management …, 2008
1232008
DeLi-Clu: boosting robustness, completeness, usability, and efficiency of hierarchical clustering by a closest pair ranking
E Achtert, C Böhm, P Kröger
Pacific-Asia Conference on Knowledge Discovery and Data Mining, 119-128, 2006
1142006
Outlier detection in arbitrarily oriented subspaces
HP Kriegel, P Kröger, E Schubert, A Zimek
2012 IEEE 12th international conference on data mining, 379-388, 2012
1132012
Accumulation of cadmium, zinc, and copper in maternal blood and developmental placental tissue: differences between Finland, Estonia, and St. Petersburg
M Kantola, R Purkunen, P Kröger, A Tooming, J Juravskaja, M Pasanen, ...
Environmental research 83 (1), 54-66, 2000
1132000
Data bubbles: Quality preserving performance boosting for hierarchical clustering
MM Breunig, HP Kriegel, P Kröger, J Sander
Proceedings of the 2001 ACM SIGMOD international conference on Management of …, 2001
1122001
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20