Pairwise constraint propagation via low-rank matrix recovery
From MaRDI portal
Publication:2288124
Recommendations
- Exhaustive and efficient constraint propagation: a graph-based learning approach and its applications
- Ranking recovery from limited pairwise comparisons using low-rank matrix completion
- Exact matrix completion via convex optimization
- Pairwise constrained concept factorization for data representation
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
Cites work
- 10.1162/153244303321897735
- A Singular Value Thresholding Algorithm for Matrix Completion
- Exact matrix completion via convex optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- Introduction to semi-supervised learning.
- Modeling the shape of the scene: A holistic representation of the spatial envelope
- Numerical Optimization
- Robust principal component analysis?
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(3)
This page was built for publication: Pairwise constraint propagation via low-rank matrix recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288124)