Travelled to:
1 × Canada
10 × USA
2 × China
2 × France
Collaborated with:
C.Plant H.Kriegel P.Kröger S.Berchtold B.Braunmüller C.Faloutsos E.Achtert B.Wackersreuther A.Zimek D.A.Keim M.C.Altinigneli P.Kunath A.Pryakhin M.Renz J.Shao Q.Yang R.Noll K.Haegler N.S.Müller J.Pan K.Kailing M.M.Breunig M.Schubert J.Feng X.He B.Konte F.Fiedler A.Oswald
Talks about:
cluster (8) search (4) neighbor (3) similar (3) nearest (3) space (3) base (3) use (3) dimension (2) parallel (2)
Person: Christian Böhm
DBLP: B=ouml=hm:Christian
Contributed to:
Wrote 18 papers:
- KDD-2013-AltinigneliPB #parallel #using
- Massively parallel expectation maximization using graphics processing units (MCA, CP, CB), pp. 838–846.
- KDD-2012-FengHKBP #graph #mining
- Summarization-based mining bipartite graphs (JF, XH, BK, CB, CP), pp. 1249–1257.
- KDD-2011-PlantB #category theory #clustering #named
- INCONCO: interpretable clustering of numerical and categorical objects (CP, CB), pp. 1127–1135.
- KDD-2010-BohmPSY #clustering
- Clustering by synchronization (CB, CP, JS, QY), pp. 583–592.
- CIKM-2009-BohmFOPW #probability #query
- Probabilistic skyline queries (CB, FF, AO, CP, BW), pp. 651–660.
- CIKM-2009-BohmNPW #clustering #using
- Density-based clustering using graphics processors (CB, RN, CP, BW), pp. 661–670.
- KDD-2009-BohmHMP #detection #named
- CoCo: coding cost for parameter-free outlier detection (CB, KH, NSM, CP), pp. 149–158.
- SIGMOD-2008-BohmFP #clustering #component #independence #using
- Outlier-robust clustering using independent components (CB, CF, CP), pp. 185–198.
- CIKM-2006-AchtertBKKPR #approximate #metric #nearest neighbour #query
- Approximate reverse k-nearest neighbor queries in general metric spaces (EA, CB, PK, PK, AP, MR), pp. 788–789.
- KDD-2006-AchtertBKKZ #clustering #correlation #modelling
- Deriving quantitative models for correlation clusters (EA, CB, HPK, PK, AZ), pp. 4–13.
- KDD-2006-BohmFPP #clustering #robust
- Robust information-theoretic clustering (CB, CF, JYP, CP), pp. 65–75.
- SIGMOD-2006-AchtertBKKPR #metric #nearest neighbour #performance
- Efficient reverse k-nearest neighbor search in arbitrary metric spaces (EA, CB, PK, PK, AP, MR), pp. 515–526.
- SIGMOD-2004-BohmKKZ #clustering #correlation
- Computing Clusters of Correlation Connected Objects (CB, KK, PK, AZ), pp. 455–466.
- CIKM-2000-BohmBBK #clustering #performance #similarity
- High Performance Clustering Based on the Similarity Join (CB, BB, MMB, HPK), pp. 298–305.
- SIGMOD-1998-BerchtoldBK #towards
- The Pyramid-Technique: Towards Breaking the Curse of Dimensionality (SB, CB, HPK), pp. 142–153.
- PODS-1997-BerchtoldBKK #cost analysis #nearest neighbour
- A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space (SB, CB, DAK, HPK), pp. 78–86.
- SIGMOD-1997-BerchtoldBBKK #database #parallel #performance #similarity
- Fast Parallel Similarity Search in Multimedia Databases (SB, CB, BB, DAK, HPK), pp. 1–12.
- ADL-2000-BohmBKS #library #performance #similarity
- Efficient Similarity Search in Digital Libraries (CB, BB, HPK, MS), pp. 193–199.