Finding Dense Subgraphs via Low-Rank Bilinear Optimization.
Dimitris S. PapailiopoulosIoannis MitliagkasAlexandros G. DimakisConstantine CaramanisPublished in: ICML (2014)
Keyphrases
- low rank
- singular value decomposition
- convex optimization
- missing data
- low rank matrix
- rank minimization
- linear combination
- matrix factorization
- matrix completion
- high order
- high dimensional data
- semi supervised
- dense subgraphs
- graph mining
- norm minimization
- least squares
- bipartite graph
- dimensionality reduction
- principal component analysis
- high dimensional
- social networks