Results 21 to 30 of about 2,091,920 (156)

Local low-rank approach to nonlinear matrix completion

EURASIP Journal on Advances in Signal Processing, 2021
This paper deals with a problem of matrix completion in which each column vector of the matrix belongs to a low-dimensional differentiable manifold (LDDM), with the target matrix being high or full rank.
Ryohei Sasaki, Katsumi Konishi, Tomohiro Takahashi, Toshihiro Furukawa   +3 more
doaj   +1 more source

Robust matrix completion [PDF]

Probability Theory and Related Fields, 2016
This paper considers the problem of recovery of a low-rank matrix in the situation when most of its entries are not observed and a fraction of observed entries are corrupted. The observations are noisy realizations of the sum of a low rank matrix, which we wish to recover, with a second matrix having a complementary sparse structure such as element ...
Klopp, Olga, Lounici, Karim, Tsybakov, Alexandre B.   +2 more
openaire   +3 more sources

Correntropy Based Matrix Completion

Entropy, 2018
This paper studies the matrix completion problems when the entries are contaminated by non-Gaussian noise or outliers. The proposed approach employs a nonconvex loss function induced by the maximum correntropy criterion.
Yuning Yang, Yunlong Feng, Johan A. K. Suykens   +2 more
doaj   +1 more source

Minimizing the condition number of a positive definite matrix by completion [PDF]

, 1994
Elsner L, He C, Mehrmann V. Minimizing the condition number of a positive definite matrix by completion. Numerische Mathematik. 1994;69(1):17-23.We consider the problem of minimizing the spectral condition number of a positive definite matrix by ...
Mehrmann, Volker, He, Chunyang, Elsner, Ludwig   +2 more
core   +1 more source

Low-Rank Matrix Completion: A Contemporary Survey

IEEE Access, 2019
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, Junhan Kim, Byonghyo Shim   +2 more
doaj   +1 more source

Targeted matrix completion [PDF]

, 2017
Matrix completion is a problem that arises in many data-analysis settings where the input consists of a partially-observed matrix (e.g., recommender systems, traffic matrix analysis etc.). Classical approaches to matrix completion assume that the input partially-observed matrix is low rank. The success of these methods depends on the number of observed
Natali Ruchansky, Mark Crovella, Evimaria Terzi   +2 more
openaire   +2 more sources

The matrix completion problem [PDF]

, 2022
Nowadays, the relevant amount of information exchanges force the experts to create more reliable, secure and error-less devices through which these can happen.
Nalin, Gianmarco
core  

cleary-lab/Inhibition-Neutralization-Completion: Initial release

, 2022
Matrix completion applied to viral neutralization ...
cleary-lab, Tal Einav
core   +1 more source

Predicting miRNA-Disease Association Based on Neural Inductive Matrix Completion with Graph Autoencoders and Self-Attention Mechanism

Biomolecules, 2022
Many studies have clarified that microRNAs (miRNAs) are associated with many human diseases. Therefore, it is essential to predict potential miRNA-disease associations for disease pathogenesis and treatment.
Chen Jin, Zhuangwei Shi, Ken Lin, Han Zhang   +3 more
doaj   +1 more source

Double matrix completion for circRNA-disease association prediction

BMC Bioinformatics, 2021
Background Circular RNAs (circRNAs) are a class of single-stranded RNA molecules with a closed-loop structure. A growing body of research has shown that circRNAs are closely related to the development of diseases. Because biological experiments to verify
Zong-Lan Zuo, Rui-Fen Cao, Pi-Jing Wei, Jun-Feng Xia, Chun-Hou Zheng   +4 more
doaj   +1 more source