| 2009 |
| 65 | | Christian Böhm,
L. Läer,
Claudia Plant,
Andrew Zherdin:
Model-based Classification of Data with Time Series-valued Attributes.
BTW 2009: 287-296 |
| 64 | | Christian Böhm,
R. Noll,
Claudia Plant,
Andrew Zherdin:
Indexsupported Similarity Join on Graphics Processors.
BTW 2009: 57-66 |
| 2008 |
| 63 | EE | Christian Böhm,
Claudia Plant:
HISSCLU: a hierarchical density-based method for semi-supervised clustering.
EDBT 2008: 440-451 |
| 62 | EE | Elke Achtert,
Christian Böhm,
Jörn David,
Peer Kröger,
Arthur Zimek:
Robust Clustering in Arbitrarily Oriented Subspaces.
SDM 2008: 763-774 |
| 61 | EE | Christian Böhm,
Christos Faloutsos,
Claudia Plant:
Outlier-robust clustering using independent components.
SIGMOD Conference 2008: 185-198 |
| 60 | EE | Christian Böhm:
Pyramid Technique.
Encyclopedia of GIS 2008: 929-930 |
| 2007 |
| 59 | EE | Christian Böhm,
Peter Kunath,
Alexey Pryakhin,
Matthias Schubert:
Effective and Efficient Indexing for Large Video Databases.
BTW 2007: 132-151 |
| 58 | EE | Elke Achtert,
Christian Böhm,
Peer Kröger,
Peter Kunath,
Alexey Pryakhin,
Matthias Renz:
Efficient Reverse k-Nearest Neighbor Estimation.
BTW 2007: 344-363 |
| 57 | EE | Elke Achtert,
Christian Böhm,
Hans-Peter Kriegel,
Peer Kröger,
Ina Müller-Gorman,
Arthur Zimek:
Detection and Visualization of Subspace Cluster Hierarchies.
DASFAA 2007: 152-163 |
| 56 | EE | Christian Böhm,
Michael Gruber,
Peter Kunath,
Alexey Pryakhin,
Matthias Schubert:
ProVeR: Probabilistic Video Retrieval using the Gauss-Tree.
ICDE 2007: 1521-1522 |
| 55 | EE | Christian Böhm,
Beng Chin Ooi,
Claudia Plant,
Ying Yan:
Efficiently Processing Continuous k-NN Queries on Data Streams.
ICDE 2007: 156-165 |
| 54 | EE | Elke Achtert,
Christian Böhm,
Hans-Peter Kriegel,
Peer Kröger,
Arthur Zimek:
Robust, Complete, and Efficient Correlation Clustering.
SDM 2007 |
| 53 | EE | Elke Achtert,
Christian Böhm,
Hans-Peter Kriegel,
Peer Kröger,
Arthur Zimek:
On Exploring Complex Relationships of Correlation Clusters.
SSDBM 2007: 7 |
| 52 | EE | Christian Böhm,
Peter Kunath,
Alexey Pryakhin,
Matthias Schubert:
Querying Objects Modeled by Arbitrary Probability Distributions.
SSTD 2007: 294-311 |
| 51 | EE | Elke Achtert,
Christian Böhm,
Peer Kröger,
Peter Kunath,
Alexey Pryakhin,
Matthias Renz:
Efficient reverse k-nearest neighbor estimation.
Inform., Forsch. Entwickl. 21(3-4): 179-195 (2007) |
| 50 | EE | Christian Böhm,
Christos Faloutsos,
Jia-Yu Pan,
Claudia Plant:
RIC: Parameter-free noise-robust clustering.
TKDD 1(3): (2007) |
| 2006 |
| 49 | | Yannis E. Ioannidis,
Marc H. Scholl,
Joachim W. Schmidt,
Florian Matthes,
Michael Hatzopoulos,
Klemens Böhm,
Alfons Kemper,
Torsten Grust,
Christian Böhm:
Advances in Database Technology - EDBT 2006, 10th International Conference on Extending Database Technology, Munich, Germany, March 26-31, 2006, Proceedings
Springer 2006 |
| 48 | EE | Elke Achtert,
Christian Böhm,
Peer Kröger,
Peter Kunath,
Alexey Pryakhin,
Matthias Renz:
Approximate reverse k-nearest neighbor queries in general metric spaces.
CIKM 2006: 788-789 |
| 47 | EE | Christian Böhm,
Alexey Pryakhin,
Matthias Schubert:
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors.
ICDE 2006: 9 |
| 46 | EE | Elke Achtert,
Christian Böhm,
Hans-Peter Kriegel,
Peer Kröger,
Arthur Zimek:
Deriving quantitative models for correlation clusters.
KDD 2006: 4-13 |
| 45 | EE | Christian Böhm,
Christos Faloutsos,
Jia-Yu Pan,
Claudia Plant:
Robust information-theoretic clustering.
KDD 2006: 65-75 |
| 44 | EE | Elke Achtert,
Christian Böhm,
Peer Kröger:
DeLi-Clu: Boosting Robustness, Completeness, Usability, and Efficiency of Hierarchical Clustering by a Closest Pair Ranking.
PAKDD 2006: 119-128 |
| 43 | EE | Elke Achtert,
Christian Böhm,
Hans-Peter Kriegel,
Peer Kröger,
Ina Müller-Gorman,
Arthur Zimek:
Finding Hierarchies of Subspace Clusters.
PKDD 2006: 446-453 |
| 42 | EE | Elke Achtert,
Christian Böhm,
Peer Kröger,
Peter Kunath,
Alexey Pryakhin,
Matthias Renz:
Efficient reverse k-nearest neighbor search in arbitrary metric spaces.
SIGMOD Conference 2006: 515-526 |
| 41 | EE | Elke Achtert,
Christian Böhm,
Peer Kröger,
Arthur Zimek:
Mining Hierarchies of Correlation Clusters.
SSDBM 2006: 119-128 |
| 40 | EE | Christian Böhm,
Alexey Pryakhin,
Matthias Schubert:
Probabilistic Ranking Queries on Gaussians.
SSDBM 2006: 169-178 |
| 39 | EE | Claudia Plant,
Christian Böhm,
Bernhard Tilg,
Christian Baumgartner:
Enhancing instance-based classification with local density: a new algorithm for classifying unbalanced biomedical data.
Bioinformatics 22(8): 981-988 (2006) |
| 38 | EE | Elke Achtert,
Christian Böhm,
Stefan Brecheisen,
Hans-Peter Kriegel,
Peter Kunath,
Alexey Pryakhin,
Matthias Renz,
Matthias Schubert:
Komplexe Objektbeschreibungen zur Suche in Multimedia-Datenbanken.
Datenbank-Spektrum 19: 32-39 (2006) |
| 2005 |
| 37 | EE | Elke Achtert,
Christian Böhm,
Hans-Peter Kriegel,
Peer Kröger:
Online Hierarchical Clustering in a Data Warehouse Environment.
ICDM 2005: 10-17 |
| 36 | EE | Christian Böhm,
Hans-Peter Kriegel,
Peer Kröger,
Petra Linhart:
Selectivity Estimation of High Dimensional Window Queries via Clustering.
SSTD 2005: 1-18 |
| 35 | EE | Christian Baumgartner,
Kurt Gautsch,
Christian Böhm,
Stephan Felber:
Functional Cluster Analysis of CT Perfusion Maps: A New Tool for Diagnosis of Acute Stroke?
J. Digital Imaging 18(3): 219-226 (2005) |
| 34 | EE | Christian Baumgartner,
Christian Böhm,
Daniela Baumgartner:
Modelling of classification rules on metabolic patterns including machine learning and expert knowledge.
Journal of Biomedical Informatics 38(2): 89-98 (2005) |
| 2004 |
| 33 | EE | Christian Böhm,
Karin Kailing,
Hans-Peter Kriegel,
Peer Kröger:
Density Connected Clustering with Local Subspace Preferences.
ICDM 2004: 27-34 |
| 32 | EE | Christian Böhm,
Karin Kailing,
Peer Kröger,
Arthur Zimek:
Computing Clusters of Correlation Connected Objects.
SIGMOD Conference 2004: 455-466 |
| 31 | EE | Christian Baumgartner,
Christian Böhm,
Daniela Baumgartner,
G. Marini,
K. Weinberger,
B. Olgemöller,
B. Liebl,
A. A. Roscher:
Supervised machine learning techniques for the classification of metabolic disorders in newborns.
Bioinformatics 20(17): 2985-2996 (2004) |
| 30 | | Christian Böhm,
Karin Kailing,
Peer Kröger,
Hans-Peter Kriegel:
Immer größere und komplexere Datenmengen: Herausforderungen für Clustering-Algorithmen.
Datenbank-Spektrum 9: 11-17 (2004) |
| 29 | EE | Christian Böhm,
Florian Krebs:
The k-Nearest Neighbour Join: Turbo Charging the KDD Process.
Knowl. Inf. Syst. 6(6): 728-749 (2004) |
| 2003 |
| 28 | EE | Christian Böhm,
Florian Krebs:
Supporting KDD Applications by the k-Nearest Neighbor Join.
DEXA 2003: 504-516 |
| 2002 |
| 27 | EE | Christian Böhm,
Florian Krebs,
Hans-Peter Kriegel:
Optimal Dimension Order: A Generic Technique for the Similarity Join.
DaWaK 2002: 135-149 |
| 26 | EE | Christian Böhm,
Florian Krebs:
High Performance Data Mining Using the Nearest Neighbor Join.
ICDM 2002: 43-50 |
| 25 | EE | Christian Böhm,
Hans-Peter Kriegel:
Optimale Dimensionswahl bei der Bearbeitung des Similarity Join.
Inform., Forsch. Entwickl. 17(2): 68-76 (2002) |
| 24 | | Christian Böhm,
Hans-Peter Kriegel,
Thomas Seidl:
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search.
J. Intell. Inf. Syst. 19(2): 207-230 (2002) |
| 2001 |
| 23 | EE | Christian Böhm,
Hans-Peter Kriegel:
Determining the Convex Hull in Large Multidimensional Databases.
DaWaK 2001: 294-306 |
| 22 | EE | Christian Böhm,
Hans-Peter Kriegel,
Thomas Seidl:
Adaptable Similarity Search Using Vector Quantization.
DaWaK 2001: 317-327 |
| 21 | EE | Christian Böhm,
Hans-Peter Kriegel:
A Cost Model and Index Architecture for the Similarity Join.
ICDE 2001: 411-420 |
| 20 | EE | Stefan Berchtold,
Christian Böhm,
Daniel A. Keim,
Florian Krebs,
Hans-Peter Kriegel:
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces.
ICDT 2001: 435-449 |
| 19 | EE | Christian Böhm,
Bernhard Braunmüller,
Florian Krebs,
Hans-Peter Kriegel:
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data.
SIGMOD Conference 2001: 379-388 |
| 18 | EE | Christian Böhm,
Stefan Berchtold,
Daniel A. Keim:
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases.
ACM Comput. Surv. 33(3): 322-373 (2001) |
| 2000 |
| 17 | EE | Christian Böhm,
Bernhard Braunmüller,
Hans-Peter Kriegel,
Matthias Schubert:
Efficient Similarity Search in Digital Libraries.
ADL 2000: 193-206 |
| 16 | EE | Christian Böhm,
Bernhard Braunmüller,
Markus M. Breunig,
Hans-Peter Kriegel:
High Performance Clustering Based on the Similarity Join.
CIKM 2000: 298-305 |
| 15 | EE | Stefan Berchtold,
Christian Böhm,
Daniel A. Keim,
Hans-Peter Kriegel,
Xiaowei Xu:
Optimal Multidimensional Query Processing Using Tree Striping.
DaWaK 2000: 244-257 |
| 14 | EE | Christian Böhm,
Bernhard Braunmüller,
Hans-Peter Kriegel:
The Pruning Power: Theory and Heuristics for Mining Databases with Multiple k-Nearest-Neighbor Queries.
DaWaK 2000: 372-381 |
| 13 | EE | Christian Böhm,
Hans-Peter Kriegel:
Dynamically Optimizing High-Dimensional Index Structures.
EDBT 2000: 36-50 |
| 12 | EE | Stefan Berchtold,
Christian Böhm,
H. V. Jagadish,
Hans-Peter Kriegel,
Jörg Sander:
Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces.
ICDE 2000: 577-588 |
| 11 | EE | Christian Böhm:
A cost model for query processing in high dimensional data spaces.
ACM Trans. Database Syst. 25(2): 129-178 (2000) |
| 10 | | Christian Böhm,
Stefan Berchtold,
Hans-Peter Kriegel,
Urs Michel:
Multidimensional Index Structures in Relational Databases.
J. Intell. Inf. Syst. 15(1): 51-70 (2000) |
| 1999 |
| 9 | EE | Christian Böhm,
Hans-Peter Kriegel:
Efficient Bulk Loading of Large High-Dimensional Indexes.
DaWaK 1999: 251-260 |
| 8 | EE | Stefan Berchtold,
Christian Böhm,
Hans-Peter Kriegel,
Urs Michel:
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases.
DaWaK 1999: 261-270 |
| 7 | EE | Christian Böhm,
Gerald Klump,
Hans-Peter Kriegel:
XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension.
SSD 1999: 75-90 |
| 6 | | Christian Böhm:
Efficiently Indexing High-Dimensional Data Spaces (Abstract).
Datenbank Rundbrief 23: 23-24 (1999) |
| 1998 |
| 5 | EE | Stefan Berchtold,
Christian Böhm,
Hans-Peter Kriegel:
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations.
EDBT 1998: 216-230 |
| 4 | EE | Stefan Berchtold,
Christian Böhm,
Hans-Peter Kriegel:
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality.
SIGMOD Conference 1998: 142-153 |
| 1997 |
| 3 | EE | Stefan Berchtold,
Christian Böhm,
Daniel A. Keim,
Hans-Peter Kriegel:
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space.
PODS 1997: 78-86 |
| 2 | EE | Stefan Berchtold,
Christian Böhm,
Bernhard Braunmüller,
Daniel A. Keim,
Hans-Peter Kriegel:
Fast Parallel Similarity Search in Multimedia Databases.
SIGMOD Conference 1997: 1-12 |
| 1995 |
| 1 | | Christian Böhm,
A. Oppitz,
Pavel Vogel,
Stephan Wiesener:
Prints of the 17th Century in a Distributed Library System
DEXA 1995: 68-78 |