961 search results - page 35 / 193 » Significance-Driven Graph Clustering |
142
click to vote
VL
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
155
click to vote
CATS
2006
15 years 5 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
148
click to vote
APVIS
2010
15 years 2 months ago
2010
In this paper, we propose an approach of clustering data in parallel coordinates through interactive local operations. Different from many other methods in which clustering is glo...
157
click to vote
COLOGNETWENTE
2010
15 years 26 days 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...
183
click to vote
ESA
2011
Springer
14 years 3 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...