Two-Stage User Identification Based on User Topology Dynamic Community Clustering

Complexity 2021:1-10 (2021)
  Copy   BIBTEX

Abstract

In order to solve the problem of node information loss during user matching in the existing user identification method of fixed community across the social network based on user topological relationship, Two-Stage User Identification Based on User Topology Dynamic Community Clustering algorithm is proposed. Firstly, we perform community clustering on different social networks, calculate the similarity between different network communities, and screen out community pairs with greater similarity. Secondly, two-way marriage matching is carried out for users between pairs of communities with high similarity. Then, the dynamic community clustering was performed by resetting the different community clustering numbers. Finally, the iteration is repeated until no new matching user pairs are generated, or the set number of iterations is reached. Experiments conducted on real-world social networks Twitter-Foursquare datasets demonstrate that compared with the global user matching method and hidden label node method, the average accuracy of the proposed UIUTDC algorithm is improved by 33% and 26.8%, respectively. In the case of only user topology information, the proposed UIUTDC algorithm effectively improves the accuracy of identity recognition in practical applications.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Overlapping Community Detection in Dynamic Networks.Nathan Aston - 2014 - Journal of Software Engineering and Applications 7:872-882.

Analytics

Added to PP
2021-04-18

Downloads
5 (#1,514,558)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references