CDlib Logo
  • Overview
    • Goals
    • EU H2020
  • Installing CDlib
    • Optional Dependencies
      • PyPi package
      • Advanced
      • Optional Dependencies (Conda package)
  • Quick Start
    • Tutorial
    • FAQ
  • API Guide
    • Community Objects
      • Node Clustering
      • Fuzzy Node Clustering
      • Attributed Node Clustering
      • Biparite Node Clustering
      • Edge Clustering
      • Temporal Clustering
    • Static Community Discovery
      • Node Clustering
      • Edge Clustering
      • Ensemble Methods
    • Dynamic Community Discovery
      • Instant Optimal
      • Temporal Trade-Off
    • Community Events and LifeCycle
      • LifeCycle Object
      • Clustering with Explicit LifeCycle
      • Clustering without Explicit LifeCycle
      • Analyzing Events and Flows
      • Visualizing Events and Flows
      • Validating Flows
    • Evaluation and Benchmarking
      • Internal Evaluation: Fitness scores
      • External Evaluation: Partition Comparisons
      • Synthetic Benchmarks
      • Networks With Annotated Communities
    • Validate CD Algorithms Rankings
      • Ranking by Fitness Scores
      • Ranking by Clustering Similarity
    • Visual Analytics
      • Network Visualization
      • Analytics plots
      • Dynamic Community Events plots
    • Input-Output
      • Community I/O
      • Community Events I/O
    • Utilities
      • Graph Transformation
      • Identifier mapping
  • Bibliography
    • Algorithms
    • Evaluation measures
    • Researches using CDlib
CDlib
  • API Guide
  • Evaluation and Benchmarking
  • cdlib.evaluation.link_modularity
  • Edit on GitHub

cdlib.evaluation.link_modularity¶

cdlib.evaluation.link_modularity(graph: Graph, communities: object, **kwargs: dict) → object¶

Quality function designed for directed graphs with overlapping communities.

Parameters:
  • graph – a networkx/igraph object

  • communities – NodeClustering object

Returns:

FitnessResult object

Example:

>>> from cdlib.algorithms import louvain
>>> from cdlib import evaluation
>>> g = nx.karate_club_graph()
>>> communities = louvain(g)
>>> mod = evaluation.link_modularity(g,communities)
References:

  1. Nicosia, V., Mangioni, G., Carchiolo, V., Malgeri, M.: Extending the definition of modularity to directed graphs with overlapping communities. Journal of Statistical Mechanics: Theory and Experiment 2009(03), 03024 (2009)

Previous Next

© Copyright 2024, Giulio Rossetti. Revision 5e118d95.

Built with Sphinx using a theme provided by Read the Docs.