Clustering by Descending to the Nearest Neighbor in the Delaunay Graph Space.
Teng QiuYongjie LiPublished in: CoRR (2015)
Keyphrases
- nearest neighbor
- high dimensional data
- clustering algorithm
- graph theoretic
- data points
- knn
- graph clustering
- k nearest neighbor
- nearest neighbor algorithm
- graph construction
- equivalence classes
- k means
- high dimensional
- high dimensional spaces
- clustering method
- graph partitioning
- graph model
- low dimensional
- structured data
- search space
- spectral clustering
- graph mining
- nearest neighbor queries
- data clustering
- graph representation
- directed graph
- training set
- neighborhood graph
- distance function
- unsupervised learning
- directed acyclic graph
- weighted graph
- normalized cut
- document clustering
- distance metric
- data sets