Results 271 to 280 of about 164,304 (297)
Some of the next articles are maybe not open access.
Colorization by Matrix Completion
Proceedings of the AAAI Conference on Artificial Intelligence, 2021Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a novel approach to the colorization problem by formulating it as a matrix completion problem.
Shusen Wang, Zhihua Zhang 0008
openaire +1 more source
Network Completion: Beyond Matrix Completion
2021 International Conference on Information Networking (ICOIN), 2021Due to practical reasons such as limited resources and privacy settings specified by users on social media, most network data tend to be only partially observed with both missing nodes and missing edges. Thus, it is of paramount importance to infer the missing parts of the networks since incomplete network data may severely degrade the performance of ...
Cong Tran, Won-Yong Shin
openaire +1 more source
2013 IEEE 13th International Conference on Data Mining, 2013
Recovering a matrix from a sampling of its entries is a problem of rapidly growing interest and has been studied under the name of matrix completion. It occurs in many areas of engineering and applied science. In most machine learning and data mining applications, it is possible to leverage the expertise of human oracles to improve the performance of ...
Shayok Chakraborty +5 more
openaire +1 more source
Recovering a matrix from a sampling of its entries is a problem of rapidly growing interest and has been studied under the name of matrix completion. It occurs in many areas of engineering and applied science. In most machine learning and data mining applications, it is possible to leverage the expertise of human oracles to improve the performance of ...
Shayok Chakraborty +5 more
openaire +1 more source
2012 IEEE 12th International Conference on Data Mining, 2012
We discuss parallel and distributed algorithms for large-scale matrix completion on problems with millions of rows, millions of columns, and billions of revealed entries. We focus on in-memory algorithms that run on a small cluster of commodity nodes, even very large problems can be handled effectively in such a setup.
Christina Teflioudi +2 more
openaire +2 more sources
We discuss parallel and distributed algorithms for large-scale matrix completion on problems with millions of rows, millions of columns, and billions of revealed entries. We focus on in-memory algorithms that run on a small cluster of commodity nodes, even very large problems can be handled effectively in such a setup.
Christina Teflioudi +2 more
openaire +2 more sources
ALTERNATING AUTOENCODERS FOR MATRIX COMPLETION
2018 IEEE Data Science Workshop (DSW), 2018We consider autoencoders (AEs) for matrix completion (MC) with application to collaborative filtering (CF) for recommedation systems. It is observed that for a given sparse user-item rating matrix, denoted as ${\boldsymbol {M}}$, an AE performs matrix factorization so that the recovered matrix is represented as a product of user and item feature ...
Kiwon Lee, Yong Hoon Lee, Changho Suh
openaire +1 more source
On a Class of Matrix Completion Problems
Mathematische Nachrichten, 1989The paper contains a unified treatment of special classes of matrix extension problems (``Schur analysis''). It is characterized as a combination of methods developed by V. P. Potapov and his collaborators in the study of the so-called fundamental matrix inequalities and of methods used by the last two authors.
Dubovoj, Vladimir K. +2 more
openaire +2 more sources
Advances in Neural Information Processing Systems 35, 2022
Xiao-Yang Liu +2 more
openaire +2 more sources
Xiao-Yang Liu +2 more
openaire +2 more sources
Probabilistic Matrix Completion
2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI), 2022Xuan Li 0001, Li Zhang 0065
openaire +1 more source
A Note on Matrix Completion Problems
Algebra Colloquium, 2012Matrix completion problems are an important subclass of problems in matrix theory. An important question in matrix completion problems was posed by Oliveira in 1975, where the author proposed the description of the characteristic polynomial of a partitioned matrix of the form A = [Ai,j], i, j ∈ {1,2} (whose entries are in a field and A1,1, A2,2 are ...
openaire +2 more sources
Robust Matrix Completion With Column Outliers
IEEE Transactions on Cybernetics, 2022Feiping Nie, Ziheng Li, Zhanxuan Hu
exaly