Results 71 to 80 of about 2,091,920 (156)
Toeplitz matrix completion via a low-rank approximation algorithm
Journal of Inequalities and Applications, 2020 In this paper, we propose a low-rank matrix approximation algorithm for solving the Toeplitz matrix completion (TMC) problem. The approximation matrix was obtained by the mean projection operator on the set of feasible Toeplitz matrices for every ...
Ruiping Wen, Yaru Fu
doaj +1 more source
Poisson Matrix Recovery and Completion [PDF]
IEEE Transactions on Signal Processing, 2016 Submitted to IEEE Journal. Parts of the paper have appeared in GlobalSIP 2013, GlobalSIP 2014, and ISIT 2015.
Yang Cao 0013, Yao Xie 0002
openaire +3 more sources
A Gradient System for Low Rank Matrix Completion
Axioms, 2018 In this article we present and discuss a two step methodology to find the closest low rank completion of a sparse large matrix. Given a large sparse matrix M, the method consists of fixing the rank to r and then looking for the closest rank-r matrix X to
Carmela Scalone, Nicola Guglielmi
doaj +1 more source
Adaptive multinomial matrix completion
Electronic Journal of Statistics, 2015 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
Idaho Completion Project’s Accelerated Retrieval Project Overview of the Pit 4 Non-Time Critical Removal Action [PDF]
, 2005 This paper presents an overview of the Accelerated Retrieval Project performed by the Idaho Completion Project at the Idaho National Laboratory (INL). Topics include an overall description of the process and methods that will retrieve, characterize, and ...
Arbon, R. E. +2 more
core
Prediction of circRNA-disease associations based on inductive matrix completion
BMC Medical Genomics, 2020 Background Currently, numerous studies indicate that circular RNA (circRNA) is associated with various human complex diseases. While identifying disease-related circRNAs in vivo is time- and labor-consuming, a feasible and effective computational method ...
Menglu Li +3 more
doaj +1 more source
A New Algorithm for Positive Semidefinite Matrix Completion
Journal of Applied Mathematics, 2016 Positive semidefinite matrix completion (PSDMC) aims to recover positive semidefinite and low-rank matrices from a subset of entries of a matrix. It is widely applicable in many fields, such as statistic analysis and system control.
Fangfang Xu, Peng Pan
doaj +1 more source
Functional correspondence by matrix completion [PDF]
2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015 "Functional Correspondence by Matrix Completion" (CVPR 2015): This paper, presented at one of the world's top AI conferences, is almost entirely fabricated, and its results are not ...
Artiom Kovnatsky +3 more
openaire +4 more sources
Graph theoretic methods for matrix completion problems [PDF]
, 2001 A pattern is a list of positions in an n×n real matrix. A matrix completion problem for the class of Π-matrices asks whether every partial Π-matrix whose specified entries are exactly the positions of the pattern can be completed to a Π-matrix. We survey
Leslie Hogben, Hogben, Leslie
core +1 more source
CoRR, 2018 Completing a data matrix X has become an ubiquitous problem in modern data science, with applications in recommender systems, computer vision, and networks inference, to name a few. One typical assumption is that X is low-rank. A more general model assumes that each column of X corresponds to one of several low-rank matrices.
openaire +3 more sources