Určení komunit pomocí detekce hran spojujicích komunity

Abstract

This thesis deals with community detection by betweenness-based methods. The aim of thesis was to study recent algorithms, selecet most used ones and then analyse them. Selected algorithms were: shortest-path method, random-walk method, distance to zone method and Raddichi algorithm. These algorithms were implemented in various versions and then results of selected versions were tested, analysed and evaluated.