7150 search results - page 960 / 1430 » Graph-Based Data Mining |
177
click to vote
SDM
2011
SIAM
14 years 7 months ago
2011
SIAM
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
162
click to vote
SDM
2011
SIAM
14 years 7 months ago
2011
SIAM
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
141
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world ap...
146
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
142
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...