Faster connectivity in low-rank hypergraphs via expander decomposition.
Calvin BeidemanKarthekeyan ChandrasekaranSagnik MukhopadhyayDanupon NanongkaiPublished in: CoRR (2020)
Keyphrases
- low rank
- tensor decomposition
- missing data
- linear combination
- matrix factorization
- matrix completion
- convex optimization
- rank minimization
- low rank matrix
- semi supervised
- high dimensional data
- kernel matrix
- singular value decomposition
- high order
- matrix decomposition
- low rank representation
- low rank matrices
- singular values
- minimization problems
- trace norm
- non rigid structure from motion
- missing values
- collaborative filtering
- data analysis
- training data