The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peer Kröger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. François Bry, Peer Kröger
    Bioinformatics Databases: State of the Art and Research Perspectives. [Citation Graph (0, 0)][DBLP]
    ADBIS, 2003, pp:3- [Conf]
  2. Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
    Semi-Supervised Threshold Queries on Pharmacogenomics Time Sequences. [Citation Graph (0, 0)][DBLP]
    APBC, 2006, pp:307-316 [Conf]
  3. Elke Achtert, Christian Böhm, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
    Efficient Reverse k-Nearest Neighbor Estimation. [Citation Graph (0, 0)][DBLP]
    BTW, 2007, pp:344-363 [Conf]
  4. Elke Achtert, Christian Böhm, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
    Approximate reverse k-nearest neighbor queries in general metric spaces. [Citation Graph (0, 0)][DBLP]
    CIKM, 2006, pp:788-789 [Conf]
  5. Hans-Peter Kriegel, Peer Kröger, Zahi Mashael, Martin Pfeifle, Marco Pötke, Thomas Seidl
    Effective Similarity Search on Voxelized CAD Object. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2003, pp:27-0 [Conf]
  6. Hans-Peter Kriegel, Peer Kröger, Irina Gotlibovich
    Incremental OPTICS: Efficient Computation of Updates in a Hierarchical Cluster Ordering. [Citation Graph (0, 0)][DBLP]
    DaWaK, 2003, pp:224-233 [Conf]
  7. Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
    Similarity Search on Time Series Based on Threshold Queries. [Citation Graph (0, 0)][DBLP]
    EDBT, 2006, pp:276-294 [Conf]
  8. Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
    TQuEST: Threshold Query Execution for Large Sets of Time Series. [Citation Graph (0, 0)][DBLP]
    EDBT, 2006, pp:1147-1150 [Conf]
  9. Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
    Threshold Similarity Queries in Large Time Series Databases. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:149- [Conf]
  10. Stefan Brecheisen, Hans-Peter Kriegel, Peer Kröger, Martin Pfeifle, Maximilian Viermetz, Marco Pötke
    BOSS: Browsing OPTICS-Plots for Similarity Search. [Citation Graph (0, 0)][DBLP]
    ICDE, 2004, pp:858- [Conf]
  11. Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger
    Online Hierarchical Clustering in a Data Warehouse Environment. [Citation Graph (0, 0)][DBLP]
    ICDM, 2005, pp:10-17 [Conf]
  12. Christian Baumgartner, Claudia Plant, Karin Kailing, Hans-Peter Kriegel, Peer Kröger
    Subspace Selection for Clustering High-Dimensional Data. [Citation Graph (0, 0)][DBLP]
    ICDM, 2004, pp:11-18 [Conf]
  13. Christian Böhm, Karin Kailing, Hans-Peter Kriegel, Peer Kröger
    Density Connected Clustering with Local Subspace Preferences. [Citation Graph (0, 0)][DBLP]
    ICDM, 2004, pp:27-34 [Conf]
  14. Hans-Peter Kriegel, Peer Kröger, Alexey Pryakhin, Matthias Schubert
    Effective and Efficient Distributed Model-Based Clustering. [Citation Graph (0, 0)][DBLP]
    ICDM, 2005, pp:258-265 [Conf]
  15. Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Sebastian Wurst
    A Generic Framework for Efficient Subspace Clustering of High-Dimensional Data. [Citation Graph (0, 0)][DBLP]
    ICDM, 2005, pp:250-257 [Conf]
  16. Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Arthur Zimek
    Deriving quantitative models for correlation clusters. [Citation Graph (0, 0)][DBLP]
    KDD, 2006, pp:4-13 [Conf]
  17. Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin
    Effective similarity search in multimedia databases using multiple representations. [Citation Graph (0, 0)][DBLP]
    MMM, 2006, pp:- [Conf]
  18. Elke Achtert, Christian Böhm, Peer Kröger
    DeLi-Clu: Boosting Robustness, Completeness, Usability, and Efficiency of Hierarchical Clustering by a Closest Pair Ranking. [Citation Graph (0, 0)][DBLP]
    PAKDD, 2006, pp:119-128 [Conf]
  19. Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Ina Müller-Gorman, Arthur Zimek
    Finding Hierarchies of Subspace Clusters. [Citation Graph (0, 0)][DBLP]
    PKDD, 2006, pp:446-453 [Conf]
  20. Karin Kailing, Hans-Peter Kriegel, Peer Kröger, Stefanie Wanka
    Ranking Interesting Subspaces for Clustering High Dimensional Data. [Citation Graph (0, 0)][DBLP]
    PKDD, 2003, pp:241-252 [Conf]
  21. Stefan Brecheisen, Hans-Peter Kriegel, Peer Kröger, Martin Pfeifle
    Visually Mining through Cluster Hierarchies. [Citation Graph (0, 0)][DBLP]
    SDM, 2004, pp:- [Conf]
  22. Hans-Peter Kriegel, Peer Kröger, Alexey Pryakhin, Matthias Schubert
    Using Support Vector Machines for Classifying Large Sets of Multi-Represented Objects. [Citation Graph (0, 0)][DBLP]
    SDM, 2004, pp:- [Conf]
  23. Peer Kröger, Hans-Peter Kriegel, Karin Kailing
    Density-Connected Subspace Clustering for High-Dimensional Data. [Citation Graph (0, 0)][DBLP]
    SDM, 2004, pp:- [Conf]
  24. Elke Achtert, Christian Böhm, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
    Efficient reverse k-nearest neighbor search in arbitrary metric spaces. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2006, pp:515-526 [Conf]
  25. Christian Böhm, Karin Kailing, Peer Kröger, Arthur Zimek
    Computing Clusters of Correlation Connected Objects. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:455-466 [Conf]
  26. Markus M. Breunig, Hans-Peter Kriegel, Peer Kröger, Jörg Sander
    Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2001, pp:79-90 [Conf]
  27. Hans-Peter Kriegel, Stefan Brecheisen, Peer Kröger, Martin Pfeifle, Matthias Schubert
    Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2003, pp:587-598 [Conf]
  28. Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Marco Pötke
    Accurate and Efficient Similarity Search on 3D Objects Using Point Sampling, Redundancy, and Proportionality. [Citation Graph (0, 0)][DBLP]
    SSTD, 2005, pp:200-217 [Conf]
  29. Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Petra Linhart
    Selectivity Estimation of High Dimensional Window Queries via Clustering. [Citation Graph (0, 0)][DBLP]
    SSTD, 2005, pp:1-18 [Conf]
  30. Hans-Peter Kriegel, Peer Kröger, Matthias Schubert, Ziyue Zhu
    Efficient Query Processing in Arbitrary Subspaces Using Vector Approximations. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2006, pp:184-190 [Conf]
  31. Elke Achtert, Christian Böhm, Peer Kröger, Arthur Zimek
    Mining Hierarchies of Correlation Clusters. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2006, pp:119-128 [Conf]
  32. Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
    Time Series Analysis Using the Concept of Adaptable Threshold Similarity. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2006, pp:251-260 [Conf]
  33. Christian Böhm, Karin Kailing, Peer Kröger, Hans-Peter Kriegel
    Immer größere und komplexere Datenmengen: Herausforderungen für Clustering-Algorithmen. [Citation Graph (0, 0)][DBLP]
    Datenbank-Spektrum, 2004, v:9, n:, pp:11-17 [Journal]
  34. François Bry, Peer Kröger
    A Computational Biology Database Digest: Data, Data Analysis, and Data Management. [Citation Graph (0, 0)][DBLP]
    Distributed and Parallel Databases, 2003, v:13, n:1, pp:7-42 [Journal]
  35. François Bry, Peer Kröger
    Datenbanken in der Bioinformatik. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 2002, v:25, n:5, pp:359-362 [Journal]
  36. Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
    Interval-Focused Similarity Search in Time Series Databases. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2007, pp:586-597 [Conf]
  37. Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Ina Müller-Gorman, Arthur Zimek
    Detection and Visualization of Subspace Cluster Hierarchies. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2007, pp:152-163 [Conf]
  38. Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Arthur Zimek
    Robust, Complete, and Efficient Correlation Clustering. [Citation Graph (0, 0)][DBLP]
    SDM, 2007, pp:- [Conf]
  39. Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Matthias Renz
    Generalizing the Optimality of Multi-step k -Nearest Neighbor Query Processing. [Citation Graph (0, 0)][DBLP]
    SSTD, 2007, pp:75-92 [Conf]
  40. Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Arthur Zimek
    On Exploring Complex Relationships of Correlation Clusters. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2007, pp:7- [Conf]
  41. Hans-Peter Kriegel, Karsten M. Borgwardt, Peer Kröger, Alexey Pryakhin, Matthias Schubert, Arthur Zimek
    Future trends in data mining. [Citation Graph (0, 0)][DBLP]
    Data Min. Knowl. Discov., 2007, v:15, n:1, pp:87-97 [Journal]
  42. Elke Achtert, Christian Böhm, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
    Efficient reverse k-nearest neighbor estimation. [Citation Graph (0, 0)][DBLP]
    Inform., Forsch. Entwickl., 2007, v:21, n:3-4, pp:179-195 [Journal]

  43. LoOP: local outlier probabilities. [Citation Graph (, )][DBLP]


  44. OSSOBOOK: database and knowledgemanagement techniques for archaeozoology. [Citation Graph (, )][DBLP]


  45. Approximate Clustering of Time Series Using Compact Model-Based Descriptions. [Citation Graph (, )][DBLP]


  46. Analysis of Time Series Using Compact Model-Based Descriptions. [Citation Graph (, )][DBLP]


  47. Periodic Pattern Analysis in Time Series Databases. [Citation Graph (, )][DBLP]


  48. Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Databases. [Citation Graph (, )][DBLP]


  49. Reverse k-nearest neighbor search in dynamic and general metric databases. [Citation Graph (, )][DBLP]


  50. Proximity queries in large traffic networks. [Citation Graph (, )][DBLP]


  51. Continuous proximity monitoring in road networks. [Citation Graph (, )][DBLP]


  52. Constrained reverse nearest neighbor search on mobile objects. [Citation Graph (, )][DBLP]


  53. T-Time: Threshold-Based Data Mining on Time Series. [Citation Graph (, )][DBLP]


  54. Efficient Query Processing in Large Traffic Networks. [Citation Graph (, )][DBLP]


  55. Incremental Reverse Nearest Neighbor Ranking. [Citation Graph (, )][DBLP]


  56. Techniques for efficiently searching in spatial, temporal, spatio-temporal, and multimedia databases. [Citation Graph (, )][DBLP]


  57. Similarity Search in Multimedia Time Series Data Using Amplitude-Level Features. [Citation Graph (, )][DBLP]


  58. Outlier Detection in Axis-Parallel Subspaces of High Dimensional Data. [Citation Graph (, )][DBLP]


  59. Robust Clustering in Arbitrarily Oriented Subspaces. [Citation Graph (, )][DBLP]


  60. Boosting spatial pruning: on optimal pruning of MBRs. [Citation Graph (, )][DBLP]


  61. Incremental Reverse Nearest Neighbor Ranking in Vector Spaces. [Citation Graph (, )][DBLP]


  62. Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks. [Citation Graph (, )][DBLP]


  63. A General Framework for Increasing the Robustness of PCA-Based Correlation Clustering Algorithms. [Citation Graph (, )][DBLP]


  64. Probabilistic Similarity Search for Uncertain Time Series. [Citation Graph (, )][DBLP]


  65. Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods. [Citation Graph (, )][DBLP]


  66. Can Shared-Neighbor Distances Defeat the Curse of Dimensionality? [Citation Graph (, )][DBLP]


  67. Towards Archaeo-informatics: Scientific Data Management for Archaeobiology. [Citation Graph (, )][DBLP]


  68. Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces. [Citation Graph (, )][DBLP]


Search in 0.153secs, Finished in 0.157secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002