33 search results - page 3 / 7 » Solving cluster ensemble problems by bipartite graph partiti... |
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
ICDM
2008
IEEE
13 years 12 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
ICALP
2011
Springer
12 years 9 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
In this paper, we present a novel approach to recognizing human actions from different views by view knowledge transfer. An action is originally modelled as a bag of visual-words ...
ICCAD
1998
IEEE
13 years 9 months ago
1998
IEEE
It is known to many researchers in the partitioning community that the recursive bipartitioning approach outperforms the direct non-recursive approach in solving the multiway part...