Shlukování pomocí algoritmu COBWEB

Abstract

This diploma thesis is about clustering algorithms, their clasification and implementation of several choosen clustering algorithms. These choosen clustering algorithms were optimalized for processing high number of high dimensional objects. In this paper was found, that not all from these choosen clustering algorithms are suitable for processing high number of high dimensional objects. At the conclusion, properties of these chosen algorithms were experimentally verified.