Results 1 to 10 of about 741,212 (154)
Poisson Matrix Completion [PDF]
2015 IEEE International Symposium on Information Theory (ISIT), 2015 We extend the theory of matrix completion to the case where we make Poisson observations for a subset of entries of a low-rank matrix. We consider the (now) usual matrix recovery formulation through maximum likelihood with proper constraints on the ...
Cao, Yang, Xie, Yao
core +3 more sources
Categorical Matrix Completion [PDF]
2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2015 We consider the problem of completing a matrix with categorical-valued entries from partial observations. This is achieved by extending the formulation and theory of one-bit matrix completion. We recover a low-rank matrix $X$ by maximizing the likelihood
Cao, Yang, Xie, Yao
core +2 more sources
Correntropy Based Matrix Completion [PDF]
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 +2 more
doaj +3 more sources
Information and Inference, 2014 In this paper we develop a theory of matrix completion for the extreme case of noisy 1-bit observations. Instead of observing a subset of the real-valued entries of a matrix M, we obtain a small number of binary (1-bit) measurements generated according ...
Berg, Ewout van den +3 more
core +2 more sources
Matrix completion with queries [PDF]
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2017 In many applications, e.g., recommender systems and traffic monitoring, the data comes in the form of a matrix that is only partially observed and low rank.
Crovella, Mark +2 more
core +3 more sources
Regularization for Matrix Completion [PDF]
2010 IEEE International Symposium on Information Theory, 2010 We consider the problem of reconstructing a low rank matrix from noisy observations of a subset of its entries. This task has applications in statistical learning, computer vision, and signal processing.
Keshavan, Raghunandan H. +1 more
core +2 more sources
Double matrix completion for circRNA-disease association prediction [PDF]
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 +4 more
doaj +2 more sources
Predicting miRNA-Disease Association Based on Neural Inductive Matrix Completion with Graph Autoencoders and Self-Attention Mechanism [PDF]
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 +3 more
doaj +2 more sources
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.).
Crovella, Mark +2 more
core +2 more sources
SeqBMC: Single‐cell data processing using iterative block matrix completion algorithm based on matrix factorisation [PDF]
IET Systems BiologyWith the development of high‐throughput sequencing technology, the analysis of single‐cell RNA sequencing data has become the focus of current research.
Gong Lejun +4 more
doaj +2 more sources