A new community detection method based on coupled map lattice model

Author(s):  
Qi Zheng ◽  
Bo Yang
2014 ◽  
Vol 28 (28) ◽  
pp. 1450199
Author(s):  
Shengze Hu ◽  
Zhenwen Wang

In the real world, a large amount of systems can be described by networks where nodes represent entities and edges the interconnections between them. Community structure in networks is one of the interesting properties revealed in the study of networks. Many methods have been developed to extract communities from networks using the generative models which give the probability of generating networks based on some assumption about the communities. However, many generative models require setting the number of communities in the network. The methods based on such models are lack of practicality, because the number of communities is unknown before determining the communities. In this paper, the Bayesian nonparametric method is used to develop a new community detection method. First, a generative model is built to give the probability of generating the network and its communities. Next, the model parameters and the number of communities are calculated by fitting the model to the actual network. Finally, the communities in the network can be determined using the model parameters. In the experiments, we apply the proposed method to the synthetic and real-world networks, comparing with some other community detection methods. The experimental results show that the proposed method is efficient to detect communities in networks.


2019 ◽  
Vol 11 (12) ◽  
pp. 254
Author(s):  
Zihe Zhou ◽  
Bo Tian

The text data of the social network platforms take the form of short texts, and the massive text data have high-dimensional and sparse characteristics, which does not make the traditional clustering algorithm perform well. In this paper, a new community detection method based on the sparse subspace clustering (SSC) algorithm is proposed to deal with the problem of sparsity and the high-dimensional characteristic of short texts in online social networks. The main ideal is as follows. First, the structured data including users’ attributions and user behavior and unstructured data such as user reviews are used to construct the vector space for the network. And the similarity of the feature words is calculated by the location relation of the feature words in the synonym word forest. Then, the dimensions of data are deduced based on the principal component analysis in order to improve the clustering accuracy. Further, a new community detection method of social network members based on the SSC is proposed. Finally, experiments on several data sets are performed and compared with the K-means clustering algorithm. Experimental results show that proper dimension reduction for high dimensional data can improve the clustering accuracy and efficiency of the SSC approach. The proposed method can achieve suitable community partition effect on online social network data sets.


2014 ◽  
Vol 568-570 ◽  
pp. 852-857
Author(s):  
Lu Wang ◽  
Yong Quan Liang ◽  
Qi Jia Tian ◽  
Jie Yang ◽  
Chao Song ◽  
...  

Detecting community structure from complex networks has triggered considerable attention in several application domains. This paper proposes a new community detection method based on improved genetic algorithm (named CDIGA), which tries to find the best community structure by maximizing the network modularity. String encoding is used to realize genetic representation. Parts of nodes assign their community identifiers to all of their neighbors to ensure the convergence of the algorithm and eliminate unnecessary iterations when initial population is created. Crossover operator and mutation operator are improved too, one-way crossover strategy is introduced to crossover process, the Connect validity of mutation node is ensured in mutation process. We compared it with three other algorithms in computer generated networks and real world networks, Experiment Results show that the improved algorithm is highly effective for discovering community structure.


Author(s):  
Fuzhong Nian ◽  
Li Luo ◽  
Xuelong Yu ◽  
Xin Guo

The iterative propagation of information between nodes will strengthen the connection strength between nodes, and the network can evolve into different groups according to difference edge strength. Based on this observation, we present the user engagement to quantify the influences of users different propagation modes to network propagation, and construct weight network to simulate real social network, and proposed the community detection method in social networks based on information propagation and user engagement. Our method can produce different scale communities and overlapping community. We also applied our method to real-world social networks. The experiment proved that the network spread and the community division interact with each other. The community structure is significantly different in the network propagation of different scales.


Sign in / Sign up

Export Citation Format

Share Document