Name
Abstract | ||
|---|---|---|
The multilevel graph partitioning strategy aims to reduce the computational cost of the partitioning algorithm by applying it on a coarsened version of the original graph. This strategy is very useful when large-scale networks are analyzed. To improve the multilevel solution, refinement algorithms have been used in the uncorsening phase. Typical refinement algorithms exploit network properties, for example minimum cut or modularity, but they do not exploit features from domain specific networks. For instance, in social networks partitions with high clustering coefficient or similarity between vertices indicate a better solution. In this paper, we propose a refinement algorithm (RSim) which is based on neighborhood similarity. We compare RSim with: 1. two algorithms from the literature and 2. one baseline strategy, on twelve real networks. Results indicate that RSim is competitive with methods evaluated for general domains, but for social networks it surpasses the competing refinement algorithms. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2628194.2628227 | IDEAS |
Keywords | Field | DocType |
efficiency,algorithms,graphs and networks,social networks,complex networks,algorithm design and analysis,multilevel partitioning,graph clustering,refinement | Data mining,Social network,Vertex (geometry),Computer science,Minimum cut,Theoretical computer science,Exploit,Complex network,Clustering coefficient,Graph partition,Modularity | Conference |
Citations | PageRank | References |
4 | 0.41 | 24 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alan Valejo | 1 | 15 | 4.60 |
| Jorge Carlos Valverde-Rebaza | 2 | 79 | 8.11 |
| Brett Drury | 3 | 26 | 6.10 |
| Alneu de Andrade Lopes | 4 | 275 | 29.00 |