Abstract
The topic of community detection in social networks has attracted a lot of attention in recent years. Existing methods always depict the relationship of two nodes using the snapshot of the network, but these snapshots cannot reveal the real relationships, especially when the connection history among nodes is considered. The problem of detecting the stable community in mobile social networks has been studied in this paper. Community cores are considered as stable subsets of the network in previous work. Based on these observations, this paper divides all nodes into a few of communities due to the community cores. Meanwhile, communities can be tracked through incremental computing. Experimental results based on real-world social networks demonstrate that our proposed method performs better than the well-known static community detection algorithm in mobile social networks. © 2013 by the authors; licensee MDPI, Basel, Switzerland.
Author supplied keywords
Cite
CITATION STYLE
Xu, H., Hu, Y., Wang, Z., Ma, J., & Xiao, W. (2013). Core-based dynamic community detection in mobile social networks. Entropy, 15(12), 5419–5438. https://doi.org/10.3390/e15125419
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.