Matching user accounts based on location verification across social networks

<!-- metadata commented in wiki content


<div class="center" style="width: auto; margin-left: auto; margin-right: auto;">
<big>'''Matching User Accounts Based on Location Verification across Social Networks'''</big></div>

<div class="center" style="width: auto; margin-left: auto; margin-right: auto;">
'''  Xueyan Zhou<sup>1</sup>, Jing YANG<sup>1,*</sup>, Zehong LIN<sup>2</sup>, He Xu<sup>2</sup>'''</div>

'''1. College of computer science and technology, Harbin Engineering University, Harbin, China'''

'''2. College of Mechanical and Electrical Engineering, Harbin Engineering University, Harbin, China'''
-->

==Abstract==

Social network has become the main platform for people to obtain information and connect with each other. Matching user accounts can help us build better users’ profiles and benefit many applications. It has attracted much attention from both industry and academia. At present, cross-platform user identification can be divided into three categories: based on user basic attribute information, user online social structure relationship and user behavior. Research on mobile social networks is a kind of dynamic mixed data analysis. Due to the remarkable heterogeneity of its data across platforms and the incomplete and untrue information caused by users’ concealment behavior, the recognition rate of the algorithm is relatively low. The paper provides a new matching user accounts method based on location verification. First, the self-centered network algorithm is applied to find cross-network edges in the respective networks of the two users to be matched, which is taken as the initial similarity value of the two users. Secondly, the longitude, latitude and time coordinates of a single platform node were used to modify the similarity. Specific 5 time points were selected within 24 hours and the error range of 10min was taken as the calculation method of great circle distance. Thirdly, since the user did not log in a certain social platform in a certain period of time, the convolutional neural network algorithm was adopted to mark the trajectory. Finally, all users in the whole network are identified by iterative operation. Experimental results on artificial random networks and real social networks show that the proposed algorithm has a high readiness rate and recall rate.

''''Keywords'''：Social networking service, across social networks, matching user accounts, location verification

==1. Introduction==

In recent years, the binding of personal life information and mobile intelligent terminals has become increasingly close [1,2]. By March 2019, 47% of the world’s population had Internet access. 81 percent (1 billion users) are in developed countries, 40.1 percent (2.5 billion users) are in developing countries and 15.2 percent are in underdeveloped countries. 98% Internet users use at least one social network, with an average 7.6 online accounts per user [3]. Globally, the largest online accounts per user were in Latin America (8.8) and Asia (8.1) [4]. Because the data volume of mobile intelligent terminals is too large, especially the problem of cross-platform collaborative processing of different accounts has not been solved, the IT industry’s service cost for mobile intelligent terminals is high [5,6].

Human beings generate a large amount of social data through mobile network all the time, which contains information such as interaction information, emotional evolution, community composition and action trajectory, etc. Through reasonable modeling and mining, different social relations and distribution characteristics can be revealed. Cross-platform user identification can effectively solve the situation that the users are separated into isolated social networks [7,8]. So, the same user identifying process in different social network has great practical significance, including commercial marketing, network security and privacy protection, etc. [9, 10]. Mobile social network mixed data modeling research mainly includes two parts: user location data preprocessing in multi-social platform and multi-source social relationship modeling and analysis. This paper proposes a cross-network user identity link method combined with location coordinate verification.

==2. Related research==

===2.1 Research of cross-platform user identification===

Cross-platform user identity identification is mainly divided into network user real identity identification, social network user geographic location identification and cross-network co-user linking. In which, the network user identity identification were generally done by social platform, there are also some scholars identifying the real users through big data analysis. Such as the social network identity recognition method was proposed using location based social network and user’s relationship to identify users and speculate the address, information and interest [11]. The geo-location prediction of a social network user is mainly to get the user’s geographic location using the social data. For example, the relationship in Facebook was used to predict the users’ geographical location and the conclusion was that there are more than 5 locatable users in the relationship network, and then the other users’ geographical location can be effectively predicted [12]. Cross-network co-user linking is the process to finding the same user in different types of social networks. Generally speaking, in order to enjoy different experiences and services, everyone will participate in different social networking sites. On one hand, the cross-network co-user linking is useful for public opinion analysis and control; on the other hand, it is also helpful to mine knowledge association of multi-source data for personalized service. The multi-source of social media is mainly reflected in the heterogeneous users’ behavior information from the different social media networks [13]. So understanding the multi-source phenomenon of social media is of great significance for the analysis of social media and the in-depth application of big data of social media.

===2.2 Major problems exist in cross-network co-user linking===

Cross-platform user identity identification can be divided into three categories: based on user basic attribute information, user online social structure relationship and based on user behavior [14]. Specifically, data analysis is mainly based on attribute information such as name, friends, and user behavior. The main difficulties are the lack of user information, false problems and heterogeneous data caused by platform differences.

Social network users will intentionally hide some information due to privacy disclosure. In the dataset, at least 85% users were missing two key attributes, while few people filled out options such as interests and hobbies, and fewer than 5 percent of users filled out all options. Serious information missing brings challenges to user identification based on user basic attribute information. Email authentication and mobile phone SMS authentication are the two basic registration way in some social software. At the same time, users may not provide real information for registration, and will generally use a core word to do different extensions, such as adding surname and number to register on different platforms, and women generally do not fill in the real age, some men have false age and gender, so the recognition algorithm cannot identify malicious user interference.

Social platforms have obvious differences in order to provide various user experiences [15]. So the same user will fill different information for personalized social software, which also makes it harder to identify users. For example, users publish and pay attention to things in different fields on different platforms. They follow a lot of celebrity gossip on weibo, get a lot of public health accounts and groups on WeChat, and discuss their own work in QQ work group. Or one user will update a social platform in real time, show the feeling for a movie on WeChat, and collect photos and sending them to other platforms irregularly or randomly adding pictures when they feel something, which makes it impossible to use timestamp as an effective way to measure the user’s identity.

It can be seen that the lack and accuracy of information bring great challenges to cross-platform user identity identification based on user attributes, and the different performance of users in different platforms also makes it difficult for the identity measurement method based on events, semantics or even time evolution to achieve ideal results.

===2.3 Research progress of cross-network co-user linking===

At present, the research on cross-network co-user linking mainly applies the explicit attribute information such as user name and image. A method based on user name was proposed to determine user identity. Based on the user names attribute quantitative analysis, the identity results can be given for further linking, they carried out confirmatory experiments on large-scale real data sets [16]. A new cross-network co-user identification algorithm based on information entropy were proposed, the main idea was analyzing the different data types and physical meaning of the attribute items, accordingly the different similarity calculation method, and according to the weights of attributes and information entropy is given to excavate the potential information of each attribute the final fusion decisions determine whether the account matching for each attribute [17]. On the other hand, recognition effect only based on attribute information is limited, so lots of friends’ topology relations researches appeared. The principle of three degrees influence was used to build a speculation model, which can identify users through complete sub-graph of social network user identity identification. Xu et al. [18] proposed a cross-network co-user linking algorithm based on weighted hypergraph to solve the problem that the existing friend-based algorithm does not have a high utilization rate of heterogeneous relationships in social networks. However, most studies fail to apply location information to cross-platform common user connection. Based on this, this paper proposes a cross-network co-user linking algorithm method combined with location coordinate verification.

==3. Cross-network user identity link method based on location verification==

===3.1 link method based on friend relationship===


'''Define 1''' user identity. The virtual account ''v<sub>i</sub>'', where ''v<sub>i</sub>'' presents the network account of user ''i''.

'''Define 2 '''Labeled nodes. A node has been identified, and it can be represented as c''v<sub>i</sub>''. The network graphs can be abstracted into a powerless and undirected topology, which can be described by mathematical language as follows:

{| class="formulaSCP" style="width: 100%; text-align: center;" 
|-
| 
{| style="text-align: center; margin:auto;" 
|-
| <math> G=\left( \bigcup _{i=1}^{n}{V}_{i},\bigcup _{i=1}^{n}{E}_{i},\bigcup _{i=1}^{n}{L}_{i},\bigcup _{i\not =j}^{n}{C}_{i,j}\right)</math>
|}
| style="width: 5px;text-align: right;white-space: nowrap;" | (1)
|}

where ''V<sub>i </sub>''is the user accounts set of network ''G<sub>i</sub>, and ''each node ''v<sub>i </sub>''is an account in network'' G<sub>i</sub>''. ''E<sub>i </sub>''is the edge set in single network marked with “internal”, <math display="inline">{e}_{i}^{1,2}\quad</math> is an edge between <math display="inline">{v}_{i}^{1}\, \,</math> and <math display="inline">{v}_{i}^{2}\, \,</math> in network'' G<sub>i </sub>''( <math display="inline">{v}_{i}^{1},internal,{v}_{i}^{2}</math>) , and means the two users are friends online. ''C<sub>i,j</sub>'' is the edge set across different networks marked with “cross”, <math display="inline">\, {C}_{i,j}^{1,2}</math> is an edge between <math display="inline">{\, v}_{i}^{1}</math> in ''G<sub>i</sub>'' and <math display="inline">{v}_{i}^{2}</math> in ''G<sub>j</sub>'' ( <math display="inline">{v}_{i}^{1},cross,{v}_{i}^{2}</math>), and means the two users are the same people in real world.

Based on the above definition, the cross-network identity identification can be expressed as: to realize the identity identification of a person in different networks, to find out multiple accounts that the person has in different networks, thus forming the “connection mapping” <math display="inline">\varnothing \left( {v}_{i}\right) =\ldots =\varnothing \left( {v}_{j}\right)</math>  between multiple accounts. The inputs are single-network social network topology, and their outputs are labeled nodes ''CV<sub>i </sub>''and cross edge set ''C<sub>i,j</sub>''.

The existing self-center network algorithm is to find and match the cross-network connection formed between labeled nodes in the self-center network, which can be used as the similarity value of the two nodes. The flowchart is shown in Figure 1. If the similarity value is greater than a certain threshold value, it is judged as a successful match, otherwise it fails. After K time’s iteration, the matched nodes can be new labeled nodes. When no new labeled nodes are added to the network, the iteration algorithm stops.

<div class="center" style="width: auto; margin-left: auto; margin-right: auto;">
[[Image:Review_740794452698-image1.png|402px]] </div>

<div class="center" style="width: auto; margin-left: auto; margin-right: auto;">
Figure 1 the existing self-center network algorithm</div>

===3.2 position coordinates and distance===

'''Define 3 '''the location information. The location information of single network platform composed with longitude, dimension, and time coordinates <math display="inline">{\, L}_{i}=</math><math>({lat}_{i},{lon}_{i},{t}_{i})</math>.For similar nodes, the location information at time t should be selected and recorded.

{| class="formulaSCP" style="width: 100%; text-align: center;" 
|-
| 
{| style="text-align: center; margin:auto;" 
|-
| <math display="inline">\quad \quad \quad \quad \quad \quad \quad t\in (6:00\, a.m.,10:00\, a.m.,14\, p.m.,18:00\, p.m.,22:00\, p.m.)</math>
|}
| style="width: 5px;text-align: right;white-space: nowrap;" | (2)
|}

where, (<math display="inline">t-\Delta t,t+\Delta t</math>) is a permit range with and <math display="inline">\Delta t</math> equals 10min. The selection of time point t mainly consists of several obvious online peak time points of social network users.

'''Define 4 '''A distances calculating method between geographical locations. ''l<sub>i </sub>''and ''l<sub>j</sub>''represent the geographic location of user ''i'' and user ''j'', respectively. (''lat<sub>i</sub>, lon<sub>i</sub>'') is the longitude and latitude coordinates of location ''l<sub>i</sub>'', and (''lat<sub>j</sub>, lon<sub>j</sub>'') is for ''l<sub>j</sub>''.''' '''The distance between the two Global Positioning System (GPS) coordinates is calculated by using the great circle distance. The great circle distance refers to the shortest path length from one point to another point on the sphere. The calculation method is as follows:

{| class="formulaSCP" style="width: 100%; text-align: center;" 
|-
| 
{| style="text-align: center; margin:auto;" 
|-
| <math>d\left( {l}_{i},{l}_{j}\right) =2R\times arcsin{({sin}^{2}\left( \frac{{lat}_{i}-{lat}_{j}}{2}\right) +cos({lat}_{i})cos({lat}_{j}){sin}^{2}(\frac{{lon}_{i}-{lon}_{j}}{2}))}^{\frac{1}{2}}</math>
|}
| style="width: 5px;text-align: right;white-space: nowrap;" | (3)
|}


where, <math display="inline"> R</math> is the earth Radius (6371''km''), so the'' d ''(''l<sub>i</sub>'',''l<sub>j</sub>'') is in kilometers.

===3.3 Track labeling and similarity===

It is not excluded that the user did not log on a certain social platform in a certain period of time. Therefore, the convolutional neural network algorithm is adopted to mark the trajectory of the first stage, input the characteristics of the trajectory, and output the labeled nodes. The trajectory labeling can be regarded as a multi-label classification problem, so multiple labeling terms of corresponding trajectory can exist jointly. Therefore, the dimension of the supervision vector corresponding to the multi-category information of the sample is set as 1, and the excitation function of the output layer is the logistic function. The results of the output layer need to be sorted, and the former category is the predicted result of the sample category by the convolutional neural network. Convolutional neural network consists of two steps:

'''Step 1''': Forward propagation phase: ①Take a sample(''X'', ''Y<sub>p</sub>'') from the sample set, input X into the network; ② Calculate the corresponding actual output ''O<sub>p</sub>''. At this stage, the information is transformed from the input layer to the output layer. This process is also the process that the network performs when it is running normally after training.

'''Step 2: '''Backward propagation phase: ① Calculate the difference between the actual output ''O<sub>p </sub>''and the corresponding ideal output ''Y<sub>p</sub>''; ② Adjust the weight matrix according to the method of the minimizing error. The back propagation algorithm is based on gradient descent, which is divided into two steps: forward propagation produces output results and computational errors and adjusts weights by back propagation. For sample n, the error is:

{| class="formulaSCP" style="width: 100%; text-align: center;" 
|-
| 
{| style="text-align: center; margin:auto;" 
|-
| <math>{E}^{n}=\frac{1}{2}\sum _{k=1}^{c}{({t}_{k}^{n}-{y}_{k}^{n})}^{2}= \, \frac{1}{2}\vert \vert {t}^{n}- {y}^{n}\vert {\vert }_{2}^{2}</math>
|}
| style="width: 5px;text-align: right;white-space: nowrap;" | (4)
|}

where, ''c'' is the number of samples categories, <math display="inline">{t}_{k}^{n}</math> the target value of the ''n<sup>th</sup> ''sample’s ''k<sup>th</sup>'' dimension (the classification label), indicates the ''k<sup>th</sup> ''dimension output corresponding to the ''n<sup>th</sup> ''sample. Specifically, the trajectory information fitting adopts a method of fitting at a common time point, so it means ignoring the problem of trajectory absence of the cross-platform social media at the same time.

==4. Experiment==

In order to verify the practicability of the algorithm, this paper extracts real data from Facebook and Twitter, and then collects the accounts in the friend list of 14 students who have registered their accounts in the two networks. Among them, 308 accounts were found on the Facebook network and 877 internal links were found, while 896 accounts and 3,541 internal links were found on the Twitter network. There are 139 cross links between the two networks, which means that 139 pairs of accounts can be mapped to the same offline user according to the network structure, and then only 107 pairs of accounts can be valid users by applying position verification, as shown in Table 1.

<div class="center" style="width: auto; margin-left: auto; margin-right: auto;font-size: 75%;">
'''Table 1'''. Cross-network user statistic based on seed users</div>

{| style="width: 65%;margin: 1em auto 0.1em auto;border-collapse: collapse;font-size: 85%;" 
|-
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|'''Social network'''
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|'''nodes'''
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|'''edges'''
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|'''Accosted edges'''
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|'''Location confirm edges'''
|-
|  style="border-top: 1pt solid black;text-align: center;vertical-align: top;"|Facebook
|  style="border-top: 1pt solid black;text-align: center;vertical-align: top;"|308
|  style="border-top: 1pt solid black;text-align: center;vertical-align: top;"|877
|  style="border-top: 1pt solid black;text-align: center;vertical-align: top;"|139
|  style="border-top: 1pt solid black;text-align: center;vertical-align: top;"|107
|-
|  style="text-align: center;vertical-align: top;"|Twitter
|  style="text-align: center;vertical-align: top;"|896
|  style="text-align: center;vertical-align: top;"|3541
|  style="text-align: center;vertical-align: top;"|139
|  style="text-align: center;vertical-align: top;"|107
|-
|  style="border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|Total
|  style="border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|1204
|  style="border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|4418
|  style="border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|278
|  style="border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|214
|}


In this paper, some nodes were randomly selected from the cross-connected edges as prior label nodes, whose minimum value in this experiment was 20 and maximum value was 80. The precision, recall and comprehensive evaluation index F1 were adopted as evaluation criteria to measure the performance of the algorithm. The definition is as follows:

{| class="formulaSCP" style="width: 100%; text-align: center;" 
|-
| 
{| style="text-align: center; margin:auto;" 
|-
| <math display="inline">{\rm precision}\, = \frac{tp}{\left( tp+fp\right) \, \, }</math>
|}
| style="width: 5px;text-align: right;white-space: nowrap;" | (5)
|}

{| class="formulaSCP" style="width: 100%; text-align: center;" 
|-
| 
{| style="text-align: center; margin:auto;" 
|-
| <math display="inline">\hbox{recall } =\frac{tp}{\left( tp+fn\right) \, \, }</math>
|}
| style="width: 5px;text-align: right;white-space: nowrap;" | (6)
|}

{| class="formulaSCP" style="width: 100%; text-align: center;" 
|-
| 
{| style="text-align: center; margin:auto;" 
|-
| <math display="inline">F1=\displaystyle \frac{(2\times {\rm precision}\times \hbox{recall })}{\left(     {\rm precision} +  \hbox{recall } \right) \, \, }</math>
|}
| style="width: 5px;text-align: right;white-space: nowrap;" | (7)
|}


in which, ''tp'' represents the correctly matching account,'' fp'' represents the wrong ones, ''fn'' is the missing matching account, and the recall is the rate of correct identification.

In this paper, the experiment used random selection, the degree of arrangement and the Pagerank sort to choose tag nodes, respectively. In which, the degree of arrangement mainly choose the bigger degree nodes, the weight network using the co-tag number divided by the co-neighbors number in Pagerank, and the PRF values based on different prior node selection methods on user pairs after position-based verification are shown in Table 2.

<div class="center" style="width: auto; margin-left: auto; margin-right: auto;font-size: 75%;">
'''Table 2'''. Statistics of PRF values based on different prior node selection methods</div>

{| style="width: 85%;margin: 1em auto 0.1em auto;border-collapse: collapse;font-size: 85%;" 
|-
|  rowspan='2' style="border-top: 1pt solid black;text-align: center;"|Data source
|  rowspan='2' style="border-top: 1pt solid black;text-align: center;"|No. of prior tags
|  colspan='3'  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|random
|  colspan='3'  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|degree of arrangement
|  colspan='3'  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|''pagerank''
|-
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|P
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|R
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|F
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|P
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|R
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|F
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|P
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|R
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|F
|-
|  rowspan='7' style="border-top: 1pt solid black;border-bottom: 1pt solid black;"|Facebook Twitter
|  style="border-top: 1pt solid black;text-align: center;"|20
|  style="border-top: 1pt solid black;text-align: center;"|0.533
|  style="border-top: 1pt solid black;text-align: center;"|0.234
|  style="border-top: 1pt solid black;text-align: center;vertical-align: top;"|0.325
|  style="border-top: 1pt solid black;text-align: center;"|0.834
|  style="border-top: 1pt solid black;text-align: center;"|0.167
|  style="border-top: 1pt solid black;text-align: center;vertical-align: top;"|0.278
|  style="border-top: 1pt solid black;text-align: center;"|0.864
|  style="border-top: 1pt solid black;text-align: center;"|0.158
|  style="border-top: 1pt solid black;text-align: center;vertical-align: top;"|0.267
|-
|  style="text-align: center;"|30
|  style="text-align: center;"|0.587
|  style="text-align: center;"|0.284
|  style="text-align: center;vertical-align: top;"|0.383
|  style="text-align: center;"|0.871
|  style="text-align: center;"|0.201
|  style="text-align: center;vertical-align: top;"|0.327
|  style="text-align: center;"|0.901
|  style="text-align: center;"|0.197
|  style="text-align: center;vertical-align: top;"|0.323
|-
|  style="text-align: center;"|40
|  style="text-align: center;"|0.612
|  style="text-align: center;"|0.315
|  style="text-align: center;vertical-align: top;"|0.416
|  style="text-align: center;"|0.895
|  style="text-align: center;"|0.284
|  style="text-align: center;vertical-align: top;"|0.431
|  style="text-align: center;"|0.912
|  style="text-align: center;"|0.291
|  style="text-align: center;vertical-align: top;"|0.441
|-
|  style="text-align: center;"|50
|  style="text-align: center;"|0.687
|  style="text-align: center;"|0.346
|  style="text-align: center;vertical-align: top;"|0.460
|  style="text-align: center;"|0.921
|  style="text-align: center;"|0.306
|  style="text-align: center;vertical-align: top;"|0.459
|  style="text-align: center;"|0.894
|  style="text-align: center;"|0.289
|  style="text-align: center;vertical-align: top;"|0.437
|-
|  style="text-align: center;"|60
|  style="text-align: center;"|0.724
|  style="text-align: center;"|0.452
|  style="text-align: center;vertical-align: top;"|0.557
|  style="text-align: center;"|0.935
|  style="text-align: center;"|0.392
|  style="text-align: center;vertical-align: top;"|0.552
|  style="text-align: center;"|0.931
|  style="text-align: center;"|0.346
|  style="text-align: center;vertical-align: top;"|0.505
|-
|  style="text-align: center;"|70
|  style="text-align: center;"|0.852
|  style="text-align: center;"|0.514
|  style="text-align: center;vertical-align: top;"|0.641
|  style="text-align: center;"|0.969
|  style="text-align: center;"|0.483
|  style="text-align: center;vertical-align: top;"|0.645
|  style="text-align: center;"|0.952
|  style="text-align: center;"|0.492
|  style="text-align: center;vertical-align: top;"|0.649
|-
|  style="border-bottom: 1pt solid black;text-align: center;"|80
|  style="border-bottom: 1pt solid black;text-align: center;"|0.783
|  style="border-bottom: 1pt solid black;text-align: center;"|0.562
|  style="border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|0.654
|  style="border-bottom: 1pt solid black;text-align: center;"|0.934
|  style="border-bottom: 1pt solid black;text-align: center;"|0.496
|  style="border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|0.648
|  style="border-bottom: 1pt solid black;text-align: center;"|0.963
|  style="border-bottom: 1pt solid black;text-align: center;"|0.504
|  style="border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|0.662
|}


In the table, the prior node selection methods based on degree sorting and ''Pagerank ''sorting have higher accuracy, but the recall rate of random selection is better, and there is no significant difference in comprehensive evaluation indexes.

In order to analyze the effect of position information verification, 139 original edge data sets in the social network structure and 107 prior nodes after position verification were respectively taken as 30, 50 and 70 prior nodes for analysis. The prior nodes were all conducted by degree ranking method. The comparison results are shown in Table 3.

<div class="center" style="width: auto; margin-left: auto; margin-right: auto;font-size: 75%;">
'''Table 3'''. Statistics of PRF values before and after combined position verification</div>

{| style="width: 66%;border-collapse: collapse;font-size: 85%;" 
|-
|  rowspan='2' style="border-top: 1pt solid black;text-align: center;"|No. of prior tags
|  colspan='3'  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|Network based 
|  colspan='3'  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|Location verification
|-
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|P
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|R
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|F
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|P
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|R
|  style="border-top: 1pt solid black;border-bottom: 1pt solid black;text-align: center;"|F
|-
|  style="text-align: center;"|30
|  style="text-align: center;"|0.871
|  style="text-align: center;"|0.201
|  style="text-align: center;vertical-align: top;"|0.327
|  style="text-align: center;"|0.892
|  style="text-align: center;"|0.310
|  style="text-align: center;vertical-align: top;"|0.460
|-
|  style="text-align: center;"|50
|  style="text-align: center;"|0.921
|  style="text-align: center;"|0.306
|  style="text-align: center;vertical-align: top;"|0.459
|  style="text-align: center;"|0.946
|  style="text-align: center;"|0.417
|  style="text-align: center;vertical-align: top;"|0.579
|-
|  style="border-bottom: 1pt solid black;text-align: center;"|70
|  style="border-bottom: 1pt solid black;text-align: center;"|0.969
|  style="border-bottom: 1pt solid black;text-align: center;"|0.483
|  style="border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|0.645
|  style="border-bottom: 1pt solid black;text-align: center;"|0.971
|  style="border-bottom: 1pt solid black;text-align: center;"|0.532
|  style="border-bottom: 1pt solid black;text-align: center;vertical-align: top;"|0.687
|}


Comparing with the original network structure method, the method combining location verification has different degrees of improvement in accuracy, recall rate and comprehensive evaluation index, which can more accurately carry out online and offline cross-network user identity link.

==5. Conclusions==

Based on the status quo of different platforms for social network users to register, this paper analyzes three existing methods of cross-network user identity link based on user basic attribute information, user online social structure relationship and user behavior. In addition, a cross-network user identity link method combined with position coordinate verification was proposed, which combined with the network structure to find the initial cross-network connection edge, screened matching nodes through position verification, and verified that the algorithm had high readiness rate and recall rate on the real social network.

==Acknowledgement==

This work was supported in part by the Heilongjiang province social science research and planning project (18TQB100), in part by the Natural Science Foundation of China under Grant (61672179), in part by the Harbin Youth Reserve Talent Project under Grant (2017RAQXJ102), in part by the Heilongjiang Province Art Planning Project Research on discipline theme evolution based on multi-source data fusion (2019C027) and in part by Heilongjiang province Postdoctoral fund (LBH-Z16053).

==References==

[1] Lu di, Han yinli, Xu yue. Development and management of intelligent media under the background of post-mobile Internet. Modern communication, 40(05):9-13, 2018.

[2] Xu jinghong,Duan Zening, Hou Weipeng,et al. Data Sharing and Privacy Protection under the Business Model of Mobile Internet. Information theory and practice, 41(01):50-54, 2018.

[3] Ravi Vatrapu, Raghava Rao Mukkamala, Abid Hussain, et al. Social Set Analysis: A Set Theoretical Approach to Big Data Analytics. IEEE Access,4: 2542-2571,2016. 

[4] Hongyang Zhao,Huan Zhou,Chengjue Yuan,et al. Social Discovery:Exploring the Correlation Among Three-Dimensional Social Relationships. Journal of Communications and Networks.17(2):126-132, 2015.

[5] Liu D, Wu Q Y. Cross-Platform User Profile Matching in Online Social Networks. Applied Mechanics and Materials, 380-384:1955-1958, 2013.

[6] Mehess S J. Finding the Missing Links: A Comparison of Social Network Analysis Methods. Dissertations & Theses Gradworks, 2016.

[7] Xiaoping Zhou,Xun Liang,Haiyan Zhang,et al. Cross-Platform Identification of Anonymous Identical Users in Multiple Social Media Networks. IEEE Transactions on Knowledge and Data Engineering, 28(2):411-424, 2016.

[8] X Zhou, X Liang, H Zhang, et al., Cross-platform identiﬁcation of anonymous identical users in multiple social media networks, IEEE Trans. Knowl. Data Eng, 28(2):411–424, 2016.

[9] Rao yuan, Wu Lianwei, Zhang Junyi. A survey of information propaganda mechanism under the cross-medium. Scientia sinica Informationis, 47(12):1623-1645, 2017.

[10]Hadeel S. Humadde, Alia K. Abdul-Hassan,Bashar S. Mahdi. Proposed User Identification Algorithm Across Social Network Using Hybrid Techniques. 2019 2nd Scientific Conference of Computer Sciences (SCCS). 27-28, 2019.

[11]Hu Kaixian, Liang ying, Xu hongbo, et al. A method for Social Network User Identity Feature Recognition. Journal of Computer Research and Development, 53(11):2630-2644, 2016.

[12]Backstrom L, Sun E, Marlow C. Find me if you can: Improving geographical prediction with social and spatial proximity.Proc of the 19th Int Conf on World Wide Web. New York: ACM: 61-70, 2010.

[13]Sang jitao, Lu Dongyuan, Xu Changsheng. Overlapped user-based cross-network analysis: Exploring variety in big social media data. Chinese Science Bulletin, 59(36):3554-3560+1, 2014.

[14] Wang Q, Shen DR, Feng S, et al. Identifying users across social networks based on global view features with crowdsourcing. Journal of Software,29(3):811-823, 2018.

[15]LIU Dong, WU Quanyuan, HAN Weihong, et al, User Identification across Multiple Websites Based on Username Features. Chinese Journal of Computers, 38(10):2028-2040, 2015.

[16]WU Zheng, YU Hongtao, LIU Shuxin, et al. User identification across multiple social networks based on information entropy. Journal of Computer Applications, 37(08):2374-2380, 2017.

[17] Hu Kaixian, Liang Ying, Su Lixin, et al. Method for Social Network User Feature Recognition Based on Clique. Pattern recognition and artificial intelligence, 29(08):698-708, 2016.

[18]Xu Qian, Chen hongchang, Wu Zheng, et al. User identification method across social networks based on weighted hypergraph. Journal of Computer Applications, 37(12):3435-3441+3471, 2017.