Mutual clustering coefficient-based suspicious-link detection approach for online social networks

Mudasir Ahmad Wani, Suraiya Jabin

Abstract: Online social networks (OSNs) are trendy and rapid information propagation medium on the web where millions of new connections either positive such as acquaintance, or negative such as animosity, are being established every day around the world. The negative links (or sometimes referred to as harmful connections) are mostly established by fake profiles as they are being created by minds with ill aims. Detecting negative (or suspicious) links within online users can better aid in the mitigation of fake profiles from OSNs.A modified clustering coefficient formula, named as MutualClusteringCoefficient<math><mrow is="true"><mi mathvariant="italic" is="true">MutualClusteringCoefficient</mi></mrow></math> represented byMcc<math><mrow is="true"><msub is="true"><mi is="true">M</mi><mrow is="true"><mi mathvariant="italic" is="true">cc</mi></mrow></msub></mrow></math>, is introduced to quantitatively measure the connectivity between the mutual friends of two connected users in a group. In this paper, a classification system based on mutual clustering coefficient and profile information of users has been presented to detect the suspicious links within the user communities. Profile information helps us to find the similarity between users. Different similarity measures have been employed to calculate the profile similarity between a connected user pair. Experimental results demonstrate that four basic and easily available features such as workw,educatione,home_townhtandcurrent_city(cc)<math><mrow is="true"><mi is="true">w</mi><mi is="true">o</mi><mi is="true">r</mi><mi is="true">k</mi><mrow is="true"><mfenced close=")" open="(" is="true"><mrow is="true"><mi is="true">w</mi></mrow></mfenced></mrow><mo is="true">,</mo><mspace width="0.25em" is="true"></mspace><mi is="true">e</mi><mi is="true">d</mi><mi is="true">u</mi><mi is="true">c</mi><mi is="true">a</mi><mi is="true">t</mi><mi is="true">i</mi><mi is="true">o</mi><mi is="true">n</mi><mrow is="true"><mfenced close=")" open="(" is="true"><mrow is="true"><mi is="true">e</mi></mrow></mfenced></mrow><mo is="true">,</mo><mspace width="0.25em" is="true"></mspace><mi is="true">h</mi><mi is="true">o</mi><mi is="true">m</mi><mi is="true">e</mi><mtext is="true">_</mtext><mi is="true">t</mi><mi is="true">o</mi><mi is="true">w</mi><mi is="true">n</mi><mrow is="true"><mfenced close=")" open="(" is="true"><mrow is="true"><mi is="true">h</mi><mi is="true">t</mi></mrow></mfenced></mrow><mi is="true">a</mi><mi is="true">n</mi><mi is="true">d</mi><mi is="true">c</mi><mi is="true">u</mi><mi is="true">r</mi><mi is="true">r</mi><mi is="true">e</mi><mi is="true">n</mi><mi is="true">t</mi><mtext is="true">_</mtext><mi is="true">c</mi><mi is="true">i</mi><mi is="true">t</mi><mi is="true">y</mi><mrow is="true"><mo stretchy="false" is="true">(</mo><mi is="true">c</mi><mi is="true">c</mi><mo stretchy="false" is="true">)</mo></mrow></mrow></math> along with MCC<math><mrow is="true"><msub is="true"><mi is="true">M</mi><mrow is="true"><mi mathvariant="italic" is="true">CC</mi></mrow></msub></mrow></math> play a vital role in designing a successful classification system for the detection of suspicious links.