Sciweavers

764 search results - page 80 / 153
» Maximum-Margin Matrix Factorization
Sort
View
ESANN
2007
14 years 11 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»
14 years 10 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
LCPC
1998
Springer
15 years 2 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
14 years 11 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
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 4 months ago
Clustering with Multiple Graphs
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
Wei Tang, Zhengdong Lu, Inderjit S. Dhillon