Results 81 to 90 of about 2,091,920 (156)
Matrix Completion With Covariate Information
Journal of the American Statistical Association, 2018 This paper investigates the problem of matrix completion from corrupted data, when additional covariates are available. Despite being seldomly considered in the matrix completion literature, these covariates often provide valuable information for completing the unobserved entries of the high-dimensional target matrix A0. Given a covariate matrix X with
Xiaojun Mao +2 more
openaire +1 more source
Fast Exact Matrix Completion: A Unified Optimization Framework for Matrix Completion
, 2019 We formulate the problem of matrix completion with and without side information as a non-convex optimization problem. We design fastImpute based on non-convex gradient descent and show it converges to a global minimum that is guaranteed to recover closely the underlying matrix while it scales to matrices of sizes beyond $10^5 \times 10^5$.
Bertsimas, D, Li, ML
openaire +4 more sources
The doubly negative matrix completion problem [PDF]
, 2005 An $n\times n$ matrix over the field of real numbers is a doubly negative matrix if it is symmetric, negative definite and entry-wise negative. In this paper, we are interested in the doubly negative matrix completion problem, that is when does a ...
Araújo, C. Mendes +2 more
core +1 more source
RW-MC:self-adaptive random walk based matrix completion algorithm
Tongxin xuebao, 2017 Concerning the continually perceiving performance of virtual access points (VAP) was urgent in software-defined wireless network (SDWN),with the features of VAPs’ measurement data (VMD),a self-adaptive matrix completion algorithm based on random walk was
Xin-heng WANG +4 more
doaj +2 more sources
Survey of Matrix Completion Algorithms
CoRR, 2022 Matrix completion problem has been investigated under many different conditions since Netflix announced the Netflix Prize problem. Many research work has been done in the field once it has been discovered that many real life dataset could be estimated with a low-rank matrix.
openaire +2 more sources
The N-matrix completion problem under digraphs assumptions [PDF]
, 2004 An $n \times n$ matrix is called an $N$--matrix if all principal minors are negative. In this paper, we are interested in the partial $N$--matrix completion problem, when the partial $N$--matrix is non-combinatorially symmetric. In general, this type
Araújo, C. Mendes +2 more
core +1 more source
Doa estimation of array radar via compressive sampling and matrix completion
, 2015 With the requirement of high-precision and high-resolution, the huge data greatly increases data transmission and storage load. Compressive sampling and Matrix completion have received considerable attention recently, and has been applied successfully in
Bi X(毕欣) +2 more
core
The nonnegative Q−matrix completion problem [PDF]
, 2017 In this paper, the nonnegative $Q$-matrix completion problem is studied. A real $n\times n$ matrix is a $Q$-matrix if for $k\in \{1,\ldots, n\}$, the sum of all $k \times k$ principal minors is positive.
Sinha, Kalyan, Sarma, Bhaba Kumar
core
iMTF-GRN: Integrative Matrix Tri-Factorization for Inference of Gene Regulatory Networks
IEEE Access, 2019 Gene Regulatory Network (GRN) inference using computational approaches has been a highly pursued problem in bioinformatics. Various approaches have been developed to infer GRNs from gene expression data including statistical, machine learning and ...
Nisar Wani, Khalid Raza
doaj +1 more source
IEEE Access, 2020 Assessment of lower limb motion function is crucial for clinicians to treat patients effectively. However, diagnosis accuracy is still affected by clinical experience.
Yan Zhang +4 more
doaj +1 more source