Sciweavers

AAAI
2012
11 years 7 months ago
Colorization by Matrix Completion
Given 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 n...
Shusen Wang, Zhihua Zhang
SDM
2012
SIAM
294views Data Mining» more  SDM 2012»
11 years 7 months ago
Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, Guil...
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 7 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
JMLR
2012
11 years 7 months ago
High-Rank Matrix Completion
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
Brian Eriksson, Laura Balzano, Robert Nowak
CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 8 months ago
Rank Aggregation via Nuclear Norm Minimization
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...
David F. Gleich, Lek-Heng Lim
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
12 years 11 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
CORR
2011
Springer
241views Education» more  CORR 2011»
12 years 12 months ago
An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...
Yangyang Xu, Wotao Yin, Zaiwen Wen, Yin Zhang
CORR
2011
Springer
188views Education» more  CORR 2011»
12 years 12 months ago
Robust Matrix Completion with Corrupted Columns
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
Yudong Chen, Huan Xu, Constantine Caramanis, Sujay...
CORR
2006
Springer
178views Education» more  CORR 2006»
13 years 5 months ago
Low-rank matrix factorization with attributes
We develop a new collaborative filtering (CF) method that combines both previously known users' preferences, i.e. standard CF, as well as product/user attributes, i.e. classi...
Jacob Abernethy, Francis Bach, Theodoros Evgeniou,...
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 5 months ago
Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks
Spectrum sensing, which aims at detecting spectrum holes, is the precondition for the implementation of cognitive radio. Collaborative spectrum sensing among the cognitive radio n...
Jia Meng, Wotao Yin, Husheng Li, Ekram Hossain, Zh...