{"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/a-streaming-algorithm-for-graph-clustering","title":"A Streaming Algorithm for Graph Clustering","arxiv_id":"1712.04337","date":"2017-12-09","proceeding":null,"authors":["Alexandre Hollocou","Julien Maudet","Thomas Bonald","Marc Lelarge"],"abstract":"We introduce a novel algorithm to perform graph clustering in the edge\nstreaming setting. In this model, the graph is presented as a sequence of edges\nthat can be processed strictly once. Our streaming algorithm has an extremely\nlow memory footprint as it stores only three integers per node and does not\nkeep any edge in memory. We provide a theoretical justification of the design\nof the algorithm based on the modularity function, which is a usual metric to\nevaluate the quality of a graph partition. We perform experiments on massive\nreal-life graphs ranging from one million to more than one billion edges and we\nshow that this new algorithm runs more than ten times faster than existing\nalgorithms and leads to similar or better detection scores on the largest\ngraphs.","url_abs":"http://arxiv.org/abs/1712.04337v1","url_pdf":"http://arxiv.org/pdf/1712.04337v1.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":"a-streaming-algorithm-for-graph-clustering","repo_url":"https://github.com/ahollocou/graph-streaming","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}