Semi-supervised learning with nuclear norm regularization
From MaRDI portal
Publication:2353753
DOI10.1016/j.patcog.2013.01.009zbMath1316.68119MaRDI QIDQ2353753
Publication date: 16 July 2015
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2013.01.009
nuclear norm regularization; graph Laplacian; pairwise constraints; semi-supervised learning (SSL); low-rank kernel learning
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed point and Bregman iterative methods for matrix rank minimization
- Exact matrix completion via convex optimization
- Graph Transduction as a Noncooperative Game
- A Singular Value Thresholding Algorithm for Matrix Completion
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Two-Point Step Size Gradient Methods
- The minimum-rank gram matrix completion via modified fixed point continuation method