Results 51 to 60 of about 3,678,430 (211)
Matrix completion discriminant analysis [PDF]
Matrix completion discriminant analysis (MCDA) is designed for semi-supervised learning where the rate of missingness is high and predictors vastly outnumber cases. MCDA operates by mapping class labels to the vertices of a regular simplex. With c classes, these vertices are arranged on the surface of the unit sphere in c - 1 dimensional Euclidean ...
Wu, Tong Tong, Lange, Kenneth
openaire +2 more sources
Low-Rank Matrix Completion: A Contemporary Survey
As a paradigm to recover unknown entries of a matrix from partial observations, low-rank matrix completion (LRMC) has generated a great deal of interest.
Luong Trung Nguyen +2 more
doaj +1 more source
Nonconvex matrix completion with Nesterov’s acceleration
Background In matrix completion fields, the traditional convex regularization may fall short of delivering reliable low-rank estimators with good prediction performance. Previous works use the alternation least squares algorithm to optimize the nonconvex
Xiao-Bo Jin +4 more
doaj +1 more source
Matrix Completion With Noise [PDF]
On the heels of compressed sensing, a new field has very recently emerged. This field addresses a broad range of problems of significant practical interest, namely, the recovery of a data matrix from what appears to be incomplete, and perhaps even ...
E. Candès, Y. Plan
semanticscholar +1 more source
Binary Matrix Completion With Nonconvex Regularizers
Many practical problems involve the recovery of a binary matrix from partial information, so the binary matrix completion (BMC) technique has increasingly been of interest in machine learning. In particular, we consider a special case of the BMC problems,
Chunsheng Liu, Hong Shan
doaj +1 more source
High-Performance Homomorphic Matrix Completion on Multiple GPUs
In various applications such as trajectory tracking in mobile social networks and online recommendation systems, the massive raw data are often incomplete due to various unpredictable or unavoidable reasons. Matrix completion algorithms are effective for
Tao Zhang, Han Lu, Xiao-Yang Liu
doaj +1 more source
Adaptive multinomial matrix completion
The task of estimating a matrix given a sample of observed entries is known as the \emph{matrix completion problem}. Most works on matrix completion have focused on recovering an unknown real-valued low-rank matrix from a random sample of its entries. Here, we investigate the case of highly quantized observations when the measurements can take only a ...
Klopp, Olga +3 more
openaire +5 more sources
Anomaly-Tolerant Traffic Matrix Estimation via Prior Information Guided Matrix Completion
Network management, planning, and optimization rely on accurate and complete traffic measurement. However, anomalies and missing data are inevitable in direct traffic measurement because of high measurement costs and unreliable network transport ...
Wencai Ye +4 more
doaj +1 more source
A regularised deep matrix factorised model of matrix completion for image restoration
It has been an important approach of using matrix completion to perform image restoration. Most previous works on matrix completion focus on the low‐rank property by imposing explicit constraints on the recovered matrix, such as the constraint of the ...
Zhemin Li +3 more
doaj +1 more source
Accelerated Path Tracing With GAN and Matrix Completion
Denoising-based techniques have recently been shown to be effective for accelerating path tracing rendering methods. However, there remains a problem which is input images need the minimum necessary samples number in order to ensure the quality of the ...
Qiwei Xing, Chunyi Chen, Zhihua Li
doaj +1 more source

