11. Louvain法:All Neighbor Selection
2016/10/2
• Blondel, Vincent D., et al. "Fast unfolding of communities in large networks." Journal of
Statistical Mechanics: Theory and Experiment 2008.10 (2008): P10008.
12. Louvain法:All Neighbor Selection
2016/10/2
• Blondel, Vincent D., et al. "Fast unfolding of communities in large networks." Journal of
Statistical Mechanics: Theory and Experiment 2008.10 (2008): P10008.
13. Louvain法:All Neighbor Selection
2016/10/2
• Blondel, Vincent D., et al. "Fast unfolding of communities in large networks." Journal of
Statistical Mechanics: Theory and Experiment 2008.10 (2008): P10008.
34. 参考文献
• Duncan J. Watts. (2003). Six Degrees: The Science of a Connected Age. W. W. Norton & Company
• Newman, Mark EJ, and Michelle Girvan. "Finding and evaluating community structure in networks." Physical
review E 69.2 (2004): 026113.
• Newman, Mark EJ. "Fast algorithm for detecting community structure in networks." Physical review E 69.6 (2004):
066133.
• Clauset, Aaron, Mark EJ Newman, and Cristopher Moore. "Finding community structure in very large networks."
Physical review E 70.6 (2004): 066111.
• Wakita, Ken, and Toshiyuki Tsurumi. "Finding community structure in mega-scale social networks:[extended
abstract]." Proceedings of the 16th international conference on World Wide Web. ACM, 2007.
• Blondel, Vincent D., et al. "Fast unfolding of communities in large networks." Journal of Statistical Mechanics:
Theory and Experiment 2008.10 (2008): P10008.
• Shiokawa, Hiroaki, Yasuhiro Fujiwara, and Makoto Onizuka. "Fast Algorithm for Modularity-based Graph
Clustering." Twenty-Seventh AAAI Conference on Artificial Intelligence. 2013.
• Bhowmick, Sanjukta, and Sriram Srinivasan. "A Template for Parallelizing the Louvain Method for Modularity
Maximization." Dynamics On and Of Complex Networks, Volume 2. Springer New York, 2013. 111-124.
• Staudt, Christian L., and Henning Meyerhenke. "Engineering High-Performance Community Detection Heuristics
for Massive Graphs." Parallel Processing (ICPP), 2013 42nd International Conference on. IEEE, 2013.
• Prat-Pérez, Arnau, David Dominguez-Sal, and Josep-Lluis Larriba-Pey. "High quality, scalable and parallel
community detection for large real graphs." Proceedings of the 23rd international conference on World wide web.
International World Wide Web Conferences Steering Committee, 2014.
• Onsjö, Mikael, and Osamu Watanabe. "A simple message passing algorithm for graph partitioning problems."
Algorithms and Computation. Springer Berlin Heidelberg, 2006. 507-516.
2016/10/2 34
36. Community発見の実例(1)
• Data: Belgian Mobile Companyの通話記録
• Node:顧客 Edge: 通話したか否か
• Community 構造 + scale free性
• 結果: フランス語 + オランダ語
• 社会学から言うと
– 言語圏的、民族的、宗教的結束力や脆弱性が見
える
2016/10/2 39
• Blondel, Vincent D., et al. "Fast unfolding of communities in large networks." Journal of
Statistical Mechanics: Theory and Experiment 2008.10 (2008): P10008.
37. Community発見の実例(2)
2016/10/2 40
Du, Nan, et al. "Community detection in large-scale social networks." Proceedings of the 9th
WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis. ACM, 2007.
Communityは経済圏を表すことができる。
Another significant result is that even though geographical distance plays a clear role in the definition of the communities, the composition of some of the communities cannot be explained by purely geographical considerations. For example, the community that contains most cities in Europe also contains most airports in Asian Russia. Similarly, Chinese and Japanese cities are mostly grouped with cities in the other countries in Southeast Asia, but India is mostly grouped with the Arabic Peninsula countries and with countries in Northeastern Africa. These facts are consistent with the important role of political factors in determining community structure (21).