BibSLEIGH — Thomas

Travelled to:

1 × Austria
1 × Egypt
1 × France
1 × Greece
1 × Norway
1 × Russia
1 × Turkey
1 × United Kingdom
2 × Canada
3 × China
8 × USA

Collaborated with:

S.Günnemann I.Assent E.Müller H.Kriegel I.Färber C.Beecks M.Wichterich J.Enderle R.Krieger P.Kranen H.Kremer B.Boden C.Brochhaus T.Jansen M.Hassani P.Spaus M.Schiffer S.Wiedenfeld N.Schneider M.Hampel M.Pötke M.S.Uysal J.Schmücking M.Rüdiger H.Hoffmann K.Virochsiri M.Sundermeyer M.J.Zaki M.Peters M.Ankerst B.Braunmüller S.Wels T.Rohlfs S.Raubach M.Krulis J.Lokoc T.Skopal A.Bifet G.Holmes B.Pfahringer

Talks about:

cluster (13) subspac (12) databas (8) effici (8) data (7) base (6) multimedia (5) similar (4) project (4) search (4)

Person: Thomas Seidl

DBLP: Seidl:Thomas

Contributed to:

2014

2012

2011

2010

2009

2008

2007

2005

2004

2000

1998

1997

Wrote 30 papers:

CIKM-2014-UysalBSS #approximate #database #distance #multi #performance #scalability #using: Efficient Filter Approximation Using the Earth Mover’s Distance in Very Large Multimedia Databases with Feature Signatures (MSU, CB, JS, TS), pp. 979–988.
KDD-2014-GunnemannFRS #clustering #multi #named: SMVC: semi-supervised multi-view clustering in subspace projections (SG, IF, MR, TS), pp. 253–262.
MLDM-2014-HassaniSS #adaptation #clustering #multi: Adaptive Multiple-Resolution Stream Clustering (MH, PS, TS), pp. 134–148.
CIKM-2012-BodenGS #clustering #evolution #graph: Tracing clusters in evolving graphs with node attributes (BB, SG, TS), pp. 2331–2334.
CIKM-2012-KranenWRRS #algorithm #automation #evaluation: A tool for automated evaluation of algorithms (PK, SW, TR, SR, TS), pp. 2692–2694.
KDD-2012-BodenGHS #graph #mining #multi: Mining coherent subgraphs in multi-layer graphs with edge labels (BB, SG, HH, TS), pp. 1258–1266.
KDD-2012-GunnemannFS #clustering #modelling #multi #using: Multi-view clustering using mixture models in subspace projections (SG, IF, TS), pp. 132–140.
KDD-2012-GunnemannFVS #clustering #correlation: Subspace correlation clustering: finding locally correlated dimensions in subspace projections of the data (SG, IF, KV, TS), pp. 352–360.
CIKM-2011-GunnemannFMAS #clustering #evaluation #metric: External evaluation measures for subspace clustering (SG, IF, EM, IA, TS), pp. 1363–1372.
CIKM-2011-KrulisLBSS #architecture #distance #gpu #manycore #polynomial: Processing the signature quadratic form distance on many-core GPU architectures (MK, JL, CB, TS, TS), pp. 2373–2376.
CIKM-2011-MullerAGS #clustering #scalability: Scalable density-based subspace clustering (EM, IA, SG, TS), pp. 1077–1086.
KDD-2011-KremerKJSBHP #clustering #data type #effectiveness #evaluation #evolution: An effective evaluation measure for clustering on evolving data streams (HK, PK, TJ, TS, AB, GH, BP), pp. 868–876.
CIKM-2010-MullerSS #adaptation #ranking: Adaptive outlierness for subspace outlier ranking (EM, MS, TS), pp. 1629–1632.
ICPR-2010-BeecksWS #multi #performance: Improving the Efficiency of Content-Based Multimedia Exploration (CB, SW, TS), pp. 3163–3166.
VLDB-2010-GunnemannFKS #clustering #concept #interactive #named: CoDA: Interactive Cluster Based Concept Discovery (SG, IF, HK, TS), pp. 1633–1636.
CIKM-2009-GunnemannMFS #concept #detection #orthogonal: Detection of orthogonal concepts in subspaces of high dimensional data (SG, EM, IF, TS), pp. 1317–1326.
CIKM-2009-WichterichBSS #database #distance #feedback #multi: Exploring multimedia databases via optimization-based relevance feedback and the earth mover’s distance (MW, CB, MS, TS), pp. 1621–1624.
VLDB-2009-AssentWKKS #database #performance #similarity: Anticipatory DTW for Efficient Similarity Search in Time Series Databases (IA, MW, RK, HK, TS), pp. 826–837.
VLDB-2009-MullerGAS #clustering: Evaluating Clustering in Subspace Projections of High Dimensional Data (EM, SG, IA, TS), pp. 1270–1281.
CIKM-2008-AssentKMS #clustering #named #performance: EDSC: efficient density-based subspace clustering (IA, RK, EM, TS), pp. 1093–1102.
KDD-2008-MullerAKJS #clustering #interactive #named: Morpheus: interactive exploration of subspace clustering (EM, IA, RK, TJ, TS), pp. 1089–1092.
SIGMOD-2008-WichterichAKS #database #flexibility #multi #performance #reduction #similarity: Efficient EMD-based similarity search in multimedia databases via flexible dimensionality reduction (MW, IA, PK, TS), pp. 199–212.
VLDB-2007-BrochhausS #named: IndeGS: Index Supported Graphics Data Server for CFD Data Postprocessing (CB, TS), pp. 1354–1357.
KDD-2005-ZakiPAS #algorithm #category theory #clustering #dataset #effectiveness #mining #named: CLICKS: an effective algorithm for mining subspace clusters in categorical datasets (MJZ, MP, IA, TS), pp. 736–742.
VLDB-2005-EnderleSS #database #query #relational #tuple: Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases (JE, NS, TS), pp. 385–396.
SIGMOD-2004-EnderleHS #database #relational: Joining Interval Data in Relational Databases (JE, MH, TS), pp. 683–694.
VLDB-2000-KriegelPS #database: Managing Intervals Efficiently in Object-Relational Databases (HPK, MP, TS), pp. 407–418.
SIGMOD-1998-SeidlK #multi #nearest neighbour: Optimal Multi-Step k-Nearest Neighbor Search (TS, HPK), pp. 154–165.
VLDB-1998-AnkerstBKS #adaptation #approximate #query #similarity #using: Improving Adaptable Similarity Query Processing by Using Approximations (MA, BB, HPK, TS), pp. 206–217.
VLDB-1997-SeidlK #adaptation #database #multi #performance #scalability #similarity: Efficient User-Adaptable Similarity Search in Large Multimedia Databases (TS, HPK), pp. 506–515.