Results 1 to 10 of about 42,588 (304)
An \(n \times n\) matrix is called an \(N\)-matrix if all principal minors are negative. The authors prove that a combinatorially symmetric partial \(N\)-matrix has an \(N\)-matrix completion if the graph of its specified entries is a 1-chordal graph.
C Mendes Araujo +2 more
exaly +5 more sources
Explicit solutions to correlation matrix completion problems, with an application to risk management and insurance [PDF]
We derive explicit solutions to the problem of completing a partially specified correlation matrix. Our results apply to several block structures for the unspecified entries that arise in insurance and risk management, where an insurance company with ...
Dan I. Georgescu +2 more
doaj +2 more sources
Apply Optimized Tensor Completion Method by Bayesian CP-Factorization for Image Recovery [PDF]
In this paper, we are going to analyze big data (embedded in the digital images) with new methods of tensor completion (TC). The determination of tensor ranks and the type of decomposition are significant and essential matters.
Ali Reza Shojaeifard +2 more
doaj +1 more source
A Nonconvex Method to Low-Rank Matrix Completion
In recent years, the problem of recovering a low-rank matrix from partial entries, known as low-rank matrix completion problem, has attracted much attention in many applications.
Haizhen He +3 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
Fusion Algorithm for Matrix Completion Prediction Based on Probabilistic Meta-learning [PDF]
With the rapid development of Internet social media,using recommendation algorithms to effectively model and filter massive amounts of information has become the key to predict user behavior preferences,hot spot tendency,network security si-tuation and ...
QI Xiu-xiu, WANG Jia-hao, LI Wen-xiong, ZHOU Fan
doaj +1 more source
The CP-Matrix Completion Problem [PDF]
arXiv admin note: text overlap with arXiv:1210.6930 by other ...
Anwa Zhou, Jinyan Fan
openaire +2 more sources
Nonconvex Tensor Relative Total Variation for Image Completion
Image completion, which falls to a special type of inverse problems, is an important but challenging task. The difficulties lie in that (i) the datasets usually appear to be multi-dimensional; (ii) the unavailable or corrupted data entries are randomly ...
Yunqing Bai, Jihong Pei, Min Li
doaj +1 more source
Rank-Adaptive Tensor Completion Based on Tucker Decomposition
Tensor completion is a fundamental tool to estimate unknown information from observed data, which is widely used in many areas, including image and video recovery, traffic data completion and the multi-input multi-output problems in information theory ...
Siqi Liu, Xiaoyu Shi, Qifeng Liao
doaj +1 more source
Rail transit OD‐matrix completion via manifold regularized tensor factorisation
Urban rail transit has become an indispensable mode in major cities worldwide regarding the advantages of large capacity, high speed, punctuality, and environmental protection.
Hanxuan Dong +5 more
doaj +1 more source

