Finding k-Closest-Pairs Efficiently for High Dimensional Data.
Mario Alberto LópezSwanwa LiaoPublished in: CCCG (2000)
Keyphrases
- high dimensional data
- nearest neighbor
- data points
- dimensionality reduction
- high dimensional
- high dimensions
- high dimensionality
- low dimensional
- data sets
- subspace clustering
- manifold learning
- similarity search
- input space
- high dimensional spaces
- lower dimensional
- data distribution
- complex data
- data analysis
- dimension reduction
- clustering high dimensional data
- original data
- database
- pairwise
- text data
- dimensional data
- training set
- high dimensional datasets
- training data
- variable selection
- index structure
- input data
- high dimensional feature spaces