{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/hierarchical-graph-clustering-using-node-pair","title":"Hierarchical Graph Clustering using Node Pair Sampling","arxiv_id":"1806.01664","date":"2018-06-05","proceeding":null,"authors":["Thomas Bonald","Bertrand Charpentier","Alexis Galland","Alexandre Hollocou"],"abstract":"We present a novel hierarchical graph clustering algorithm inspired by\nmodularity-based clustering techniques. The algorithm is agglomerative and\nbased on a simple distance between clusters induced by the probability of\nsampling node pairs. We prove that this distance is reducible, which enables\nthe use of the nearest-neighbor chain to speed up the agglomeration. The output\nof the algorithm is a regular dendrogram, which reveals the multi-scale\nstructure of the graph. The results are illustrated on both synthetic and real\ndatasets.","url_abs":"http://arxiv.org/abs/1806.01664v2","url_pdf":"http://arxiv.org/pdf/1806.01664v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"hierarchical-graph-clustering-using-node-pair","repo_url":"https://github.com/tbonald/paris","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"hierarchical-graph-clustering-using-node-pair","repo_url":"https://github.com/Sharpenb/python_paris","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"hierarchical-graph-clustering-using-node-pair","repo_url":"https://github.com/dakrod/bottom_up_hcd","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1806.01664","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}