8 search results - page 1 / 2 » Finding Maximum Edge Bicliques in Convex Bipartite Graphs |
COCOON
2010
Springer
13 years 10 months ago
2010
Springer
COLT
2003
Springer
13 years 10 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
COLOGNETWENTE
2010
13 years 1 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
DM
2000
13 years 5 months ago
2000
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
ICDM
2008
IEEE
13 years 11 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....