cdlib.algorithms.principled_clustering

cdlib.algorithms.principled_clustering(g_original: object, cluster_count: int) → FuzzyNodeClustering

An efficient and principled method for detecting communities in networks

Supported Graph Types

Undirected	Directed	Weighted
Yes	No	No

Parameters:

• g_original – networkx/igraph object

• cluster_count – number of desired communities

Returns:

FuzzyNodeClustering object

Example:

>>> from cdlib import algorithms
>>> import networkx as nx
>>> G = nx.karate_club_graph()
>>> coms = algorithms.principled_clustering(G, 3)

References:

B Ball, B., & E JNewman, M. (2011). An efficient and principled method for detecting communities in networks. Physical ReviewE, 84, 036103.

Note

Reference implementation: https://github.com/Zabot/principled_clustering