Přehled a implementace algoritmů pro detekci komunit v komplexních sítích.

Abstract

The aim of this diploma thesis is to describe selected algorithms for data clustering using random walk method. At the beginning, we will explain the bases of the graph theory, which are necessary for the understanding of other parts of this work. Subsequently, a theoretical description of the global and local clustering algorithms takes place. For some algorithms we will show the small scale example. Next, we will describe the implementation of these algorithms, what problems we may encounter and how to solve these problems. In the last chapter,we describe the test data and performa series of experiments to verify the functionality of the algorithms.