Can Shared-Neighbor Distances Defeat the Curse of Dimensionality?
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 482-500
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Clustering high-dimensional dataACM Transactions on Knowledge Discovery From Data, 2009
- A General Framework for Increasing the Robustness of PCA-Based Correlation Clustering Algorithms2008
- Distance Based Subspace Clustering with Flexible Dimension Partitioning2007
- Subspace clustering for high dimensional dataACM SIGKDD Explorations Newsletter, 2004
- Subspace Clustering of High Dimensional Data2004
- FINDIT: a fast and intelligent subspace clustering algorithm using dimension votingInformation and Software Technology, 2004
- On the Surprising Behavior of Distance Metrics in High Dimensional Space2001
- Re-designing distance functions and distance-based applications for high dimensional dataACM SIGMOD Record, 2001
- Density-based indexing for approximate nearest-neighbor queries1999
- When Is “Nearest Neighbor” Meaningful?1999