Pairwise constraint propagation via low-rank matrix recovery

DOI10.1007/s41095-015-0011-7zbMath1428.68237DBLPjournals/cvm/Fu15OpenAlexW2178968221WikidataQ59434326 ScholiaQ59434326MaRDI QIDQ2288124

Zhenyong Fu

Publication date: 17 January 2020

Published in: Computational Visual Media (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41095-015-0011-7

zbMATH Keywords

matrix completionsemi-supervised learningpairwise constraint propagationconstrained clusteringlow-rank matrix recovery (LMR)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10)

Cites Work

• Fixed point and Bregman iterative methods for matrix rank minimization
• Exact matrix completion via convex optimization
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Introduction to Semi-Supervised Learning
• Numerical Optimization
• 10.1162/153244303321897735
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Modeling the shape of the scene: A holistic representation of the spatial envelope

This page was built for publication: Pairwise constraint propagation via low-rank matrix recovery