Skip to main content
Erschienen in: Knowledge and Information Systems 1/2019

22.05.2018 | Regular Paper

Integrated anchor and social link predictions across multiple social networks

verfasst von: Qianyi Zhan, Jiawei Zhang, Philip S. Yu

Erschienen in: Knowledge and Information Systems | Ausgabe 1/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In recent years, various online social networks offering specific services have gained great popularity and success. To enjoy more online social services, some users can be involved in multiple social networks simultaneously. A challenging problem in social network studies is to identify the common users across networks to gain better understanding of user behavior. This is referred to as the anchor link prediction problem. Meanwhile, across these partially aligned social networks, users can be connected by different kinds of links, e.g., social links among users in one single network and anchor links between accounts of the shared users in different networks. Many different link prediction methods have been proposed so far to predict each type of links separately. In this paper, we want to predict the formation of social links among users in the target network as well as anchor links aligning the target network with other external social networks. The problem is formally defined as the “collective link identification” problem. Predicting the formation of links in social networks with traditional link prediction methods, e.g., classification-based methods, can be very challenging. The reason is that, from the network, we can only obtain the formed links (i.e., positive links) but no information about the links that will never be formed (i.e., negative links). To solve the collective link identification problem, a unified link prediction framework, collective link fusion (CLF) is proposed in this paper, which consists of two phases: step (1) collective link prediction of anchor and social links with positive and unlabeled learning techniques, and step (2) propagation of predicted links across the partially aligned “probabilistic networks” with collective random walk. Extensive experiments conducted on two real-world partially aligned networks demonstrate that CLF can perform very well in predicting social and anchor links concurrently.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat Adamic L, Adar E (2001) Friends and neighbors on the web. Soc Netw 25:211–230CrossRef Adamic L, Adar E (2001) Friends and neighbors on the web. Soc Netw 25:211–230CrossRef
2.
Zurück zum Zitat Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. In: WSDM Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. In: WSDM
4.
Zurück zum Zitat Elkan C, Noto K (2008) Learning classifiers from only positive and unlabeled data. In: KDD Elkan C, Noto K (2008) Learning classifiers from only positive and unlabeled data. In: KDD
5.
Zurück zum Zitat Fouss F, Pirotte A, Renders J, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. TKDE 19:355–369 Fouss F, Pirotte A, Renders J, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. TKDE 19:355–369
6.
Zurück zum Zitat Fujiwara Y, Nakatsuji M, Onizuka M, Kitsuregawa M (2012) Fast and exact top-k search for random walk with restart. VLDB 55:442–453 Fujiwara Y, Nakatsuji M, Onizuka M, Kitsuregawa M (2012) Fast and exact top-k search for random walk with restart. VLDB 55:442–453
7.
Zurück zum Zitat Getoor L, Diehl CP (2005) Link mining: a survey. SIGKDD Explor Newslett 7:3–12CrossRef Getoor L, Diehl CP (2005) Link mining: a survey. SIGKDD Explor Newslett 7:3–12CrossRef
8.
Zurück zum Zitat Hasan M, Chaoji V, Salem S, Zaki M (2006) Link prediction using supervised learning. In: SDM Hasan M, Chaoji V, Salem S, Zaki M (2006) Link prediction using supervised learning. In: SDM
9.
Zurück zum Zitat Hasan M, Zaki MJ (2011) A survey of link prediction in social networks. In: Aggarwal CC (ed) Social network data analytics. Springer, New York Hasan M, Zaki MJ (2011) A survey of link prediction in social networks. In: Aggarwal CC (ed) Social network data analytics. Springer, New York
10.
Zurück zum Zitat Hsieh C-J, Natarajan N, Dhillon IS (2015) PU learning for matrix completion. In: ICML, pp 2445–2453 Hsieh C-J, Natarajan N, Dhillon IS (2015) PU learning for matrix completion. In: ICML, pp 2445–2453
11.
Zurück zum Zitat Hwang T, Kuang R (2010) A heterogeneous label propagation algorithm for disease gene discovery. In: SDM Hwang T, Kuang R (2010) A heterogeneous label propagation algorithm for disease gene discovery. In: SDM
12.
Zurück zum Zitat Iofciu T, Fankhauser P, Abel F, Bischoff K (2011) Identifying users across social tagging systems. In: ICWSM Iofciu T, Fankhauser P, Abel F, Bischoff K (2011) Identifying users across social tagging systems. In: ICWSM
13.
Zurück zum Zitat Jin S, Zhang J, Yu P, Yang S, Li A (2014) Synergistic partitioning in multiple large scale social networks. In: IEEE BigData Jin S, Zhang J, Yu P, Yang S, Li A (2014) Synergistic partitioning in multiple large scale social networks. In: IEEE BigData
14.
Zurück zum Zitat Kong X, Zhang J, Yu P (2013) Inferring anchor links across multiple heterogeneous social networks. In: CIKM Kong X, Zhang J, Yu P (2013) Inferring anchor links across multiple heterogeneous social networks. In: CIKM
15.
Zurück zum Zitat Konstas I, Stathopoulos V, Jose JM (2009) On social networks and collaborative recommendation. In: SIGIR Konstas I, Stathopoulos V, Jose JM (2009) On social networks and collaborative recommendation. In: SIGIR
16.
Zurück zum Zitat Lü L, Zhou T (2011) Link prediction in complex networks: a survey. Phys A Stat Mech Its Appl 390:1150–1170CrossRef Lü L, Zhou T (2011) Link prediction in complex networks: a survey. Phys A Stat Mech Its Appl 390:1150–1170CrossRef
17.
Zurück zum Zitat Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: WWW Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: WWW
18.
Zurück zum Zitat Liben-Nowell D, Kleinberg J (2003) The link prediction problem for social networks. In: CIKM Liben-Nowell D, Kleinberg J (2003) The link prediction problem for social networks. In: CIKM
19.
Zurück zum Zitat Liu B, Dai Y, Li X, Lee W, Yu P (2003) Building text classifiers using positive and unlabeled examples. In: ICDM Liu B, Dai Y, Li X, Lee W, Yu P (2003) Building text classifiers using positive and unlabeled examples. In: ICDM
20.
Zurück zum Zitat Liu J, Zhang F, Song X, Song Y, Lin C, Hon H (2013) What’s in a name? An unsupervised approach to link users across communities. In: WSDM Liu J, Zhang F, Song X, Song Y, Lin C, Hon H (2013) What’s in a name? An unsupervised approach to link users across communities. In: WSDM
21.
Zurück zum Zitat Lü L, Zhou T (2011) Link prediction in complex networks: a survey. Phys A Stat Mech Its Appl 390(6):1150–1170CrossRef Lü L, Zhou T (2011) Link prediction in complex networks: a survey. Phys A Stat Mech Its Appl 390(6):1150–1170CrossRef
22.
Zurück zum Zitat Namata G, Kok S, Getoor L (2011) Collective graph identification. In: KDD Namata G, Kok S, Getoor L (2011) Collective graph identification. In: KDD
23.
Zurück zum Zitat Perkins D, Salomon G (1992) Transfer of learning Pergamon Press, Oxford, England Perkins D, Salomon G (1992) Transfer of learning Pergamon Press, Oxford, England
24.
Zurück zum Zitat Sahraeian S, Yoon B (2013) Smetana: accurate and scalable algorithm for probabilistic alignment of large-scale biological networks. PLoS ONE 8:e67995CrossRef Sahraeian S, Yoon B (2013) Smetana: accurate and scalable algorithm for probabilistic alignment of large-scale biological networks. PLoS ONE 8:e67995CrossRef
25.
Zurück zum Zitat Song D, Meyer D (2014) A model of consistent node types in signed directed social networks. In: ASONAM ’14 Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, IEEE Press, Piscataway, NJ, USA, pp 72–80 Song D, Meyer D (2014) A model of consistent node types in signed directed social networks. In: ASONAM ’14 Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, IEEE Press, Piscataway, NJ, USA, pp 72–80
26.
Zurück zum Zitat Tong H, Faloutsos C, Pan J (2006) Fast random walk with restart and its applications. In: ICDM Tong H, Faloutsos C, Pan J (2006) Fast random walk with restart and its applications. In: ICDM
27.
Zurück zum Zitat Wilcox K, Stephen AT (2012) Are close friends the enemy? Online social networks, self-esteem, and self-control. J Consum Res 40:90–103CrossRef Wilcox K, Stephen AT (2012) Are close friends the enemy? Online social networks, self-esteem, and self-control. J Consum Res 40:90–103CrossRef
28.
Zurück zum Zitat Xi W, Zhang B, Chen Z, Lu Y, Yan S, Ma W, Fox E (2004) Link fusion: a unified link analysis framework for multi-type interrelated data objects. In: WWW Xi W, Zhang B, Chen Z, Lu Y, Yan S, Ma W, Fox E (2004) Link fusion: a unified link analysis framework for multi-type interrelated data objects. In: WWW
29.
Zurück zum Zitat Xiang R, Neville J, Rogati M (2010) Modeling relationship strength in online social networks. In: WWW Xiang R, Neville J, Rogati M (2010) Modeling relationship strength in online social networks. In: WWW
30.
Zurück zum Zitat Yao Y, Tong H, Yan X, Xu F, Lu J (2013) Matri: a multi-aspect and transitive trust inference model. In: WWW Yao Y, Tong H, Yan X, Xu F, Lu J (2013) Matri: a multi-aspect and transitive trust inference model. In: WWW
31.
Zurück zum Zitat Ye J, Cheng H, Zhu Z, Chen M (2013) Predicting positive and negative links in signed social networks by transfer learning. In: WWW Ye J, Cheng H, Zhu Z, Chen M (2013) Predicting positive and negative links in signed social networks by transfer learning. In: WWW
32.
Zurück zum Zitat Zafarani R, Liu H (2009) Connecting corresponding identities across communities. In: ICWSM Zafarani R, Liu H (2009) Connecting corresponding identities across communities. In: ICWSM
33.
Zurück zum Zitat Zhan Q, Wang S, Zhang J, Yu P, Xie J (2015) Influence maximization across partially aligned heterogenous social networks. In: PAKDD Zhan Q, Wang S, Zhang J, Yu P, Xie J (2015) Influence maximization across partially aligned heterogenous social networks. In: PAKDD
34.
Zurück zum Zitat Zhang J, Kong X, Yu P (2013) Predicting social links for new users across aligned heterogeneous social networks. In: ICDM Zhang J, Kong X, Yu P (2013) Predicting social links for new users across aligned heterogeneous social networks. In: ICDM
35.
Zurück zum Zitat Zhang J, Kong X, Yu P (2014) Transferring heterogeneous links across location-based social networks. In: WSDM Zhang J, Kong X, Yu P (2014) Transferring heterogeneous links across location-based social networks. In: WSDM
36.
Zurück zum Zitat Zhang J, Shao W, Wang S, Kong X, Yu P (2015) Pna: Partial network alignment with generic stable matching. In: IEEE IRI Zhang J, Shao W, Wang S, Kong X, Yu P (2015) Pna: Partial network alignment with generic stable matching. In: IEEE IRI
37.
Zurück zum Zitat Zhang J, Yu P (2015) Community detection for emerging networks. In: SDM Zhang J, Yu P (2015) Community detection for emerging networks. In: SDM
38.
Zurück zum Zitat Zhang J, Yu P (2015) Mcd: Mutual clustering across multiple heterogeneous networks. In: IEEE BigData Congress Zhang J, Yu P (2015) Mcd: Mutual clustering across multiple heterogeneous networks. In: IEEE BigData Congress
39.
Zurück zum Zitat Zhang J, Yu P, Zhou Z (2014) Meta-path based multi-network collective link prediction. In: KDD Zhang J, Yu P, Zhou Z (2014) Meta-path based multi-network collective link prediction. In: KDD
40.
Zurück zum Zitat Zhao Y, Kong X, Yu P (2011) Positive and unlabeled learning for graph classification. In: ICDM Zhao Y, Kong X, Yu P (2011) Positive and unlabeled learning for graph classification. In: ICDM
Metadaten
Titel
Integrated anchor and social link predictions across multiple social networks
verfasst von
Qianyi Zhan
Jiawei Zhang
Philip S. Yu
Publikationsdatum
22.05.2018
Verlag
Springer London
Erschienen in
Knowledge and Information Systems / Ausgabe 1/2019
Print ISSN: 0219-1377
Elektronische ISSN: 0219-3116
DOI
https://doi.org/10.1007/s10115-018-1210-1

Weitere Artikel der Ausgabe 1/2019

Knowledge and Information Systems 1/2019 Zur Ausgabe