In this paper, our goal is to scale-up the computation of top-r, k-core communities to web-scale graphs of tens of billions of edges. We feature several fast ...
With our implementations, we show that we can efficiently handle massive networks using a single consumer- level machine within a reasonable amount of time. 1.
We feature several fast new algorithms for this problem. With our implementations, we show that we can efficiently handle massive networks using a single ...
Efficient Computation of Importance Based Communities in Web-Scale Networks Using a Single Machine ; Proceedings of the 25th ACM International Conference on ...
Shu Chen, Ran Wei, Diana Popova, Alex Thomo, "Efficient Computation of Importance-Based Communities in Web-Scale Networks Using a Single Machine." CIKM, ACM, ...
Publication type: Conference Proceeding · Language: English · Authors: Chen, Shu; Wei, Ran; Popova, Diana; Thomo, Alex ...view all.
Shu Chen, Ran Wei, Diana Popova, Alex Thomo, Efficient Computation of Importance-Based Communities in Web-Scale Networks Using a Single Machine. CIKM, ACM ...
Efficient computation of importance based communities in web-scale networks using a single machine. S Chen, R Wei, D Popova, A Thomo. Proceedings of the 25th ...
Efficient algorithms for discovering importance-based communities in large web-scale networks ... communities using only a consumer-grade machine. Expand.
The experiments reveal that our greedy and randomized implementations outperform the other approaches by simultaneously computing a feedback arc set of ...