9520 search results - page 1538 / 1904 » or 2011 |
208
click to vote
SDM
2011
SIAM
14 years 9 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...
198
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
224
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
Multi-instance (MI) learning is a variant of supervised learning where labeled examples consist of bags (i.e. multi-sets) of feature vectors instead of just a single feature vecto...
212
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
When multiple data sources are available for clustering, an a priori data integration process is usually required. This process may be costly and may not lead to good clusterings,...
362
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...