Network community dividing method and device

Abstract

The invention provides a network community dividing method and device and solves problems that community core nodes are found in a limited manner, community peripheral nodes are ignored and acquired node attribute information is incomplete during community division. The network community dividing method comprises steps as follows: acquiring the common adjacency degree of each node in a community network; judging communities to which the nodes belong according to the common adjacency degrees, and dividing the community structure to acquire sub-communities. Thus, community division can be performed by the aid of common neighbors of all the nodes.

Description

technical field [0001] The invention relates to the field of mobile communication, in particular to a method and device for dividing network communities. Background technique [0002] There are generally two methods for community discovery: one is based on ordinary clustering, using the individual attributes of nodes or the attributes of the relationship between nodes, but the accuracy of the algorithm is often affected by the incomplete attribute information. [0003] The other is based on network topology information, using graph theory methods, usually based on the link relationship between graph nodes, such as graph splitting and graph agglomeration methods, whose core idea is to make the connections between individuals in the cluster as possible compact, while the connections between clusters are as sparse as possible. [0004] The above two methods usually tend to find the core of the community, the node information obtained is incomplete, and the community cannot be ...

AI Technical Summary

Problems solved by technology

[0004] The above two methods usually tend to find the core of the community, the obtained node information is incomplete, and the community cannot be accurately divided

Images