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


Nice paper along the work of [Dasgupta]( and [Cohen-Addad et al.]( 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

Please consider to register or login to comment on the paper.