In this paper, we will work on a problem of social graph clustering. Problem of graph clustering is very well studied, but in almost all cases, disjunctive and total clustering is created. In a social graph, it is obvious that we can have people that belong to many groups, as is the case for the majority of people. But we can also have a person that does not belong to any group. We devise few algorithms that can be used to solve this problem. Also, currently, there is no good general metric for measuring quality of such clustering, so we created one that best suits the needs of specified task.

Keywords: "clustering, eigenvectors, minimal cost spanning tree, quality, spectral graph theory, social graph "
Published on website: 19.2.2011