Semi-supervised learning with nuclear norm regularization

DOI10.1016/j.patcog.2013.01.009zbMath1316.68119OpenAlexW2007092202MaRDI QIDQ2353753

Yanyan Li

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

zbMATH Keywords

nuclear norm regularizationgraph Laplacianpairwise constraintssemi-supervised learning (SSL)low-rank kernel learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Orthogonal optimal reverse prediction for semi-supervised learning

Uses Software

• LIBSVM
• MNIST
• COIL-20

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

This page was built for publication: Semi-supervised learning with nuclear norm regularization