Using the overlapping community structure of a network of tags to improve text clustering
Proceedings of the 23rd ACM conference on Hypertext and social media
Dark Web portal overlapping community detection based on topic models
Proceedings of the ACM SIGKDD Workshop on Intelligence and Security Informatics
Cascade-based community detection
Proceedings of the sixth ACM international conference on Web search and data mining
Online search of overlapping communities
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
OverCite: finding overlapping communities in citation network
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Overlapping community detection in networks: The state-of-the-art and comparative study
ACM Computing Surveys (CSUR)
A link clustering based overlapping community detection algorithm
Data & Knowledge Engineering
Extending market basket analysis with graph mining techniques: A real case
Expert Systems with Applications: An International Journal
An efficient algorithm for community mining with overlap in social networks
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Overlap is one of the characteristics of social networks, in which a person may belong to more than one social group. For this reason, discovering overlapping structures is necessary for realistic social analysis. In this paper, we present a novel, general framework to detect and analyze both individual overlapping nodes and entire communities. In this framework, nodes exchange labels according to dynamic interaction rules. A specific implementation called Speaker-listener Label Propagation Algorithm (SLPA) demonstrates an excellent performance in identifying both overlapping nodes and overlapping communities with different degrees of diversity.