961 search results - page 44 / 193 » Significance-Driven Graph Clustering |
98
Voted
CLEF
2010
Springer
15 years 1 months ago
2010
Springer
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
105
click to vote
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
129
click to vote
KDD
2004
ACM
15 years 6 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
APVIS
2007
15 years 2 months ago
2007
In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy som...
88
Voted
AAAI
2008
15 years 2 months ago
2008
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...