Finding k-Closest-Pairs Efficiently for High Dimensional Data.
Mary InabaHiroshi ImaiPublished in: CCCG (2000)
Keyphrases
- high dimensional data
- nearest neighbor
- data points
- dimensionality reduction
- low dimensional
- high dimensional
- high dimensions
- high dimensionality
- similarity search
- data analysis
- data sets
- linear discriminant analysis
- subspace clustering
- clustering high dimensional data
- dimension reduction
- input space
- dimensional data
- high dimensional spaces
- original data
- high dimensional datasets
- sparse representation
- manifold learning
- nonlinear dimensionality reduction
- data distribution
- complex data
- database
- lower dimensional
- variable selection
- pairwise
- text data
- decision trees
- training set
- subspace learning
- knn
- feature extraction
- training data
- high dimensional data sets
- high dimensional feature spaces