Optimization Application Base on the Social Complex Network Algorithm 

Hua ZHANG 

Hunan Information College, Changsha Hunan 410151, CHINA 

Abstract: As for the present community discovery and compression algorithm ignoring the issue of network community structures, this paper proposes a community discovery GS algorithm and community compression SNC algorithm. On the basis of proposing the theorems and corollaries related to the importance of the nodes in community discovered by topological method. GS algorithm discoveries the important nodes on different levels in community, and then through social networks compresses SNC algorithm and according the importance of the node compresses the community. Experimental results show that: the proposed algorithm can maintain the relationship between the communities during the compression process. It has a good community compression, in which the ratio can up to 0.95, and at the same time it can retain the important nodes in the community ｏｒ community basic structures. 

Keywords: Figure Compression; Community Discovery; Routing Selection; Node