Sciweavers

266 search results - page 8 / 54
» High-Rank Matrix Completion
Sort
View
FFA
2011
90views more  FFA 2011»
13 years 2 months ago
Finite group algebras of nilpotent groups: A complete set of orthogonal primitive idempotents
We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of ...
Inneke Van Gelder, Gabriela Olteanu
ML
2006
ACM
121views Machine Learning» more  ML 2006»
13 years 7 months ago
Model-based transductive learning of the kernel matrix
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 11 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
CORR
2010
Springer
89views Education» more  CORR 2010»
13 years 7 months ago
Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm
We show that matrix completion with tracenorm regularization can be significantly hurt when entries of the matrix are sampled nonuniformly. We introduce a weighted version of the ...
Ruslan Salakhutdinov, Nathan Srebro
JSAT
2006
126views more  JSAT 2006»
13 years 7 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...