.png){kind=icon}
返回
Improving the Walktrap Algorithm Using K-Means Clustering
.png){kind=icon}
PRE
AI
DOI：10.1080/00273171.2023.2254767.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The walktrap algorithm is one of the most popular community-detection methods in psychological research. Several simulation studies have shown that it is often effective at determining the correct number of communities and assigning items to their proper community. Nevertheless, it is important to recognize that the walktrap algorithm relies on hierarchical clustering because it was originally developed for networks much larger than those encountered in psychological research. In this paper, we present and demonstrate a computational alternative to the hierarchical algorithm that is conceptually easier to understand. More importantly, we show that better solutions to the sum-of-squares optimization problem that is heuristically tackled by hierarchical clustering in the walktrap algorithm can often be obtained using exact or approximate methods for K-means clustering. Three simulation studies and analyses of empirical networks were completed to assess the impact of better sum-of-squares solutions.
Keyword:
Psychological networks
community detection
walktrap algorithm
hierarchical clustering
K-means clustering
期刊
M
IF:
3.5
论文数:
1.8K
被引数:
9.4K
机构
引用论文
.png){kind=icon}
查看更多内容