Community discovery method based on complex network of data fusion based on super network perspective

Author(s):  
Li Pei
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.


2014 ◽  
Vol 651-653 ◽  
pp. 1741-1747
Author(s):  
Xiao Lin Zhao ◽  
Gang Hao ◽  
Chang Zhen Hu ◽  
Zhi Qiang Li

With the increasing scale of software system, the interaction between software elements becomes more and more complex, which lead to the increased dirty data in running software system. This may reduce the system performance and cause system collapse. In this paper, we proposed a discovery method of the dirty data transmission path based on complex network. Firstly, the binary file is decompiled and the function call graph is drawn by using the source code. Then the software structure is described as a weighted directed graph based on the knowledge of complex network. In addition, the dirty data node is marked by using the power-law distribution characteristics of the scale-free network construction of complex network chart. Finally, we found the dirty data transmission path during software running process. The experimental results show the transmission path of dirty data is accurate, which confirmed the feasibility of the method.


Sign in / Sign up

Export Citation Format

Share Document