arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0711.1603physics.soc-ph
收藏

跳跃次优树状图优化网络聚类

Optimized network clustering by jumping sub-optimal dendrograms

Nicolas Bock, Erik Holmström, Johan Brännlund

摘要:

我们提出了一种方法,以改善社区划分技术的网络,是基于凝聚通过引入树状图跳跃。该方法是基于次优树状图的迭代,而不是每个凝聚步骤的优化。我们发现该算法表现出良好的缩放行为的计算复杂性。在其当前形式中,算法按$\mathcal{O} (N^{2})$缩放,但是通过使用更有效的数据结构,可以实现$\mathcal{O} (N \log^{2} N)$的缩放。我们比较我们的结果与其他方法,如贪婪算法和极值优化方法。我们发现模块化值大于贪婪算法和值相媲美的极值优化方法。

英文摘要:

We propose a method to improve community division techniques in networks that are based on agglomeration by introducing dendrogram jumping. The method is based on iterations of sub-optimal dendrograms instead of optimization of each agglomeration step. We find the algorithm to exhibit excellent scaling behavior of its computational complexity. In its present form the algorithm scales as $\mathcal{O} (N^{2})$, but by using more efficient data structures it is possible to achieve a scaling of $\mathcal{O} (N \log^{2} N)$. We compare our results with other methods such as the greedy algorithm and the extremal optimization method. We find modularity values larger than the greedy algorithm and values comparable to the extremal optimization method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑