The content discusses enhancements to community detection algorithms using random walks. It introduces the Random Walk Graph Partition Algorithm and the Random Walk Graph Partition Louvain Algorithm, comparing them with existing methods. Experiments on randomly generated and real-world data validate the efficacy of the proposed algorithms.
The Newman algorithm and the Louvain algorithm are discussed for community detection.
Random walk strategies are employed for improved efficiency in graph partitioning.
Experiments on Gaussian random generator and Planted-l partition models showcase algorithm performance.
Real data experiments demonstrate superior effectiveness of proposed algorithms over existing ones.
Para Outro Idioma
do conteúdo original
arxiv.org
Principais Insights Extraídos De
by Duy Hieu Do,... às arxiv.org 03-14-2024
https://arxiv.org/pdf/2403.08313.pdfPerguntas Mais Profundas