scholarly journals Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations

2017 ◽  
Vol 25 (5) ◽  
pp. 3219-3234 ◽  
Author(s):  
Hoang Dau ◽  
Olgica Milenkovic
Keyword(s):  
Community Discovery ◽  
Overlapping Community

scholarly journals Overlapping Community Discovery Method Based on Two Expansions of Seeds

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 18
Author(s):  
Yan Li ◽  
Jing He ◽  
Youxi Wu ◽  
Rongjie Lv
Keyword(s):  
Symmetric Matrix ◽  
Fitness Function ◽  
Local Maximum ◽  
Community Discovery ◽  
Network Nodes ◽  
Overlapping Community ◽  
The Common ◽  
New Research ◽  
Discovery Method ◽  
Discovery Algorithms

The real world can be characterized as a complex network sto in symmetric matrix. Community discovery (or community detection) can effectively reveal the common features of network groups. The communities are overlapping since, in fact, one thing often belongs to multiple categories. Hence, overlapping community discovery has become a new research hotspot. Since the results of the existing community discovery algorithms are not robust enough, this paper proposes an effective algorithm, named Two Expansions of Seeds (TES). TES adopts the topological feature of network nodes to find the local maximum nodes as the seeds which are based on the gravitational degree, which makes the community discovery robust. Then, the seeds are expanded by the greedy strategy based on the fitness function, and the community cleaning strategy is employed to avoid the nodes with negative fitness so as to improve the accuracy of community discovery. After that, the gravitational degree is used to expand the communities for the second time. Thus, all nodes in the network belong to at least one community. Finally, we calculate the distance between the communities and merge similar communities to obtain a less- undant community structure. Experimental results demonstrate that our algorithm outperforms other state-of-the-art algorithms.

scholarly journals Dynamic Trustworthiness Overlapping Community Discovery in Mobile Internet of Things

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 74579-74597 ◽  
Author(s):  
Jirui Li ◽  
Xiaoyong Li ◽  
Yunquan Gao ◽  
Jie Yuan ◽  
Binxing Fang
Keyword(s):  
Internet Of Things ◽  
Mobile Internet ◽  
Community Discovery ◽  
Overlapping Community

Overlapping Community Discovery Algorithm Based on Hierarchical Agglomerative Clustering

2017 ◽  
Vol 32 (03) ◽  
pp. 1850008 ◽  
Author(s):  
Hongtao Liu ◽  
Linghu Fen ◽  
Jie Jian ◽  
Long Chen
Keyword(s):  
Social Networks ◽  
Community Structure ◽  
The Other ◽  
Node Degree ◽  
Agglomerative Clustering ◽  
Community Discovery ◽  
The Core ◽  
Degree Of Membership ◽  
Hierarchical Agglomerative Clustering ◽  
Overlapping Community

Overlapping community is a response to the real network structure in social networks and in real society in order to solve the problems such as the parameters of the existing overlapping community discovery algorithm being too large, excessive overlap and no guarantee of stability of multiple runs. In this paper, the method of calculating the node degree of membership was proposed, and an overlapping community discovery algorithm based on the local optimal expansion cohesion idea was designed. Firstly, the initial core community was constructed with the highest importance node and its neighbor nodes. Secondly, the core community was extended by node attribution degree until the termination condition of the algorithm was satisfied. Finally, the experimental results were compared with the existing algorithms. The experiments show that the result of the division by the improved algorithm has been significantly improved compared to the other algorithms, and the community structure after the division is more reasonable.

Sign in / Sign up

Export Citation Format

Share Document