A neighborhood proximity based algorithm for overlapping community structure detection in weighted networks
Letter
First Online:
- 47 Downloads
Preview
Unable to display preview. Download preview PDF.
Notes
Acknowledgements
This paper was supported by the project with grant number EEQ/2016/000509 received from the Science and Engineering Research Board, D.S.T., Govt. of India.
Supplementary material
11704_2019_8098_MOESM5_ESM.pdf (313 kb)
A neighborhood proximity based algorithm for overlapping community structure detection in weighted networks
References
- 1.Farkas I, Abel D, Palla G, Vicsek T. Weighted network modules. New Journal of Physics, 2007, 9(6): 180CrossRefGoogle Scholar
- 2.Berry J W, Hendrickson B, LaViolette R A, Phillips C A. Tolerating the community detection resolution limit with edge weighting. Physical Review E, 2011, 83(5): 056119CrossRefGoogle Scholar
- 3.Nicosia V, Mangioni G, Carchiolo V, Malgeri M. Extending the definition of modularity to directed graphs with overlapping communities. Journal of Statistical Mechanics: Theory and Experiment, 2009, 3: 03024CrossRefGoogle Scholar
- 4.Baumes J, Goldberg M, Magdon-Ismail M. Efficient identification of overlapping communities. In: Proceedings of the 2005 IEEE International Conference on Intelligence and Security Informatics. 2005, 27–36Google Scholar
- 5.Xing Y, Meng F, Zhou Y, Zhou R. Overlapping community detection by local community expansion. Journal of Information Science and Engineering, 2015, 31(4): 1213–1232Google Scholar
- 6.Newman M E J, Girvan M. Finding and evaluating community structure in networks. Physical Review E, 2004, 69(2): 026113CrossRefGoogle Scholar
Copyright information
© Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature 2019