Community detection in graphs

Sources: arXiv:1608.01163v2, Nov 2016

Community detection is a mechanism for graph vertex clustering. Depending on the algorithm, communities could be overlapping.

Community detection algorithms are more effective at correctly clustering if the number of clusters $q$ is known. Even reducing this down to a range of possible values of $q$ improves answer quality.

Tools:

• Consensus Clustering