Sciweavers

1203 search results - page 106 / 241
» Probabilistic Matrix Factorization
Sort
View
100
Voted
ESANN
2007
15 years 4 months ago
Collaborative Filtering with interlaced Generalized Linear Models
Collaborative Filtering (CF) aims at finding patterns in a sparse matrix of contingency. It can be used for example to mine the ratings given by users on a set of items. In this p...
Nicolas Delannay, Michel Verleysen
IPL
2006
89views more  IPL 2006»
15 years 2 months ago
Optimal 2-constraint satisfaction via sum-product algorithms
We show that for a given set of m pairwise constraints over n variables, a variable assignment that satisfies maximally many m constraints (MAX-2-CSP) can be found in O(nm dn/3) t...
Mikko Koivisto
IJON
2008
98views more  IJON 2008»
15 years 2 months ago
Factorisation and denoising of 0-1 data: A variational approach
Presence-absence (0-1) observations are special in that often the absence of evidence is not evidence of absence. Here we develop an independent factor model, which has the unique...
Ata Kabán, Ella Bingham
LCPC
1998
Springer
15 years 6 months ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...
IJCAI
2007
15 years 4 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert