35 search results - page 6 / 7 » The Consecutive Ones Submatrix Problem for Sparse Matrices |
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
Discriminant Analysis (DA) methods have demonstrated their utility in countless applications in computer vision and other areas of research ? especially in the C class classificat...
NIPS
2004
13 years 7 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
SIAMJO
2010
13 years 4 months ago
2010
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...
AAAI
2010
13 years 7 months ago
2010
Matrix factorization is a fundamental technique in machine learning that is applicable to collaborative filtering, information retrieval and many other areas. In collaborative fil...
JACM
2011
12 years 8 months ago
2011
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...