Sciweavers

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

56

KDD
1998
ACM

favoriteEmaildiscussreport

166views Data Mining» more KDD 1998»

Comparing Massive High-Dimensional Data Sets

15 years 1 months ago

Comparing Massive High-Dimensional Data Sets

Download www.aaai.org

Theodore Johnson, Tamraparni Dasu

Real-time Traffic

Data Mining | KDD 1998 |

claim paper

Related Content

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

» Hierarchical Clustering of Massive High Dimensional Data Sets by Exploiting Ultrametric Em...

» Vector Approximation based Indexing for Nonuniform High Dimensional Data Sets

» 3D Variational Brain Tumor Segmentation using a High Dimensional Feature Set

» DiskBased Sampling for Outlier Detection in High Dimensional Data

» Scalable Clustering for Large HighDimensional Data Based on Data Summarization

» Robust clustering in high dimensional data using statistical depths

» HighDimensional OLAP A Minimal Cubing Approach

» Coresets and Sketches for High Dimensional Subspace Approximation Problems

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	KDD
Authors	Theodore Johnson, Tamraparni Dasu

Comments (0)