skip to main content
Idioma:

Structure Based User Identification across Social Networks

Zhou, Xiaoping ; Liang, Xun ; Du, Xiaoyong ; Zhao, Jichao

IEEE transactions on knowledge and data engineering, 2018-06, Vol.30 (6), p.1178-1191 [Periódico revisado por pares]

New York: IEEE

Texto completo disponível

Citações Citado por
  • Título:
    Structure Based User Identification across Social Networks
  • Autor: Zhou, Xiaoping ; Liang, Xun ; Du, Xiaoyong ; Zhao, Jichao
  • Assuntos: Accessibility ; Algorithms ; Analogies ; anonymous identical users ; cross-platform ; Disruption ; Electronic mail ; Feature extraction ; friend relationship ; Identification ; Knowledge ; Knowledge engineering ; Network reliability ; Platforms ; prior knowledge ; Privacy ; Reliability ; Reliability engineering ; Social computing ; social network ; Social network services ; Social networks ; Structural reliability ; Structural social network analysis ; unsupervised ; user identification
  • É parte de: IEEE transactions on knowledge and data engineering, 2018-06, Vol.30 (6), p.1178-1191
  • Descrição: Identification of anonymous identical users of cross-platforms refers to the recognition of the accounts belonging to the same individual among multiple Social Network (SN) platforms. Evidently, cross-platform exploration may help solve many problems in social computing, in both theory and practice. However, it is still an intractable problem due to the fragmentation, inconsistency, and disruption of the accessible information among SNs. Different from the efforts implemented on user profiles and users' content, many studies have noticed the accessibility and reliability of network structure in most of the SNs for addressing this issue. Although substantial achievements have been made, most of the current network structure-based solutions, requiring prior knowledge of some given identified users, are supervised or semi-supervised. It is laborious to label the prior knowledge manually in some scenarios where prior knowledge is hard to obtain. Noticing that friend relationships are reliable and consistent in different SNs, we proposed an unsupervised scheme, termed Friend Relationship-based User Identification algorithm without Prior knowledge (FRUI-P). The FRUI-P first extracts the friend feature of each user in an SN into friend feature vector, and then calculates the similarities of all the candidate identical users between two SNs. Finally, a one-to-one map scheme is developed to identify the users based on the similarities. Moreover, FRUI-P is proved to be efficient theoretically. Results of extensive experiments demonstrated that FRUI-P performs much better than current state-of-art network structure-based algorithm without prior knowledge. Due to its high precision, FRUI-P can additionally be utilized to generate prior knowledge for supervised and semi-supervised schemes. In applications, the unsupervised anonymous identical user identification method accommodates more scenarios where the seed users are unobtainable.
  • Editor: New York: IEEE
  • Idioma: Inglês
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.