Community Discovery Method in Networks Based on Topological Potential

2009 ◽  
Vol 20 (8) ◽  
pp. 2241-2254 ◽  
Author(s):  
Wen-Yan GAN ◽  
Nan HE ◽  
De-Yi LI ◽  
Jian-Min WANG
Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jibing Wu ◽  
Lianfei Yu ◽  
Qun Zhang ◽  
Peiteng Shi ◽  
Lihua Liu ◽  
...  

The heterogeneous information networks are omnipresent in real-world applications, which consist of multiple types of objects with various rich semantic meaningful links among them. Community discovery is an effective method to extract the hidden structures in networks. Usually, heterogeneous information networks are time-evolving, whose objects and links are dynamic and varying gradually. In such time-evolving heterogeneous information networks, community discovery is a challenging topic and quite more difficult than that in traditional static homogeneous information networks. In contrast to communities in traditional approaches, which only contain one type of objects and links, communities in heterogeneous information networks contain multiple types of dynamic objects and links. Recently, some studies focus on dynamic heterogeneous information networks and achieve some satisfactory results. However, they assume that heterogeneous information networks usually follow some simple schemas, such as bityped network and star network schema. In this paper, we propose a multityped community discovery method for time-evolving heterogeneous information networks with general network schemas. A tensor decomposition framework, which integrates tensor CP factorization with a temporal evolution regularization term, is designed to model the multityped communities and address their evolution. Experimental results on both synthetic and real-world datasets demonstrate the efficiency of our framework.


Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 18
Author(s):  
Yan Li ◽  
Jing He ◽  
Youxi Wu ◽  
Rongjie Lv

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.


2022 ◽  
Vol 9 ◽  
Author(s):  
Yanli Zou ◽  
Haoqian Li

Based on the community discovery method in complex network theory, a power grid partition method considering generator nodes and network weightings is proposed. Firstly, the weighted network model of a power system is established, an improved Fast-Newman hierarchical algorithm and a weighted modular Q function index are introduced, and the partitioning algorithm process is practically improved combined with the characteristics of the actual power grid. Then, the partition results of several IEEE test systems with the improved algorithm and with the Fast-Newman algorithm are compared to demonstrate its effectiveness and correctness. Subsequently, on the basis of subnet partition, two kinds of network attack strategies are proposed. One is attacking the maximum degree node of each subnet, and the other is attacking the maximum betweenness node of each subnet. Meanwhile, considering the two traditional intentional attack strategies, that is, attacking the maximum degree nodes or attacking the maximum betweenness nodes of the whole network, the cascading fault survivability of different types of networks under four attack strategies is simulated and analyzed. It was found that the proposed two attack strategies based on subnet partition are better than the two traditional intentional attack strategies.


2019 ◽  
Vol 11 (3) ◽  
pp. 60 ◽  
Author(s):  
Xuan Wang ◽  
Bofeng Zhang ◽  
Furong Chang

The rapid development of online social networks has allowed users to obtain information, communicate with each other and express different opinions. Generally, in the same social network, users tend to be influenced by each other and have similar views. However, on another social network, users may have opposite views on the same event. Therefore, research undertaken on a single social network is unable to meet the needs of research on hot topic community discovery. “Cross social network” refers to multiple social networks. The integration of information from multiple social network platforms forms a new unified dataset. In the dataset, information from different platforms for the same event may contain similar or unique topics. This paper proposes a hot topic discovery method on cross social networks. Firstly, text data from different social networks are fused to build a unified model. Then, we obtain latent topic distributions from the unified model using the Labeled Biterm Latent Dirichlet Allocation (LB-LDA) model. Based on the distributions, similar topics are clustered to form several topic communities. Finally, we choose hot topic communities based on their scores. Experiment result on data from three social networks prove that our model is effective and has certain application value.


2010 ◽  
Vol 159 ◽  
pp. 248-251 ◽  
Author(s):  
Min Xu ◽  
Yuan Zhang ◽  
Mei Qi Fang ◽  
Ning Li

In this paper, we proposed a model of support personalized learning based on SGCL (Social Group Collaborative Learning System). In the model, we provide two algorithms to discover knowledge communities. Based on the community discovery result and system recommendation policy, we give our user the recommendation suggestions to help them to construct their personalized knowledge structure. The paper mainly introduce these algorithms, the AG algorithm based on aggregation and the KC algorithm based on K-Clique model, which are algorithms to discover knowledge communities in SGCL.


Sign in / Sign up

Export Citation Format

Share Document