Sciweavers

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

8

SSDBM
2010
IEEE

favoriteEmaildiscussreport

164views Database» more SSDBM 2010»

Can Shared-Neighbor Distances Defeat the Curse of Dimensionality?

13 years 10 months ago

Can Shared-Neighbor Distances Defeat the Curse of Dimensionality?

Download research.nii.ac.jp

Michael E. Houle, Hans-Peter Kriegel, Peer Krö

Real-time Traffic

Database | SSDBM 2010 |

claim paper

Related Content

» A Probabilistic Spell for the Curse of Dimensionality

» Using the Distance Distribution for Approximate Similarity Queries in HighDimensional Metr...

» HighDimensional Similarity Retrieval Using Dimensional Choice

» An information geometric approach to supervised dimensionality reduction

» PAC Nearest Neighbor Queries Approximate and Controlled Search in HighDimensional and Metr...

» Optimal dimensionality of metric space for classification

» Dimensionality Reduction and Similarity Computation by Inner Product Approximations

» Indexing highdimensional data in dual distance spaces a symmetrical encoding approach

» Improving Nearest Neighbor Classification with Cam Weighted Distance

Post Info
More Details (n/a)

Added	10 Jul 2010
Updated	10 Jul 2010
Type	Conference
Year	2010
Where	SSDBM
Authors	Michael E. Houle, Hans-Peter Kriegel, Peer Kröger, Erich Schubert, Arthur Zimek

Comments (0)