Results 61 to 70 of about 2,091,920 (156)
The matrix completion problem [PDF]
, 2011 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
Hybrid Matrix Completion Model for Improved Images Recovery and Recommendation Systems
IEEE Access, 2021 Matrix completion methods have been widely applied in images recovery and recommendation systems. Most of them are only based on the low-rank characteristics of matrices to predict the missing entries.
Kai Xu +4 more
doaj +1 more source
Overlap matrix completion for predicting drug-associated indications.
PLoS Computational Biology, 2019 Identification of potential drug-associated indications is critical for either approved or novel drugs in drug repositioning. Current computational methods based on drug similarity and disease similarity have been developed to predict drug-disease ...
Mengyun Yang +4 more
doaj +1 more source
CoRR, 2017 We propose a novel algorithm for sequential matrix completion in a recommender system setting, where the $(i,j)$th entry of the matrix corresponds to a user $i$'s rating of product $j$. The objective of the algorithm is to provide a sequential policy for user-product pair recommendation which will yield the highest possible ratings after a finite time ...
Annie Marsden, Sergio Bacallado
openaire +3 more sources
NGS based haplotype assembly using matrix completion.
PLoS ONE, 2019 We apply matrix completion methods for haplotype assembly from NGS reads to develop the new HapSVT, HapNuc, and HapOPT algorithms. This is performed by applying a mathematical model to convert the reads to an incomplete matrix and estimating unknown ...
Sina Majidian, Mohammad Hossein Kahaei
doaj +1 more source
Linear Algebra and its Applications, 2009 In the paper the author gives results about the following two problems over an arbitrary field: Problem 1. Under which conditions does there exist a matrix with prescribed eigenvalues, characteristic polynomials, when some of its entries are prescribed and others vary. Problem 2.
openaire +1 more source
Tensor factorization based method for low rank matrix completion and its application on tensor completion [PDF]
, 2022 Low rank matrix and tensor completion problems are to recover the incomplete two and higher order data by using their low rank structures. The essential problem in the matrix and tensor completion problems is how to improve the efficiency.
Yu, Quan, Zhang, Xinzhen
core +1 more source
Structured matrix estimation and completion [PDF]
Bernoulli, 2019 We study the problem of matrix estimation and matrix completion under a general framework. This framework includes several important models as special cases such as the gaussian mixture model, mixed membership model, bi-clustering model and dictionary learning.
Klopp, Olga +3 more
openaire +4 more sources
Computing the nearest euclidean distance matrix with low embedding dimensions [PDF]
, 2013 Euclidean distance embedding appears in many high-profile applications including wireless sensor network localization, where not all pairwise distances among sensors are known or accurate.
Qi, Hou-Duo, Yuan, Xiaoming, Qi, Hou Duo
core +1 more source
The symmetric N-matrix completion problem [PDF]
, 2005 An $n\times n$ matrix is called an $N$-matrix if all its principal minors are negative. In this paper, we are interested in the symmetric $N$-matrix completion problem, that is, when a partial symmetric $N$-matrix has a symmetric $N$-matrix completion.
Araújo, C. Mendes +2 more
core +1 more source