Friendship Inference in Mobile Social Networks: Exploiting Multi-Source Information With Two-Stage Deep Learning Framework

被引:1
作者
Zhao, Yi [1 ]
Qiao, Meina [2 ]
Wang, Haiyang [3 ]
Zhang, Rui [4 ]
Wang, Dan [5 ]
Xu, Ke [1 ,6 ]
机构
[1] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[2] Baidu Inc, Dept Comp Vis Technol VIS, Beijing 100193, Peoples R China
[3] Univ Minnesota, Dept Comp Sci, Duluth, MN 55812 USA
[4] Northwestern Polytech Univ, Sch Artificial Intelligence OPt & Elect iOPEN, Xian 710072, Peoples R China
[5] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China
[6] Zhongguancun Lab, Beijing 100094, Peoples R China
基金
美国国家科学基金会; 中国博士后科学基金; 中国国家自然科学基金;
关键词
Social networking (online); Deep learning; Feature extraction; Scalability; Multimedia Web sites; Marine vehicles; IEEE transactions; Mobile social networks; friendship inference; multi-source information; deep learning;
D O I
10.1109/TNET.2022.3198105
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With the tremendous growth of mobile social networks (MSNs), people are highly relying on it to connect with friends and further expand their social circles. However, the conventional friendship inference techniques have issues handling such a large yet sparse multi-source data. The related friend recommendation systems are therefore suffering from reduced accuracy and limited scalability. To address this issue, we propose a Two-stage Deep learning framework for Friendship Inference, namely TDFI. This approach enables MSNs to exploit multi-source information simultaneously, rather than hierarchically. Therefore, there is no need to manually set which information is more important and the order in which the various information is applied. In details, we apply an Extended Adjacency Matrix (EAM) to represent the multi-source information. We then adopt an improved Deep Auto-Encoder Network (iDAEN) to extract the fused feature vector for each user. Our framework also provides an improved Deep Siamese Network (iDSN) to measure user similarity. To provide a substantial description and evaluation of the proposed methodology, we evaluate the effectiveness and robustness on three large-scale real-world datasets. Trace-driven evaluation results demonstrate that TDFI can effectively handle the sparse multi-source data while providing better accuracy for friendship inference. Through the comparison with numerous state-of-the-art methods, we find that TDFI can achieve superior performance via real-world multi-source information. Meanwhile, it demonstrates that the proposed pipeline can not only integrate structural information and attribute information, but also be compatible with different attribute information, which further enhances the overall applicability of friend-recommendation systems under information-rich MSNs.
引用
收藏
页码:542 / 557
页数:16
相关论文
共 45 条
  • [1] Usage of autoencoders and Siamese networks for online handwritten signature verification
    Ahrabian, Kian
    BabaAli, Bagher
    [J]. NEURAL COMPUTING & APPLICATIONS, 2019, 31 (12) : 9321 - 9334
  • [2] Alex W., 2012, WHY IS IT HARD MAKE
  • [3] walk2friends: Inferring Social Links from Mobility Profiles
    Backes, Michael
    Humbert, Mathias
    Pang, Jun
    Zhang, Yang
    [J]. CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, : 1943 - 1957
  • [4] Boukoros S, 2019, PROCEEDINGS OF THE 28TH USENIX SECURITY SYMPOSIUM, P1859
  • [5] The use of the area under the roc curve in the evaluation of machine learning algorithms
    Bradley, AP
    [J]. PATTERN RECOGNITION, 1997, 30 (07) : 1145 - 1159
  • [6] Chang J., 2011, Proceedings of the Fifth International AAAI Conference on Weblogs and Social Media, P74
  • [7] A practical tutorial on autoencoders for nonlinear feature fusion: Taxonomy, models, software and guidelines
    Charte, David
    Charte, Francisco
    Garcia, Salvador
    del Jesus, Maria J.
    Herrera, Francisco
    [J]. INFORMATION FUSION, 2018, 44 : 78 - 96
  • [8] Exploiting Social Ties for Cooperative D2D Communications: A Mobile Social Networking Case
    Chen, Xu
    Proulx, Brian
    Gong, Xiaowen
    Zhang, Junshan
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (05) : 1471 - 1484
  • [9] Cho E., 2011, P 17 ACM SIGKDD INT, P1082
  • [10] Listing k-cliques in Sparse Real-World Graphs
    Danisch, Maximilien
    Balalau, Oana
    Sozio, Mauro
    [J]. WEB CONFERENCE 2018: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW2018), 2018, : 589 - 598