Research on Fast Community Detection Algorithm in Microblog

Jie Tian; Hao Guo; Yu Wang

doi:10.4028/www.scientific.net/AMM.513-517.2045

Paper Titles

A New Online New Event Detection Algorithm Based on Event Merging and Event Splitting
p.2024

Virtual Machine Migrating Algorithm Based on Genetic Algorithm in Cloud Data Center
p.2031

Predicting Project Effort Intelligently in early Stages by Applying Genetic Algorithms with Neural Networks
p.2035

Building a Multi-Agent System for Emergency Logistics Collaborative Decision
p.2041

Research on Fast Community Detection Algorithm in Microblog
p.2045

Application of the IOT Technology in the Intelligent Management of University Multimedia Classrooms
p.2050

Research on Automatic Scoring Methods for Programs Based on Program Understanding
p.2054

A Framework for Detecting Weighted Communities in the International Trade Network
p.2059

Adaptive Transmission Control Based on QoE Measurement of Invalid Data Rate
p.2063

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517Research on Fast Community Detection Algorithm in...

Research on Fast Community Detection Algorithm in Microblog

Abstract:

According to the problem of extracting the community structure of large networks, we propose a simple heuristic method based on community coding optimization. It is shown to outperform the InfoMap community detection method in terms of computation time. Experiments show that our method can find out various communities in microblog, which reveal the core structure of the network.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

2045-2049

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.2045

Citation:

Cite this paper

Online since:

February 2014

Authors:

Jie Tian*, Hao Guo, Yu Wang

Keywords:

Community Detection, Graph Partitioning, Optimization

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] S.E. Schaeffer. Graph clustering. Computer Science Review, 1(1): 27–64, (2007).

Google Scholar

[2] U. Brandes, M. Gaertler, and D. Wagner. Engineering graph clustering: Models and experimental evaluation. Journal of Experimental Algorithmics, 12(1), (2007).

Google Scholar

[3] U. von Luxburg. A tutorial on spectral clustering. Technical Report 149, Max Plank Institute for Biological Cybernetics, August (2006).

Google Scholar

[4] S.E. Schaeffer. Graph clustering. Computer Science Review, 1(1): 27–64, (2007).

Google Scholar

[5] M.E.J. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences of the United States of America, 103(23): 8577–8582, (2006).

DOI: 10.1073/pnas.0601602103

Google Scholar

[6] M.E.J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69: 026113, (2004).

Google Scholar

[7] Martin Rosvall, Carl T. Bergstrom. Maps of random walks on complex networks reveal community structure, Proceedings of the National Academy of Sciences of the United States of America, 2008 105(4) 1118-1123.

DOI: 10.1073/pnas.0706851105

Google Scholar

[8] Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, ET al. Fast unfolding of communities in large networks. ArXiv ePrint: 0803. 0476, (2008).

Google Scholar