Manifold regularized matrix completion for multi-label learning with ADMM

DOI10.1016/j.neunet.2018.01.011zbMath1434.68423DBLPjournals/nn/LiuLX18OpenAlexW2791118824WikidataQ50421673 ScholiaQ50421673MaRDI QIDQ2179809

Zenglin Xu, Bin Liu, Yingming Li

Publication date: 13 May 2020

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2018.01.011

zbMATH Keywords

ADMMmatrix completionmulti-label learningmanifold assumption

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Matrix completion problems (15A83)

Related Items (2)

Transformed Schatten-1 penalty based full-rank latent label learning for incomplete multi-label classification ⋮ Graph transform learning

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Fast alternating linearization methods for minimizing the sum of two convex functions
• Fixed point and Bregman iterative methods for matrix rank minimization
• ML-KNN: A lazy learning approach to multi-label learning
• Multilabel classification via calibrated label ranking
• Exact matrix completion via convex optimization
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• A Singular Value Thresholding Algorithm for Matrix Completion
• The Split Bregman Method for L1-Regularized Problems
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Manifold Regularized Multitask Learning for Semi-Supervised Multilabel Image Classification

This page was built for publication: Manifold regularized matrix completion for multi-label learning with ADMM