Real-Time Community Detection in Large Social Networks on a Laptop
Benjamin Paul Chamberlain, Josh Levy-Kramer, Clive Humby, Marc Peter, Deisenroth

TL;DR
This paper introduces a real-time, single-machine system for community detection in large social networks, enabling interactive exploration of graph structures on a standard laptop.
Contribution
It presents a novel approach using minhash signatures and Locality Sensitive Hashing to achieve real-time community detection on large graphs with a single machine.
Findings
Query times reduced from hours to milliseconds.
System enables real-time exploration of large social graphs.
Deployed in active social network analysis software.
Abstract
For a broad range of research, governmental and commercial applications it is important to understand the allegiances, communities and structure of key players in society. One promising direction towards extracting this information is to exploit the rich relational data in digital social networks (the social graph). As social media data sets are very large, most approaches make use of distributed computing systems for this purpose. Distributing graph processing requires solving many difficult engineering problems, which has lead some researchers to look at single-machine solutions that are faster and easier to maintain. In this article, we present a single-machine real-time system for large-scale graph processing that allows analysts to interactively explore graph structures. The key idea is that the aggregate actions of large numbers of users can be compressed into a data structure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Complex Network Analysis Techniques · Peer-to-Peer Network Technologies
