Subspace clustering for indexing high dimensional data: a main memory index based on local reductions and individual multi-representations.
Stephan GünnemannHardy KremerDominik LenhardThomas SeidlPublished in: EDBT (2011)
Keyphrases
- main memory
- subspace clustering
- high dimensional data
- index structure
- nearest neighbor
- indexing techniques
- secondary memory
- b tree
- indexing structure
- inverted index
- data structure
- similarity search
- similarity queries
- clustering high dimensional data
- database management systems
- high dimensional
- dimensionality reduction
- r tree
- subspace clusters
- low dimensional
- data distribution
- high dimensionality
- data analysis
- data points
- range queries
- data sets
- database
- join algorithms
- multi dimensional
- hash table
- query processing
- original data
- external memory
- clustering method
- metric space
- complex data
- text data
- distance function
- high dimensional feature spaces
- computer vision
- knn
- text classification
- linear discriminant analysis
- data model
- training set
- lower dimensional
- high dimensional spaces
- training data
- data management
- neural network
- tree structure