Sciweavers

171 search results - page 19 / 35
» Convex Sparse Matrix Factorizations
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
ALGORITHMICA
2007
114views more  ALGORITHMICA 2007»
14 years 9 months ago
The Consecutive Ones Submatrix Problem for Sparse Matrices
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
Jinsong Tan, Louxin Zhang
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
15 years 1 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo
ICML
2010
IEEE
14 years 10 months ago
A Simple Algorithm for Nuclear Norm Regularized Problems
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
Martin Jaggi, Marek Sulovský
SIAMJO
2010
246views more  SIAMJO 2010»
14 years 8 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...