Zhou et al 2019a - Revision history

Rimni at 14:22, 15 December 2020

2020-12-15T14:22:51Z

Rimni: /* 3.2 position coordinates and distance */

2020-12-15T14:22:24Z

‎3.2 position coordinates and distance

Rimni: /* 4. Experiment */

2020-12-03T12:30:21Z

‎4. Experiment

Rimni at 12:26, 3 December 2020

2020-12-03T12:26:01Z

Show changes

Rimni: /* 3. Cross-network user identity link method based on location verification */

2020-12-03T12:05:31Z

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

Rimni at 11:48, 3 December 2020

2020-12-03T11:48:14Z

Show changes

Dloinng at 09:45, 18 June 2020

2020-06-18T09:45:51Z

Dloinng at 09:22, 18 June 2020

2020-06-18T09:22:02Z

Rimni at 10:15, 22 January 2020

2020-01-22T10:15:38Z

Rimni at 13:31, 3 January 2020

2020-01-03T13:31:46Z

@@ Line 99: / Line 99: @@
 {| 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>
+| <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)

@@ Line 99: / Line 99: @@
 {| 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>
+| <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)

@@ Line 166: / Line 166: @@
 {| style="text-align: center; margin:auto;"
 |-
-| <math display="inline">{\rm precision}\, = \frac{tp}{\left( tp+fp\right) \, \, }</math>
+| <math>{\rm precision}\, = \frac{tp}{\left( tp+fp\right) \, \, }</math>
 |}
 | style="width: 5px;text-align: right;white-space: nowrap;" | (5)
@@ Line 176: / Line 176: @@
 {| style="text-align: center; margin:auto;"
 |-
-| <math display="inline">\hbox{recall } =\frac{tp}{\left( tp+fn\right) \, \, }</math>
+| <math>\hbox{recall } =\frac{tp}{\left( tp+fn\right) \, \, }</math>
 |}
 | style="width: 5px;text-align: right;white-space: nowrap;" | (6)
@@ Line 186: / Line 186: @@
 {| 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>
+| <math>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)
@@ Line 192: / Line 192: @@
-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 which, <math>tp</math> represents the correctly matching account, <math>fp</math> represents the wrong ones, <math>fn</math> 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 [[#tab-2|Table 2]].
@@ Line 203: / Line 203: @@
 |-style="text-align:center"
 ! rowspan='2' |Data source !!  rowspan='2' |No. of prior tags !!   colspan='3'  |Random !!  colspan='3'  |Degree of arrangement !!   colspan='3'  |Pagerank
-|-
+|-style="text-align: center;"
-|  style="text-align: center;"|P
+!  P !! R !! F !! P !! R !! F !! P !! R !! F
-|  style="text-align: center;"|R
-|  style="text-align: center;"|F
-|  style="text-align: center;"|P
-|  style="text-align: center;"|R
-|  style="text-align: center;"|F
-|  style="text-align: center;"|P
-|  style="text-align: center;"|R
-|  style="text-align: center;"|F
 |-
 |  rowspan='7' style="text-align: center;"|Facebook <br/>Twitter
@@ Line 306: / Line 298: @@
 !  rowspan='2' |No. of prior tags !!   colspan='3'  |Network based !!   colspan='3'  |Location verification
 |-
-|  style="text-align: center;"|P
+!  P !! R !! F !! P !! R !! F
-|  style="text-align: center;"|R
-|  style="text-align: center;"|F
-|  style="text-align: center;"|P
-|  style="text-align: center;"|R
-|  style="text-align: center;"|F
 |-
 |  style="text-align: center;"|30

← Older revision		Revision as of 12:05, 3 December 2020
Line 47:		Line 47:


−	'''Define 1''' ~~user~~ identity. The virtual account <math>v_i</math>, where <math>v_i</math> presents the network account of user ''i''.	+	'''Define 1''' User identity. The virtual account <math>v_i</math>, where <math>v_i</math> presents the network account of user ''i''.

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

@@ Line 355: / Line 355: @@
 ==Acknowledgements==
-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).
+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), and in part by Heilongjiang province Postdoctoral fund (LBH-Z16053).
 ==References==

@@ Line 6: / Line 6: @@
 <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>
+'''  Xueyan Zhou<sup>1</sup>, Jing YANG<sup>1,*</sup>'''</div>
 '''1. College of computer science and technology, Harbin Engineering University, Harbin, China'''
 -->
 ==Abstract==

@@ Line 12: / Line 12: @@
 '''2. College of Mechanical and Electrical Engineering, Harbin Engineering University, Harbin, China'''
 -->
 ==Abstract==