Overlapped Community Identification In Society Network

Complex networks in all fields in our real life:working relationship network, communication network, computer network. Therefore, Community Identifying in complex network becomes one of the most popular areas of current research. Complex networks with internal organization structure, Internal nodes more compact, or internal community can achieve some special potency.In the previous Complex networks community identifying algorithms mostly for non overlapped community identifying, only a few of the overlapped community identifying algorithm with the fault of the precision is not satisfied. And most of the algorithms need some extra parameters for community identifying, because of some parameters are difficult to obtain, therefore Community Identifying in the large scale complex network more difficult.This article uses undirected graph for modeling, Take the value of PageRank and similarity into account, as the attribute of the link, and uses Quadratic Discriminant to classify the model of links. We can find the opinion leader of the inner community.