Results 41 to 50 of about 2,091,920 (156)
Empirical Bayes matrix completion [PDF]
Computational Statistics & Data Analysis, 2019 We develop an empirical Bayes (EB) algorithm for the matrix completion problems. The EB algorithm is motivated from the singular value shrinkage estimator for matrix means by Efron and Morris (1972). Since the EB algorithm is essentially the EM algorithm applied to a simple model, it does not require heuristic parameter tuning other than tolerance ...
Takeru Matsuda, Fumiyasu Komaki
openaire +2 more sources
The P_0^+-matrix completion problem [PDF]
, 2015 A real n by n matrix B is a P_0^+ -matrix if for each k in {1, 2, . . . , n} every k by k principal minor of B is nonnegative, and at least one k by k principal minor is positive. A digraph D is said to have P_0^+-completion if every partial P_0^+-matrix
Sinha, Kalyan +2 more
core +1 more source
Methods for matrix completion [PDF]
, 2021 In this paper, we are going to provide major results for two sorts of Matrix Completion problems. One involves the recovery of a low rank matrix and the other involves the recovery of an approximately low rank matrix based on a small number of observed ...
Pasumarty, Rich
core +1 more source
Matrix completion discriminant analysis [PDF]
Computational Statistics & Data Analysis, 2015 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 ...
Tong Tong Wu, Kenneth Lange
openaire +3 more sources
The Q-matrix completion problem [PDF]
, 2009 A real n x n matrix is a Q-matrix if for every k = 1, 2, . . . , n the sum of all k x k principal minors is positive. A digraph D is said to have Q-completion if every partial Q-matrix specifying D can be completed to a Q-matrix.
DeAlba,, Luz +5 more
core +1 more source
Matrix completion with structure [PDF]
, 2016 Often, data organized in matrix form contains missing entries. Further, such data has been observed to exhibit effective low-rank, and has led to interest in the particular problem of low-rank matrix-completion: Given a partially-observed matrix ...
Ruchansky, Natali
core +1 more source
Non-Linear Matrix Completion for Social Image Tagging
IEEE Access, 2017 In this paper, we address the problem of social image tagging using practical vocabulary for mobile users on the social media. On the social media, images usually have an incomplete or noisy set of social tags provided by the mobile users, and we ...
Xing Xu +4 more
doaj +1 more source
Cooperative Electromagnetic Data Annotation via Low-Rank Matrix Completion
Remote Sensing, 2022 Electromagnetic data annotation is one of the most important steps in many signal processing applications, e.g., radar signal deinterleaving and radar mode analysis.
Wei Zhang +5 more
doaj +1 more source
CoRR, 2014 The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard, Candès and Recht showed that it can be exactly relaxed if the number of observed entries is sufficiently large.
Vassilis Kalofolias +3 more
openaire +3 more sources
The CP-Matrix Completion Problem [PDF]
SIAM Journal on Matrix Analysis and Applications, 2014 arXiv admin note: text overlap with arXiv:1210.6930 by other ...
Anwa Zhou, Jinyan Fan
openaire +3 more sources