4009 search results - page 68 / 802 » Clustering on Complex Graphs |
154
click to vote
BMCBI
2007
14 years 12 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
100
click to vote
ICTAI
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
104
click to vote
PAKDD
2007
ACM
15 years 6 months ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
PAKDD
2004
ACM
15 years 5 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
WG
2010
Springer
14 years 10 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...