961 search results - page 39 / 193 » Significance-Driven Graph Clustering |
122
Voted
CORR
2007
Springer
15 years 17 days ago
2007
Springer
In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algeb...
100
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
104
click to vote
GC
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
102
Voted
APVIS
2007
15 years 2 months ago
2007
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...
98
Voted
SDM
2007
SIAM
15 years 2 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...