Results 71 to 80 of about 3,678,430 (211)
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
IEEE Access, 2021 Matrix completion has been widely used in image recovery and recommendation. The conventional matrix completion models based on multi-layer perceptron (MLP) only has local constraints on the observation data so that the completed matrix contains a lot of
Xuan Hu, Yongming Han, Zhiqiang Geng
doaj +1 more source
IEEE Access, 2021 The resolution related with the image quality of acoustic imaging using a microphone array is limited by the size and density of the array. However, non-synchronous measurements can exceed the constraints defined by measurements with a single fixed array.
Liang Yu +5 more
doaj +1 more source
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
Matrix Completion on Graphs [PDF]
, 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.
Bresson, Xavier +3 more
core +2 more sources
Link Prediction via Matrix Completion
, 2016 Inspired by practical importance of social networks, economic networks, biological networks and so on, studies on large and complex networks have attracted a surge of attentions in the recent years.
Cheng, Hong +4 more
core +1 more source
NOISY MATRIX COMPLETION: UNDERSTANDING STATISTICAL GUARANTEES FOR CONVEX RELAXATION VIA NONCONVEX OPTIMIZATION. [PDF]
SIAM J Optim, 2020 This paper studies noisy low-rank matrix completion: given partial and noisy entries of a large low-rank matrix, the goal is to estimate the underlying matrix faithfully and efficiently.
Chen Y, Chi Y, Fan J, Ma C, Yan Y.
europepmc +3 more sources
Low-rank Matrix Completion using Alternating Minimization
, 2012 Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem of low-rank matrix completion, this method is believed to be one of the ...
Jain, Prateek +2 more
core +1 more source
Molecular Therapy: Nucleic Acids, 2020 In this study, we proposed an ensemble learning method, simultaneously integrating a low-rank matrix completion model and a ridge regression model to predict anticancer drug response on cancer cell lines.
Chuanying Liu +8 more
semanticscholar +1 more source