502 search results - page 41 / 101 » Sparse Subspace Clustering |
117
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
Although most of existing research usually detects events by analyzing the content or structural information of Web documents, a recent direction is to study the usage data. In th...
134
click to vote
MM
2006
ACM
15 years 8 months ago
2006
ACM
In many image retrieval applications, the mapping between highlevel semantic concept and low-level features is obtained through a learning process. Traditional approaches often as...
111
click to vote
BIBE
2004
IEEE
15 years 5 months ago
2004
IEEE
In microarray gene expression data, clusters may hide in subspaces. Traditional clustering algorithms that make use of similarity measurements in the full input space may fail to ...
104
click to vote
IPSN
2007
Springer
15 years 8 months ago
2007
Springer
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...
102
click to vote
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...