23 search results - page 3 / 5 » sdm 2011 |
SDM
2011
SIAM
13 years 1 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...
SDM
2011
SIAM
13 years 1 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...
SDM
2011
SIAM
13 years 1 months ago
2011
SIAM
Popular data mining methods support knowledge discovery from patterns that hold in binary relations. We study the generalization of association rule mining within arbitrary n-ary ...
SDM
2011
SIAM
13 years 1 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,...
FGR
2011
IEEE
13 years 2 months ago
2011
IEEE
— This paper introduces a novel approach to social behaviour recognition governed by the exchange of non-verbal cues between people. We conduct experiments to try and deduce dist...