paris(g_original: object) → cdlib.classes.node_clustering.NodeClustering¶
Paris is a hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs.
Supported Graph Types
Undirected Directed Weighted Yes No Yes Parameters: g_original – a networkx/igraph object Returns: NodeClustering object Example:
>>> from cdlib import algorithms >>> import networkx as nx >>> G = nx.karate_club_graph() >>> coms = algorithms.paris(G)
Bonald, T., Charpentier, B., Galland, A., & Hollocou, A. (2018). Hierarchical graph clustering using node pair sampling. arXiv preprint arXiv:1806.01664.
Reference implementation: https://github.com/tbonald/paris