A Fast Two-Level Approximate Euclidean Minimum Spanning Tree Algorithm for High-Dimensional Data.
Xia Li WangXiaochun WangXiaqiong LiPublished in: MLDM (2) (2018)
Keyphrases
- minimum spanning tree
- high dimensional data
- subspace clustering
- np hard
- learning algorithm
- computational complexity
- data sets
- input data
- data mining
- tree structure
- dimensional data
- search space
- spanning tree
- data analysis
- graph theory
- high dimensional datasets
- manifold learning
- dimension reduction
- sparse representation
- segmentation algorithm
- low dimensional
- dimensionality reduction
- nearest neighbor
- probabilistic model