502 search results - page 2 / 101 » Sparse Subspace Clustering |
ICA
2007
Springer
14 years 12 days ago
2007
Springer
ICDM
2009
IEEE
13 years 4 months ago
2009
IEEE
Text classification poses some specific challenges. One such challenge is its high dimensionality where each document (data point) contains only a small subset of them. In this pap...
ICA
2004
Springer
13 years 11 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
13 years 10 months ago
2007
IEEE
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
PAKDD
2009
ACM
14 years 1 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...