A fast clustering algorithm based on pruning unnecessary distance computations in DBSCAN for high-dimensional data.
Yewang ChenShengyu TangNizar BouguilaCheng WangJi-Xiang DuHailin LiPublished in: Pattern Recognit. (2018)
Keyphrases
- high dimensional data
- clustering algorithm
- distance computation
- nearest neighbor
- similarity search
- dimensionality reduction
- distance function
- k means
- high dimensional
- high dimensionality
- k nearest neighbor
- subspace clustering
- clustering method
- data points
- nearest neighbor search
- data clustering
- low dimensional
- data sets
- data analysis
- similarity queries
- dimension reduction
- locality sensitive hashing
- edit distance
- data distribution
- cluster analysis
- euclidean distance
- multi step
- dense regions
- knn
- pattern recognition
- feature selection
- linear discriminant analysis
- spectral clustering
- arbitrary shape
- high dimensional datasets
- learning algorithm
- r tree
- feature space
- similarity measure
- feature extraction
- clustering quality
- database systems
- image processing