Tree Sampling Divergence

This repository presents the experiments of the paper:

Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering
Bertrand Charpentier, Thomas Bonald
International Joint Conferences on Artificial Intelligence (IJCAI), 2019

[Paper|Publisher]

Software Implementation

An efficient implementation of the Tree Sampling Divergence (TSD) metric is now available in our Python package for the analysis of large graphs scikit network:

• TSD Documentation
• TSD Implementation

Cite

Please cite our paper if you use the TSD metric, compression algorithm or the code in your own work:

@inproceedings{ijcai2019-286,
  title     = {Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering},
  author    = {Charpentier, Bertrand and Bonald, Thomas},
  booktitle = {Proceedings of the Twenty-Eighth International Joint Conference on
               Artificial Intelligence, {IJCAI-19}},
  publisher = {International Joint Conferences on Artificial Intelligence Organization},             
  pages     = {2067--2073},
  year      = {2019},
  month     = {7},
  doi       = {10.24963/ijcai.2019/286},
  url       = {https://doi.org/10.24963/ijcai.2019/286},
}