Sciweavers

143 search results - page 6 / 29
» Probabilistic matrix tri-factorization
Sort
View
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 1 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
SDM
2010
SIAM
217views Data Mining» more  SDM 2010»
13 years 6 months ago
Collaborative Filtering: Weighted Nonnegative Matrix Factorization Incorporating User and Item Graphs
Collaborative filtering is an important topic in data mining and has been widely used in recommendation system. In this paper, we proposed a unified model for collaborative fil...
Quanquan Gu, Jie Zhou, Chris H. Q. Ding
JMLR
2006
132views more  JMLR 2006»
13 years 7 months ago
Accurate Error Bounds for the Eigenvalues of the Kernel Matrix
The eigenvalues of the kernel matrix play an important role in a number of kernel methods, in particular, in kernel principal component analysis. It is well known that the eigenva...
Mikio L. Braun
TIT
2008
74views more  TIT 2008»
13 years 7 months ago
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
Vince Grolmusz
SAGA
2007
Springer
14 years 1 months ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis