502 search results - page 5 / 101 » Sparse Subspace Clustering |
106
click to vote
JMLR
2012
13 years 5 days ago
2012
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
DAGSTUHL
2007
14 years 11 months ago
2007
Abstract. Increasingly large multimedia databases in life sciences, ecommerce, or monitoring applications cannot be browsed manually, but require automatic knowledge discovery in d...
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
Pattern recognition problems often suffer from the larger intra-class variation due to situation variations such as pose, walking speed, and clothing variations in gait recognition...
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...