534 search results - page 35 / 107 » Data Separation by Sparse Representations |
TSP
2010
13 years 4 months ago
2010
The Lasso is a popular technique for joint estimation and continuous variable selection, especially well-suited for sparse and possibly under-determined linear regression problems....
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
ICA
2004
Springer
14 years 3 months ago
2004
Springer
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
Statistical topic models such as the Latent Dirichlet Allocation (LDA) have emerged as an attractive framework to model, visualize and summarize large document collections in a co...
ICONIP
2007
13 years 11 months ago
2007
In the paper we derive and discuss a wide class of algorithms for 3D Super-symmetric nonnegative Tensor Factorization (SNTF) or nonnegative symmetric PARAFAC, and as a special case...