access icon openaccess Friendship prediction model based on factor graphs integrating geographical location

With the development of network services and location-based systems, many mobile applications begin to use users’ geographical location to provide better services. In terms of social networks, geographical location is actively shared by users. In some applications with recommendation services, before the geographical location recommendation is provided, the authors have to obtain user's permission. This kind of social network integrated with geographical location information is called location-based social networks (abbreviate for LBSNs). In the LBSN, each user has location information when he or she checked in hotels or feature spots. Based on this information, they can identify user's trajectory of movement behaviour and activity patterns. In general, if there is friendship between two users, their trajectories in reality are likely to be similar. In this study, according to user's geographical location information over a period of time, they explore whether there exists friendly relationship between two users based on trajectory similarity and the structure theory of graphs. In particular, they propose a new factor function and a factor graph model based on user's geographical location to predict the friendship between two users in the real LBSN.

Inspec keywords: graph theory; social networking (online); recommender systems; information retrieval

Other keywords: structure theory; geographical location information; geographical location recommendation; activity patterns; trajectory similarity; friendship prediction model; movement behaviour; location-based social networks; network services; location-based systems; recommendation services; factor graph model; social network

Subjects: Information retrieval techniques; Information networks; Social and behavioural sciences computing; Search engines; Combinatorial mathematics

References

    1. 1)
    2. 2)
    3. 3)
      • [25]. Huo, Z., Meng, X., Hu, H., et al: ‘You can walk alone: trajectory privacy-preserving through significant stays protection’. Int. Conf. on Database Systems for Advanced Applications. (Springer), Busan, South Korea, 2012, pp. 351366.
    4. 4)
    5. 5)
      • [26]. Yin, H., Hu, Z., Zhou, X., et al: ‘Discovering interpretable geo-social communities for user behavior prediction’. 2016 IEEE 32nd Int. Conf. on Data Engineering (ICDE). (IEEE), Helsinki, Finland, 2016, pp. 942953.
    6. 6)
      • [21]. Scellato, S., Noulas, A., Mascolo, C.: ‘Exploiting place features in link prediction on location-based social networks’. Proc. of the 17th ACM SIGKDD int. Conf. on Knowledge discovery and data mining. (ACM), San Diego California, USA, 2011, pp. 10461054.
    7. 7)
    8. 8)
      • [3]. Barrera, D., Kayacik, H.G., van Oorschot, P.C., et al: ‘A methodology for empirical analysis of permission-based security models and its application to android’. Proc. of the 17th ACM Conf. on Computer and Communications Security, New York, NY, USA, 2010, pp. 7384.
    9. 9)
      • [16]. Backstrom, L., Leskovec, J.: ‘Supervised random walks: predicting and recommending links in social networks’. Proc. of the Fourth ACM Int. Conf. On Web Search and Data Mining. WSDM'11, New York, NY, USA: Association for Computing Machinery), 2011, pp. 635644.
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
      • [13]. Bishop, C.M.: ‘Pattern recognition and machine learning’ (Springer, Berlin, Germany, 2006).
    15. 15)
      • [14]. Li, N., Chen, G.: ‘Multi-layered friendship modeling for location-based mobile social networks’. In: Proc. of the 6th Annual Int. Conf. on Mobile and Ubiquitous Systems: Computing, Networking and Services, MOBIQUITOUS, Toronto, Canada, July 13–16 2009, pp. 110.
    16. 16)
    17. 17)
    18. 18)
    19. 19)
    20. 20)
    21. 21)
      • [1]. Obiri-Yeboah, J., Man, Q.: ‘Data security of android applications’. In: Proc. of Int. Conf. on Natural Computation & Fuzzy Systems & Knowledge Discovery. (IEEE), Changsha, China, 2016, pp. 814.
    22. 22)
      • [27]. Chen, Z., Shen, H.T., Zhou, X., et al: ‘Searching trajectories by locations: an efficiency study’. Proc. of the 2010 ACM SIGMOD Int. Conf. on Management of Data. (ACM), Indianapolis, USA, 2010, pp. 255266.
    23. 23)
      • [22]. Tang, W., Zhuang, H., Tang, J.: ‘Learning to infer social ties in large networks’. In: Joint European Conf. on Machine Learning and Knowledge Discovery in Databases, Athens, Greece, 2011, pp. 381397.
    24. 24)
    25. 25)
      • [18]. Valverde Rebaza, J., Roche, M., Poncelet, P., et al: ‘Exploiting social and mobility patterns for friendship prediction in location-based social networks’. Proc. of the 2016 23rd Int. Conf. on Pattern Recognition (ICPR). (IEEE), Cancun, Mexico, 2016, pp. 25262531.
    26. 26)
    27. 27)
      • [24]. Cho, E., Myers, S.A., Leskovec, J.: ‘Friendship and mobility: user movement in location-based social networks’. Proc. of the 17th ACM SIGKDD int. Conf. on Knowledge Discovery and Data Mining. (ACM), San Diego California, USA, 2011, pp. 10821090.
    28. 28)
    29. 29)
      • [17]. Roth, M., Ben David, A., Deutscher, D., et al: ‘Suggesting friends using the implicit social graph’. Proc. of the Washington int. Conf. on Knowledge discovery and data mining. (ACM), Washington, USA, 2010, pp. 233242.
    30. 30)
      • [32]. Zhu, X., Ghahramani, Z., Lafferty, J.D.: ‘Semi-supervised learning using Gaussian fields and harmonic functions’. In: Proc. of the 20th Int. Conf. on Machine Learning (ICML-03). (Washington DC), Washington, DC, USA, 2003, pp. 912919.
    31. 31)
    32. 32)
      • [15]. Bagci, H., Karagoz, P.: ‘Context-aware friend recommendation for location based social networks using random walk’. Proc. of the 25th Int. Conf. Companion on World Wide Web. (Republic and Canton of Geneva, CHE: Int. World Wide Web Conf.s Steering Committee), Montreal Quebec, Canada, 2016, pp. 531536.
    33. 33)
http://iet.metastore.ingenta.com/content/journals/10.1049/trit.2020.0033
Loading

Related content

content/journals/10.1049/trit.2020.0033
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading