Mobile communication user group construction method on the basis of fraction filtering and label propagation

Abstract

The present invention provides a mobile communication user group construction method on the basis of fraction filtering and label propagation, belonging to the field of date business. The method comprises: calculating the connection closeness among user nodes; building a weighted complex network among the user nodes; constructing a seed group of a social relation group through adoption of a fraction filtering algorithm on the basis of the weighted complex network; initiating all the node labels in the network on the basis of the seed group, namely distributing initial labels for each node; and performing label propagation through adoption an improved SLPA algorithm, dividing the nodes to corresponding groups on the basis of the labels of the nodes when the labels of the major nodes are converged, and completing the construction of the social relation group, namely constructing a group of nodes which have the same labels. The mobile communication user group construction method on the basis of fraction filtering and label propagation is able to obtain a good user friend recommend effect and a good cooperation recommend effect, is helpful for users to form analysis and discover an abnormal colony, and is taken as the division base of the next generation communication.

Description

technical field [0001] The invention belongs to the field of data services, in particular to a mobile communication user group construction method based on faction filtering and label propagation. Background technique [0002] In the prior art, there is no document about the method of constructing a social relationship group through communication information between users and discovering a group center user. The relatively similar SLPA (Speaker-listener Label Propagation Algorithm, speaker-lisener label propagation strategy algorithm) algorithm has near-linear time complexity and good performance, and is more suitable for socializing between users in the context of a large data set. The construction of relationship groups. The SLPA algorithm initially assigns a unique label to all user nodes, which slows down the iterative convergence time of the algorithm, and may cause oscillations in the synchronous update strategy, and its robustness is relatively poor. In addition, al...

AI Technical Summary

Problems solved by technology

The SLPA algorithm initially assigns a unique label to all user nodes, which slows down the iterative convergence time of the algorithm, and may cause oscillations in the synchronous update strategy, and the robustness is relatively poor

In addition, although the algorithm can discover overlapping communities, it is mainly aimed at unprivileged networks and cannot be directly applied to authorized complex networks.

Images