Sparse Subspace Clustering via Closure Subgraph Based on Directed Graph.
Yuefeng MaXun LiangPublished in: PCM (1) (2016)
Keyphrases
- directed graph
- subspace clustering
- high dimensional
- graph properties
- subgraph mining
- high dimensional data
- random walk
- clustering method
- subspace clusters
- clustering high dimensional data
- clustering algorithm
- directed acyclic graph
- subspace projections
- high dimensionality
- edge weights
- undirected graph
- low dimensional
- data points
- graph structure
- directed edges
- np hard
- graph databases
- graph mining
- strongly connected
- dimensionality reduction
- data analysis
- pattern recognition
- similarity measure