Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CIKM
2000
Springer

favoriteEmaildiscussreport

81views Information Technology» more CIKM 2000»

High Performance Clustering Based on the Similarity Join

13 years 9 months ago

High Performance Clustering Based on the Similarity Join

Download www.dbs.informatik.uni-muenchen.de

Christian Böhm, Bernhard Braunmüller, Ma

Real-time Traffic

CIKM 2000 | Information Management |

claim paper

Related Content

» High Performance Data Mining Using the Nearest Neighbor Join

» High Dimensional Similarity Joins Algorithms and Performance Evaluation

» TrieJoin Efficient Triebased String Similarity Joins with EditDistance Constraints

» Exploiting MapReducebased similarity joins

» HighDimensional Similarity Joins

» Epsilon Grid Order An Algorithm for the Similarity Join on Massive HighDimensional Data

» Clustering for Approximate Similarity Search in HighDimensional Spaces

» Accuracy of Approximate String Joins Using Grams

» Probabilistic Similarity Join on Uncertain Data

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	CIKM
Authors	Christian Böhm, Bernhard Braunmüller, Markus M. Breunig, Hans-Peter Kriegel

Comments (0)