基于EDLATrust算法的社交网络信息泄露节点概率预测

朱唯一, 张雪芹, 顾春华

清华大学学报（自然科学版） ›› 2022, Vol. 62 ›› Issue (2) : 355-366.

PDF(3273 KB)
横山亮次奖  |  百年刊庆  |  中文  |  English
PDF(3273 KB)
清华大学学报（自然科学版） ›› 2022, Vol. 62 ›› Issue (2) : 355-366. DOI: 10.16511/j.cnki.qhdxxb.2021.22.018
计算机科学与技术

基于EDLATrust算法的社交网络信息泄露节点概率预测

  • 朱唯一, 张雪芹, 顾春华
作者信息 +

Social network information leakage node probability prediction based on the EDLATrust algorithm

  • ZHU Weiyi, ZHANG Xueqin, GU Chunhua
Author information +
文章历史 +

摘要

在社交网络信息传播过程中，信息转发在用户之间广泛使用，但是存在着隐私信息在信息发布者未授权的情况下遭到泄露的问题。预测发现隐私信息泄露节点，对杜绝该类安全隐患具有重要意义。该文针对隐私信息泄露节点预测问题，提出了一种基于估计器的分布式学习自动机的信任推断（EDLATrust）算法，该算法能够推断社交网络中非直连节点之间的信任值，并减少算法收敛次数。基于信息转发时通常采用的线性传播和群传播2种典型传播模型，设计了满足信任传播模型的3种特征，采用XGBoost算法进行节点链接关系预测。该算法实现了对社交网络信息泄露节点的概率预测，利用该预测概率可以有效辅助推断信息传播过程中的信息泄露节点，从而提高了社交网络信息传播的安全性。在3个社交网络数据集上的实验表明，使用该算法能够有效地预测信息转发链当中信息的泄露节点，保护了用户的隐私安全。

Abstract

Message forwarding is widely used in social network information systems. However, private information can be leaked without authorization from the information publisher. Privacy information leakage nodes need to be identified to eliminate such security risks. An estimator based distributed learning automata for trust inference (EDLATrust) is developed in this study to infer the trust level between non-directly connected nodes by reducing the number of convergence steps. The EDLATrust algorithm is combined with the XGBoost algorithm to identify privacy leakage in social network by using linear and group information transmission propagation models with three information dissemination characteristics. The algorithm predicts potential links in the information transmission chain and assists predicting information leakage points to improve the information dissemination security in social networks. Tests show that the model can effectively predict information leakage points in the information transmission chain for three real social network data sets to protect user privacy.

关键词

社交网络 / 信息泄露 / 估计器 / 分布式学习自动机 / XGBoost

Key words

social networks / information leakage / estimators / distributed learning automata / XGBoost

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
朱唯一, 张雪芹, 顾春华. 基于EDLATrust算法的社交网络信息泄露节点概率预测[J]. 清华大学学报（自然科学版）. 2022, 62(2): 355-366 https://doi.org/10.16511/j.cnki.qhdxxb.2021.22.018
ZHU Weiyi, ZHANG Xueqin, GU Chunhua. Social network information leakage node probability prediction based on the EDLATrust algorithm[J]. Journal of Tsinghua University(Science and Technology). 2022, 62(2): 355-366 https://doi.org/10.16511/j.cnki.qhdxxb.2021.22.018

参考文献

[1] KIM Y A. An enhanced trust propagation approach with expertise and homophily-based trust networks[J]. Knowledge-Based Systems, 2015, 82:20-28.
[2] KIM Y A, SONG H S. Strategies for predicting local trust based on trust propagation in social networks[J]. Knowledge-Based Systems, 2011, 24(8):1360-1371.
[3] SHEKARPOUR S, KATEBI S D. Modeling and evaluation of trust with an extension in semantic web[J]. Journal of Web Semantics, 2010, 8(1):26-36.
[4] FERNÁNDEZ E. Learning automata-based CPU non-intensive calculation of dedicated and shared protected paths in bandwidth-guaranteed networks[J]. Computer Communications, 2017, 103:130-140.
[5] MORADABADI B, MEYBODI M R. Link prediction in weighted social networks using learning automata[J]. Engineering Applications of Artificial Intelligence, 2018, 70:16-24.
[6] GHAVIPOUR M, MEYBODI M R. Trust propagation algorithm based on learning automata for inferring local trust in online social networks[J]. Knowledge-Based Systems, 2018, 143:307-316.
[7] DAUD N N, HAMID S H A, SAADOON M, et al. Applications of link prediction in social networks:A review[J]. Journal of Network and Computer Applications, 2020, 166:102716.
[8] LIBEN-NOWELL D, KLEINBERG J. The link-prediction problem for social networks[J]. Journal of the American Society for Information Science and Technology, 2007, 58(7):1019-1031.
[9] LIU Y Y, ZHAO C L, WANG X J, et al. The degree-related clustering coefficient and its application to link prediction[J]. Physica A:Statistical Mechanics and Its Applications, 2016, 454:24-33.
[10] MUNIZ C P, GOLDSCHMIDT R, CHOREN R. Combining contextual, temporal and topological information for unsupervised link prediction in social networks[J]. Knowledge-Based Systems, 2018, 156:129-137.
[11] FU C B, ZHAO M H, FAN L, et al. Link weight prediction using supervised learning methods and its application to yelp layered network[J]. IEEE Transactions on Knowledge & Data Engineering, 2018, 30(8):1507-1518.
[12] CHEN T, GUESTRIN C. XGBoost:A scalable tree boosting system[C]//The 22nd ACM SIGKDD International Conference. New York, USA, 2016:785-794.
[13] UREN~A R, KOU G, DONG Y C, et al. A review on trust propagation and opinion dynamics in social networks and group decision making frameworks[J]. Information Sciences, 2019, 478:461-475.
[14] REZVANIAN A, RAHMATI M, MEYBODI M R. Sampling from complex networks using distributed learning automata[J]. Physica A:Statistical Mechanics and Its Applications, 2014, 396:224-234.
[15] GE H, JIANG W, LI S H, et al. A novel estimator based learning automata algorithm[J]. Applied Intelligence, 2015, 42(2):262-275.
[16] BASTAMI E, MAHABADI A, TAGHIZADEH E. A gravitation-based link prediction approach in social networks[J]. Swarm and Evolutionary Computation, 2019, 44:176-186.
[17] KIANINEJAD M, KABIRI P. A strategy for trust propagation along the more trusted paths[C]//20183rd Conference on Swarm Intelligence and Evolutionary Computation. Bam, Iran, 2018:1-6.
[18] JIANG W J, WU J, LI F, et al. Trust evaluation in online social networks using generalized network flow[J]. IEEE Transactions on Computers, 2016, 65(3):952-963.

基金

国家自然科学基金资助项目（61975124）

PDF(3273 KB)

Accesses

Citation

Detail
段落导航
相关文章
扫码关注，本刊微信公众号
地址：清华大学东门外学研大厦B座908室　
邮编：100084
电话：010-62788108/62771385/62792976/62792994　
E-mail：xuebaost@tsinghua.edu.cn
访问统计
    总访问量
    今日访问
    在线人数
　
版权所有 © 《清华大学学报（自然科学版）》编辑部

/

〈 〉