The Scientific World Journal

Volume 2014 (2014), Article ID 329325, 9 pages

http://dx.doi.org/10.1155/2014/329325

Research Article

A Community Detection Algorithm Based on Topology Potential and Spectral Clustering

Zhixiao Wang, Zhaotong Chen, Ya Zhao, and Shaoda Chen

School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, Jiangsu 221116, China

Received 12 May 2014; Accepted 12 July 2014; Published 22 July 2014

Academic Editor: Shifei Ding

Copyright © 2014 Zhixiao Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

Community detection is of great value for complex networks in understanding their inherent law and predicting their behavior. Spectral clustering algorithms have been successfully applied in community detection. This kind of methods has two inadequacies: one is that the input matrixes they used cannot provide sufficient structural information for community detection and the other is that they cannot necessarily derive the proper community number from the ladder distribution of eigenvector elements. In order to solve these problems, this paper puts forward a novel community detection algorithm based on topology potential and spectral clustering. The new algorithm constructs the normalized Laplacian matrix with nodes’ topology potential, which contains rich structural information of the network. In addition, the new algorithm can automatically get the optimal community number from the local maximum potential nodes. Experiments results showed that the new algorithm gave excellent performance on artificial networks and real world networks and outperforms other community detection methods.

1. Introduction

Most networks show community structure [1]. The results of community detection are meaningful for forecasting the behavior and evolution trend of complex networks [2]. For example, in World Wide Web, community detection can be used to improve the performance of search engine, in social networks, community detection can be used to forecast the information propagation among users [3], in electronic commerce area, community detection can be used to select potential user for advertising; and in bioengineering area, community detection can be used to recognize functions of protein [4].

In recent years, many methods inspired by different paradigms are put forward for community detection [5]. Among these efforts, spectral clustering has shown to be successful [6], for it is very simple to implement and can be solved by standard linear algebra methods.

The traditional spectral clustering methods are based on kinds of input matrixes, such as the adjacency matrix, the standard Laplacian matrix, and the normalized Laplacian matrix. The standard Laplacian matrix is defined as , and the normalized Laplacian matrix is defined as , where is adjacency matrix and is a diagonal matrix with elements being the degree of the th node.

Almost all above matrixes are constructed with the adjacency matrix and diagonal matrix of networks. These matrixes can only reflect the local relationship between a node and its direct neighbors, as [6] pointed out, “the eigenvalues and eigenvectors of traditional input matrixes cannot provide sufficient structural information for community detection.” As a result, the accuracy of community detection may decrease.

What is more, the community number must be set in advance for the spectral clustering method based on standard Laplacian matrix. The normalized Laplacian matrix can solve this problem to some extent, which has nontrivial eigenvalues close to the biggest eigenvalue 1. The eigenvector elements corresponding to these eigenvalues present ladder distribution. The proper community number of communities can be estimated by the ladders. However, when the community structure of network is not clear, the eigenvector elements cannot show obvious ladder distribution but an approximately continuous curve [7]. In this case, we cannot get the proper community number from the ladder distribution of eigenvector elements.

In order to solve these problems, this paper puts forward a novel community detection algorithm based on topology potential and spectral clustering. The algorithm constructs the normalized Laplacian matrix with topology potential of network nodes. The topology potential of a node is the sum of potential components produced by neighbors at the position of this node. The topology potential describes the complicated interaction among nodes and contains rich structural information of the network. This structural information is meaningful for community detection. In addition, the new algorithm can automatically get the optimal community number from the local maximum potential nodes, whether the community structure of network is obvious or not. Experiments results showed that the new algorithm can improve the accuracy of community detection and has significant adaptability.

This paper is organized as follows. Section 2 describes related works. Section 3 introduces the concept of topology potential. Section 4 shows the new community detection algorithm based on topology potential and spectral clustering. Section 5 is simulation experiment and results. Section 6 comes to the conclusion of this paper.

2. Related Works

Spectral clustering algorithms have been successfully applied to community detection. From the perspective of input matrix, spectral clustering methods can be divided into the adjacency matrix [8], the standard Laplacian matrix [9], the normalized Laplacian matrix [10], the modularity matrix [11], and the correlation matrix [12]. Reference [13] found that the normalized Laplacian matrix significantly outperforms the other matrixes in identifying the community structure of networks.

In order to improve the performance of spectral clustering, many nontraditional spectral clustering algorithms have been proposed [6], such as complement based spectral clustering [14], complex eigenvector based spectral clustering [15], semisupervised spectral clustering [16], and eigenspace-based spectral clustering [17]. Zarei and Samani [14] gave out a spectral method based on the network complement and anticommunity concept, declaring “the spectrum of matrixes corresponding to a network complement reveals the communities more accurately than that of a matrix corresponding to the network itself.” Zarei et al. [15] also put forward a spectrum method based on complex eigenvectors and found that the complex eigenvectors of network matrixes showed better performance in community detection. Mavroeidis [16] proposed a semisupervised spectral clustering, and its results showed that the partial supervision cannot only improve the quality of spectral clustering but also accelerate the spectral clustering. Ma et al. [17] presented an eigenspace-based spectral method for community detection, which can identify both the overlapping and hierarchical community without increasing the time complexity. All these methods try to integrate some additional topology structure information into input matrixes.

Except for methods mentioned above, there are some other newly developed spectral methods for community detection. Gong et al. [18] proposed a spectral algorithm utilizing multiple eigenvectors to identify the communities in networks, which performed better for more spectral information is used. Newman [19] found that, within the spectral approximations, community detection by modularity maximization, community detection by statistical inference, and normalized-cut graph partitioning are identical. With the large-deviation theory, Bo et al. [20] established a relationship between the hierarchical community structure of a network and the local mixing properties.

Recently, a novel theory-topology potential theory was introduced to complex network for community detection [21]. Because of its inherent advantage in time complexity and performance, this theory has attracted plenty of attention. Gan et al. [21] put forward a topology-potential-based community detection algorithm. With the algorithm, the community structure can be uncovered by “detecting all local high potential areas margined by low potential nodes.” Han et al. [22] proposed an overlapping community detection algorithm, which divides networks into separate communities by “spreading outward from each local maximum potential node.” Zhang et al. [23] proposed a variable scale network overlapping community identification method based on topology potential. In order to identify overlapping nodes, this method defined an identity uncertainty measure related to topology potential. These above topology-potential-based methods show better performance in community detection; however, there is a weakness for almost all these methods; that is, they definitely need additional strategies or parameters to determine the community attachment of nodes, such as the benefit function in [21] and the parameter in [23].

Different from above works, this paper puts forward a novel community detection algorithm, which combines spectral clustering and topology potential, making best use of their advantages and bypassing their disadvantages. The new algorithm constructs the normalized Laplacian matrix with topology potential of network nodes. The topology potential contains rich structural information of the network, which is meaningful for community detection. What’s more, the new algorithm can automatically judge the optimal community number from the local maximum potential nodes, whether the community structure of complex network is obvious or not.

3. Topology Potential

The topology potential field theory is an important branch of the field theory. People abstracted the classical field as a mathematical model to describe noncontact interaction between objects [24]. Any complex network has its relatively stable topology structure; nodes in the network are not isolated, and there exist relationships between nodes linked by edges. Therefore, the topology potential field theory was introduced into complex network to describe the interaction and association among network nodes [22].

Given a network , where is a set of nodes, is the total number of nodes, is a set of edges. According to the topology potential field theory, the topology potential of any node is defined as follows:

where is the topology potential of node , ; the node is a node within the influence scope of node , and is the total number of nodes within the influence scope, , ; is the hops between s and ; is the mass of node ; generally speaking, it is set to 1, and the mass difference between nodes is ignored; is an impact factor used to control the influence scope of node, the maximum scope is hops.

The impact factor will affect topology potential field and the influence scope of node. If is small, the interaction and association among nodes is weak. And when , there is even no interaction and association. Conversely, if is big, the interaction and association become strong, and in extreme conditions, all nodes associate with each. Therefore, we need to select suitable value, so as to make the distribution of topology potential value reflect the structure characteristics of network. Potential entropy has been introduced to evaluate the rationality of topology potential value distribution [21].

Suppose the topology potential of nodes are , respectively; the potential entropy is defined as

where is the total number of nodes; is a normalization factor. When topology potential field achieves the smallest potential entropy, the impact factor value is optimal [25].

As can be seen from the formula (1), the topology potential of a node totally depends on the topology structure of its surroundings, which reflects the influence ability of another node over it. Obviously, the topology potential contains rich structural information of the network, which offers a desirable solution to the insufficient structural information in the traditional Laplacian matrix. If we construct the Laplacian matrix by using topology potential of network nodes, the additional structural information can be provided for community detection. So, this paper puts forward a novel algorithm based on topology potential and spectral clustering to improve the performance of community detection, and Section 4 will describe the new algorithm in detail.

4. Community Detection Algorithm

In this section, we will give out a novel community detection algorithm based on topology potential and spectral clustering. The new algorithm is described as follows.

Input: complex network , the corresponding node set , edge set .

Output: a community partition of .

Algorithm Description:

(1)calculate the topology potential of node with formula (1);(2)search all local maximum potential nodes of . Suppose we find local maximum potential nodes;(3)construct the potential component matrix and topology potential matrix of ;(4)compute the normalized Laplacian matrix of ;(5)compute the first eigenvectors of , is the total number of local maximum potential nodes;(6)map all nodes in to corresponding to eigenvectors ;(7)cluster the nodes in with the -means algorithm into communities .

Compared with the traditional spectral clustering method, the new algorithm constructs the normalized Laplacian matrix with the topology potential of nodes and can automatically get the optimal community number from the local maximum potential node.

The following part of the section will focus on the normalized Laplacian matrix construction and local maximum potential node search of the new community detection algorithm.

4.1. Normalized Laplacian Matrix Construction

In order to add additional structural information of networks, the normalized Laplacian matrix is redefined as follows:

where the adjacency matrix used in the conventional normalized Laplacian matrix is replaced by the potential component matrix and the degree matrix by the topology potential matrix .

The topology potential matrix is an -dimensional diagonal matrix, and the diagonal element , that is, the topology potential of node .

The potential component matrix is matrix, and the matrix elements are the potential component produced by node at the position node , which is defined as follows:

where is the mass of node is the hops between node and node ; is an impact factor used to control the influence scope of node. If , then ; if node is out of the influence scope () of node , then .

Figure 1 shows a simple network model, which contains only six nodes. Here, we take the figure as an example to show the construction of the potential component matrix and topology potential matrix . For this network, the selected optimal impact factor ; thus, the influence scope of node . We can use formula (1) to get the topology potential of all the six nodes. The topology potential of node 1 is 1.3181, and the topology potentials of the other five nodes are 1.3181, 2.0402, 2.0402, 0.8413, and 0.8413, respectively. Thus, we can get the topology potential matrix of Figure 1:

Figure 1: A simple network model.

The topology potential of node 1 is the summation of potential component produced by node 2 (0.5960), node 3 (0.5950), and node 4 (0.1261). Similarly, the topology potential of node 3 is the summation of potential component produced by node 1 (0.5960), node 2 (0.5960), node 4 (0.5950), node 5 (0.1261), and node 6 (0.1261). Thus, we can get the potential component matrix :

Based on formula (2), the normalized Laplacian matrix is

4.2. Local Maximum Potential Node Search

The hill-climbing method is a traditional algorithm for local maximum point search, which may leave out some local maximum points, and search performance is greatly influenced by initial point selection. We give out a new local maximum potential node search algorithm with review to local maximum potential nodes’ characteristics.

The key steps of the new search algorithm are shown as follows.

(1)All network nodes are initialized to “unvisited.”(2)Randomly choose an “unvisited” node and compare the topology potential of with its neighbors’. If the topology potential of is higher than all neighbors’, then jump to step ; otherwise, jump to step .(3)Add to the local maximum potential node set and mark as well as its all neighbors “visited.”(4)Mark “visited,” and mark neighbors with lower topology potential than ’s “visited.”(5)Repeat steps , , and , until all nodes in network are marked “visited.”(6)If there are two local maximum potential nodes whose distance, that is, hops, is smaller than , then we delete the smaller one from .(7)Output the final local maximum potential node set .

More details about local maximum potential node search can be referred to [24].

5. Simulation Experiments

In this section, a series of experiments will be carried out to empirically evaluate the performance of the new algorithm. Simulation program was implemented with MATLAB. The experiment data include two kinds of complex networks: artificial networks and real world networks. The artificial networks were generated by ad hoc model [26] and LFR Benchmark generator [27]. LFR Benchmark is a network generator, which produces networks with power-law degree distribution and with implanted communities within the network [27]. The real world networks come from http://www-personal.umich.edu/~mejn/netdata/. The normalized mutual information (NMI) [28], a widely used measure, is calculated for the community partition by each algorithm.

5.1. Ad Hoc Network

The generated ad hoc network, with 128 nodes, is split into 4 communities containing 32 nodes each. The parameter is the average edge that links one node with other nodes of different communities. As increases, the community structure of the ad hoc network becomes ambiguous gradually. In the experiment, we changed from 0 to 8 and observed the corresponding NMI produced by six methods: our algorithm, traditional spectral method, the -means based on diffusion distance (DD -means) [26], the -means based on dissimilarity index (DI -means) [26], Fast Newman algorithm [29], and Extremal Optimization method [30].

The experiment results are shown in Figure 2, where -axis represents the value of NMI, and each point represents an average 30 simulation experiments. Compared with the other five methods, our algorithm is only slightly worse than the Extremal Optimization method for . Our algorithm has a good performance for the ad hoc network, and the accurate rate is more than 98% for .

Figure 2: The NMI of the six methods with the change of .

5.2. LFR Network

In generated LFR networks, the node degree and community size distribute according to power law. A mixing parameter is defined as the ratio between the external degree of a node with respect to its community and the total degree of the node [26], . As increases, the community structure of the LFR network becomes ambiguous gradually. There are many other parameters used to control the generated LFR networks: the number of nodes , the average node degree , the maximum node degree , the minimum community size , and the maximum community size [26].

In our experiments, we changed from 0 to 0.8 and observed the corresponding NMI produced by seven methods: our algorithm, traditional spectral method, Danon algorithm, Louvain algorithm, Infomap algorithm, Clique Percolation algorithm [28], and Fast Newman algorithm [29]. We used the default parameter configuration where , , , , and .

The experiment results are shown in Figure 3, where -axis represents the value of NMI. Compared with other six algorithms, our algorithm performs quite well, and its accuracy is only slightly worse than that of the Clique Percolation, Louvan, and Informap in the case of . Because of the complexity of topology potential distribution in the topology potential field, local maximum potential nodes may not necessarily the real central nodes of communities in some cases, resulting in the split or merger of some actual communities and the fluctuation of NMI value.

Figure 3: The NMI of the seven methods with the change of .

5.3. American College Football Network

The American College Football network [18] contains 115 teams, among which 616 games were carried out. In the network, nodes represent teams and edges games. All teams are organized into 12 conferences, and each of which contains about 8–12 teams. These 12 conferences are Atlantic Coast, Big East, Big Ten, Big Twelve, Conference USA, Independents, Mid American, Mountain West, Pacific Ten, Southeastern, Sun Belt, and Western Athletic.

We compared our algorithm with other three algorithms, including the traditional spectral algorithm, the spectral algorithm based on modularity [18], and CMITP (community members identification based on topology potential) [22].

Firstly, we compared our algorithm with the traditional spectral algorithm. The latter cannot obtain the football network community number from the ladder distribution of eigenvector elements; therefore, we set its community number the same as our method. Figures 4 and 5 show the community detection results by our algorithm and traditional spectral algorithm, respectively. Each node represents a competing team, using its name as label. The teams in same community are marked the same color. For this network, the traditional spectral algorithm gets six correct communities: Mountain West, Atlantic Coast, Southeastern, Pacific Ten, Big Ten, and Conference USA. Compared with the traditional spectral algorithm, our algorithm gets three new correct communities: Big Twelve, Big East, and Mid American. For the conference Western Atlantic, our algorithm gets 9 correct teams, with only 1 team missing. Both algorithms split the conference Sun Belt and Independents.

Figure 4: The community detection results by our algorithm.

Figure 5: The community detection results by the traditional spectral algorithm.

Secondly, we compared our algorithm with the spectral algorithm based on modularity. Tables 1 and 2 show the results of our algorithm and the spectral algorithm based on modularity, respectively. The conference names are listed in the leftmost column, and columns represent the communities found by the two algorithms. Each found community consists of teams from one or more conferences as indicated by the numbers in the corresponding column [18]. The spectral algorithm based on modularity divided this network into 10 communities, and six communities are correctly detected: Atlantic Coast, Big East, Big Ten, Big Twelve, Mid American, and Pacific Ten. Compared with the spectral algorithm based on modularity, our algorithm found 11 communities and got a new correct communities Mountain West.

Table 1: The community detection results of our algorithm.

Atlantic Coast

9

9

Big East

8

8

Big Ten

11

11

Big Twelve

12

12

Conference USA

9

1

10

Independents

1

2
1

1

5

Mid American

13

13

Mountain West

8
8

Pac Ten

10

10

Southeastern

12

12

Sun Belt

3

4

7

Western Atlantic
9

1

10

9
20
12
14
9
10
5
10
12
6
8
115

Table 2: The community detection results of the spectral algorithm based on modularity.

Atlantic Coast

9

9

Big East

8

8

Big Ten

11

11

Big Twelve

12

12

Conference USA

1

9

10

Independents

2

2

1
5

Mid American

13

13

Mountain West

8
8

Pacific Ten
10

10

Southeastern

12

12

Sunbelt

3

4
7

Western Atlantic

1
8

1
10

10
11
12
10
16
9
9
15
9
14
115

The CMITP method divided this network into 17 communities, and there are many overlapping nodes between communities, such as nodes “Hawaii” and “Nevada.” Table 3 shows the community number, and NMI of four different algorithms. Compared with other three methods, our algorithm got the highest NMI 0.9292. In addition, our algorithm found 11 communities, which is the closest to the real community number 12.

Table 3: The community number, and NMI of four algorithms.

Community number

NMI

The real community
12
0.5540
1.0000

Our algorithm
11
0.5879
0.9292

Traditional spectral
11
0.5792
0.8879

Spectral based on modularity
10
0.5870
0.8800

CMITP
17
0.5538
—

5.4. The Influence of Impact Factor on Algorithm Performance

The impact factor will affect topology potential field and the influence scope of node. With different impact factor , the distribution of topology potential value will be different. These changes may bring out different community detecting results. We take a real world network, the Zachary karate club network, to analyze the influence of impact factor on algorithm performance. Figure 6 shows the NMI of our algorithm with different impact factor .

Figure 6: The influence of on algorithm performance.

Figure 6 shows that if , the NMI is 0; if , the NMI is 1; if , the NMI is 0.8372; if , the NMI is 0.6459; if , the NMI is 0.1701. The analysis is as follows. The maximum influence scope of node is hops. When , the influence scope of node = 0; it means that all nodes are isolated and have same topology potential value. For Zachary network, the optimal is 1.02 according to formula (2). When , we can detect accurate community structure, and the NMI is 1. But as further increases, one node can associate with almost all the other nodes. In this case, the distribution of topology potential value cannot truly reflect the structure characteristics of network; therefore, the community detecting results are bad. In a word, as long as the impact factor is set near the optimal value, our algorithm can get good outcomes.

6. Conclusion

Identifying community structure is crucial for understanding complex networks. Recently, spectral clustering algorithms have been successfully applied in community detection. The traditional spectral clustering methods cannot provide sufficient structural information for community detection and cannot always get the community number from the ladder distribution of eigenvector elements. Aiming at these inadequacies, this paper puts forward a novel community detection algorithm based on topology potential and spectral clustering. The new algorithm constructs the normalized Laplacian matrix with network nodes’ topology potential, which contains rich structural information of the network. In addition, the new algorithm can automatically judge the optimal community number from the local maximum potential nodes. Experiments on ad hoc network, LFR network, and the American college football network showed that the new algorithm can improve the accuracy of community detection and has significant adaptability.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgment

This work was supported by the Fundamental Funds for the Central Universities (2014QNB23).

References

Z. Wang, Y. Zhao, Z. Chen, and Q. Niu, “An improved topology-potential-based community detection algorithm for complex network,” The Scientific World Journal, vol. 2014, Article ID 121609, 7 pages, 2014.

R. W. Myster, “A refined methodology for defining plant communities using postagricultural data from the neotropics,” The Scientific World Journal, vol. 2012, Article ID 365409, 9 pages, 2012.

G. Palla, A. Barabási, and T. Vicsek, “Quantifying social group evolution,” Nature, vol. 446, no. 7136, pp. 664–667, 2007.

W.-D. Zhou and L. Nakhleh, “Convergent evolution of modularity in metabolic networks through different community structures,” BMC Evolutionary Biology, vol. 12, no. 1, article 181, 2012.

G. K. Orman, V. Labatut, and H. Cherifi, “Comparative evaluation of community detection algorithms: a topological approach,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2012, no. 8, Article ID P08001, 2012.

X. Ma and L. Gao, “Non-traditional spectral clustering algorithms for the detection of community structure in complex networks: a comparative analysis,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2011, no. 5, Article ID P05012, 2011.

U. von Luxburg, “A tutorial on spectral clustering,” Statistics and Computing, vol. 17, no. 4, pp. 395–416, 2007.

S. Chauhan, M. Girvan, and E. Ott, “Spectral properties of networks with community structure,” Physical Review E, vol. 85, no. 2, Article ID 029906, 10 pages, 2012.

A. Arenas, A. Díaz-Guilera, and C. J. Pérez-Vicente, “Synchronization reveals topological scales in complex networks,” Physical Review Letters, vol. 96, Article ID 114102, 4 pages, 2006.

X.-Q. Cheng and H.-W. Shen, “Uncovering the community structure associated with the diffusion dynamics on networks,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2010, no. 4, Article ID P04024, 2010.

M. E. J. Newman, “Modularity and community structure in networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 103, no. 23, pp. 8577–8582, 2006.

H.-W. Shen, X.-Q. Cheng, and B.-X. Fang, “Covariance, correlation matrix, and the multiscale community structure of networks,” Physical Review E, vol. 82, Article ID 016114, 2010.

S. Hua-Wei and C. Xue-Qi, “Spectral methods for the detection of network community structure: a comparative analysis,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2010, no. 10, Article ID P10020, 2010.

M. Zarei and K. A. Samani, “Eigenvectors of network complement reveal community structure more accurately,” Physica A: Statistical Mechanics and Its Applications, vol. 388, no. 8, pp. 1721–1730, 2009.

M. Zarei, K. A. Samani, and G. R. Omidi, “Complex eigenvectors of network matrices give better insight into the community structure,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2009, Article ID P10018, 2009.

D. Mavroeidis, “Accelerating spectral clustering with partial supervision,” Data Mining and Knowledge Discovery, vol. 21, no. 2, pp. 241–258, 2010.

X. Ma, L. Gao, and X. Yong, “Eigenspaces of networks reveal the overlapping and hierarchical community structure more precisely,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2010, no. 8, Article ID P08012, 2010.

X. Gong, K. Li, M.-H. Li, and C.-H. Lai, “A spectral algorithm of community identification,” EPL (Europhysics Letters), vol. 101, no. 4, Article ID 48001, 2013.

M. E. J. Newman, “Spectral methods for community detection and graph partitioning,” Physical Review E, vol. 88, Article ID 042822, 2013.

Y. Bo, J. Liu, and J. Feng, “On the spectral characterization and scalable mining of network communities,” IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 2, pp. 326–337, 2012.

W. Y. Gan, N. He, D. Y. Li, and J. M. Wang, “Community discovery method in networks based on topological potential,” Journal of Software, vol. 20, no. 8, pp. 2241–2254, 2009.

Y. Han, D. Li, and T. Wang, “Identifying different community members in complex networks based on topology potential,” Frontiers of Computer Science in China, vol. 5, no. 1, pp. 87–99, 2011.

J. Zhang, H. Li, J. Yang, J. Bai, L. Zhang, and Y. Chu, “Variable scale network overlapping community identification based on identity uncertainty,” Acta Electronica Sinica, vol. 40, no. 12, pp. 2512–2518, 2012.

Z.-X. Wang, Z.-T. Chen, Y. Zhao, and Q. Niu, “A novel local maximum potential point search algorithm for topology potential field,” International Journal of Hybrid Information Technology, vol. 7, no. 2, pp. 1–8, 2014.

Z.-X. Wang, S.-X. Xia, and Q. Niu, “A novel ontology analysis tool,” Applied Mathematics & Information Sciences, vol. 8, no. 1, pp. 255–261, 2014.

J. Liu, “Comparative analysis for k-means algorithms in network community detection,” in Advances in Computation and Intelligence, vol. 6382 of Lecture Notes in Computer Science, pp. 158–169, Springer, 2010.

A. Lancichinetti and S. Fortunato, “Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities,” Physical Review E, vol. 80, no. 1, Article ID 016118, 2009.

H. J. Li, J. Zhang, Z. P. Liu, L. Chen, and X. S. Zhang, “Identifying overlapping communities in social networks using multi-scale local information expansion,” The European Physical Journal B, vol. 85, no. 6, article 190, pp. 190–198, 2012.

M. E. J. Newman, “Fast algorithm for detecting community structure in networks,” Physical Review E, vol. 69, no. 6, Article ID 066133, pp. 1–66133, 2004.

J. Duch and A. Arenas, “Community detection in complex networks using extremal optimization,” Physical Review E, vol. 72, no. 2, Article ID 027104, 2005.