Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering
Authors: B. Charpentier, T. Bonald
Liked by:
Domains: Graph algorithmics
Tags: IJCAJ2019
Uploaded by: Maximimi
Upload date: 2019-12-09 14:44:05

Comments:

Nice paper along the work of [Dasgupta](https://papers-gamma.link/paper/155) and [Cohen-Addad et al.](https://arxiv.org/pdf/1704.02147.pdf). A function to quantify the quality of a hierarchical graph clustering / dendrogram is proposed. An interesting application to compress a dendrogram is proposed. Section 8. If the input graph is a complete bipartite graph, then the quality function Q is maximum if the graph is partitioned in the two independent sets.
Maximimi at 2019-12-09 14:55:40
Edited by Maximimi at 2019-12-23 17:47:17

You comment anonymously! You will not be able to edit/delete the comment.

Please consider to register or login.

Use $\LaTeX$ to type formulæ and markdown to format text.
When you post something to which you hold the copyright you authorise us to do distribute this data across the scientific community. You can post public domain content. All user-generated content will be freely available online. Please see this page to learn more about Papersγ's terms of use and privacy policy.