Results 231 to 240 of about 158,513 (260)

Active Matrix Completion

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, Jiayu Zhou, Vineeth Nallure Balasubramanian, Sethuraman Panchanathan, Ian Davidson, Jieping Ye   +5 more
openaire   +1 more source

Distributed Matrix Completion

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, Faraz Makari, Rainer Gemulla   +2 more
openaire   +2 more sources

Optimal Discrete Matrix Completion

Proceedings of the AAAI Conference on Artificial Intelligence, 2016
In recent years, matrix completion methods have been successfully applied to solve recommender system applications. Most of them focus on the matrix completion problem in real number domain, and produce continuous prediction values. However, these methods are not appropriate in some occasions where the entries of matrix are discrete ...
Zhouyuan Huo, Ji Liu, Heng Huang 0001
openaire   +1 more source

On a Class of Matrix Completion Problems

Mathematische Nachrichten, 1989
The 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., Fritzsche, Bernd, Kirstein, Bernd   +2 more
openaire   +2 more sources

Deterministic algorithms for matrix completion

Random Structures & Algorithms, 2013
ABSTRACTThe goal of the matrix completion problem is to retrieve an unknown real matrix from a small subset of its entries. This problem comes up in many application areas, and has received a great deal of attention in the context of the Netflix challenge. This setup usually represents our partial knowledge of some information domain.
Eyal Heiman, Gideon Schechtman, Adi Shraibman   +2 more
openaire   +1 more source

Homomorphic Matrix Completion

Advances in Neural Information Processing Systems 35, 2022
Xiao-Yang Liu, Zechu (Steven) Li, Xiaodong Wang   +2 more
openaire   +2 more sources

Probabilistic Matrix Completion

2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI), 2022
Xuan Li 0001, Li Zhang 0065
openaire   +1 more source

ALTERNATING AUTOENCODERS FOR MATRIX COMPLETION

2018 IEEE Data Science Workshop (DSW), 2018
We 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

Matrix Completions and Chordal Graphs

Acta Mathematica Sinica, English Series, 2003
This paper is an introduction to few problems and results in matrix completion problems. The topics which are considered here include questions on norm completions, rank completions, positive definite completions, numerical range completion properties and rank decomposability.
openaire   +2 more sources

Robust Matrix Completion With Column Outliers

IEEE Transactions on Cybernetics, 2022
Rong Wang, Feiping Nie, Ziheng Li
exaly