439 search results - page 21 / 88 » Engineering Comparators for Graph Clusterings |
VISSOFT
2005
IEEE
14 years 1 months ago
2005
IEEE
The clear and meaningful visualization of relations between software entities is an invaluable tool for the comprehension, evaluation, and reengineering of the structure of existi...
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
PR
2007
13 years 7 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
USENIX
2004
13 years 9 months ago
2004
Large web or e-commerce sites are frequently hosted on clusters. Successful open-source tools exist for clustering the front tiers of such sites (web servers and application serve...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...