Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low-Dimensional Spaces.
Yuval RabaniRakesh VenkatPublished in: CoRR (2017)
Keyphrases
- low rank
- low dimensional spaces
- high dimensional data
- low dimensional
- subspace clustering
- multi type
- dimensionality reduction
- matrix factorization
- high dimensional
- convex optimization
- latent space
- linear combination
- missing data
- singular value decomposition
- high dimensional spaces
- metric space
- semi supervised
- high order
- high dimensionality
- original data
- principal component analysis
- manifold learning
- neural network
- generative model
- data points
- missing values
- lower dimensional
- data objects
- nearest neighbor
- clustering algorithm
- image processing