Adaptive Quantile Low-Rank Matrix Factorization

  title={Adaptive Quantile Low-Rank Matrix Factorization},
  author={Shuang Xu and Chunxia Zhang and Jiangshe Zhang},
Abstract Low-rank matrix factorization (LRMF) has received much popularity owing to its successful applications in both computer vision and data mining. By assuming noise to come from a Gaussian, Laplace or mixture of Gaussian distributions, significant efforts have been made on optimizing the (weighted) L1 or L2-norm loss between an observed matrix and its bilinear factorization. However, the type of noise distribution is generally unknown in real applications and inappropriate assumptions… Expand
Robust CP Tensor Factorization With Skew Noise
This letter proposes a novel LRTF model for skew data analysis by modeling noise as a Mixture of Asymmetric Laplacians (MoAL) and shows that the new model MoAL-LRTF outperforms several state-of-the-art counterparts. Expand
Total Variation Constrained Graph-Regularized Convex Non-Negative Matrix Factorization for Data Representation
The results of clustering experiments on multiple datasets show the effectiveness and robustness of the proposed method compared to state-of-the-art clustering methods and other related work. Expand
Drug–target interaction prediction using unifying of graph regularized nuclear norm with bilinear factorization
A new approach based on unifying matrix factorization and nuclear norm minimization is proposed to find a low-rank interaction and the results show an improvement in the performance of the proposed method compared to the state-of-the-art techniques. Expand
Outlier-Resilient Web Service QoS Prediction
This paper proposes an outlier-resilient QoS prediction method that utilizes Cauchy loss to measure the discrepancy between the observed QoS values and the predicted ones and demonstrates that it is able to achieve better performance than state-of-the-art baseline methods. Expand
Outlier Resilient Collaborative Web Service QoS Prediction
A robust collaborative QoS prediction method that utilizes Cauchy loss to measure the discrepancy between the observed QoS values and the predicted ones and is able to achieve better performance than state-of-the-art baseline methods. Expand


Robust Low-Rank Matrix Factorization Under General Mixture Noise Distributions.
Many computer vision problems can be posed as learning a low-dimensional subspace from high-dimensional data. The low rank matrix factorization (LRMF) represents a commonly utilized subspace learningExpand
Robust Low-Rank Matrix Factorization Under General Mixture Noise Distributions
This paper proposes a new LRMF model by assuming noise as mixture of exponential power (MoEP) distributions and then proposes a penalized MoEP (PMoEP) model by combining the penalized likelihood method with MoEP distributions. Expand
A Generalized Model for Robust Tensor Factorization With Noise Modeling by Mixture of Gaussians
This paper considers integrating the noise modeling technique into a generalized weighted LRTF (GWLRTF) procedure and indicates the respective advantages of these two versions of MoG GWLRTF in various applications and also demonstrates their effectiveness compared with other competing methods. Expand
Robust Matrix Factorization with Unknown Noise
A low-rank matrix factorization problem with a Mixture of Gaussians (MoG) noise, which is a universal approximator for any continuous distribution, and hence is able to model a wider range of real noise distributions. Expand
A Cyclic Weighted Median Method for L1 Low-Rank Matrix Factorization with Missing Entries
This paper proposes a novel cyclic weighted median (CWM) method, which is intrinsically a coordinate decent algorithm, for L1-norm LRMF, and demonstrates that the CWM method outperforms state-of-the-arts in terms of both accuracy and computational efficiency. Expand
Efficient low rank matrix approximation via orthogonality pursuit and ℓ2 regularization
This paper attempts to simultaneously achieve the computational efficiency as well as the robustness to mild rank initialization and gross corruptions and uses several Augmented Lagrange Multiplier based solvers and a heuristic rank estimator to seek the optimal solution. Expand
Elastic nonnegative matrix factorization
This work derives an elastic NMF model guided by the elastic loss with incorporating geometry manifold information while enforcing sparsity of coefficients at intra-cluster level via l1,2-norm which is more robust to noises while preserving the stronger capability of clustering. Expand
Efficient $l_{1}$ -Norm-Based Low-Rank Matrix Approximations for Large-Scale Problems Using Alternating Rectified Gradient Method
Two efficient low-rank factorization methods based on the l1-norm that find proper projection and coefficient matrices using the alternating rectified gradient method are proposed. Expand
A Probabilistic Approach to Robust Matrix Factorization
Experiments show that PRMF is comparable to other state-of-the-art robust matrix factorization methods in terms of accuracy and outperforms them particularly for large data matrices. Expand
Low-rank nonnegative matrix factorization on Stiefel manifold
This paper proposes a novel method for low-rank nonnegative matrix factorization on a Stiefel manifold (LNMFS), which utilizes the low rank structure of intrinsic data and transforms it into a Frobenius norm of the latent factors. Expand