Detecting User Interaction Anomaly based on Social Network Graph Similarity

被引:3
|
作者
Jin, Guanghua [1 ]
Chen, Zhi [1 ]
Zhang, Jing [1 ]
Yue, Wenjing [2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Comp, 9 Wenyuan Rd, Nanjing 210023, Jiangsu, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Sch Commun & Informat Engn, 66 New Mofan Rd, Nanjing 210003, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
anomaly detection; social networks; user interaction; graph similarity;
D O I
10.1109/iceiec49280.2020.9152339
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Anomaly detection is one critical issue of analyzing the user interaction behaviors in social networks. This paper presents a method of detecting user interaction anomaly based on graph similarity. In the algorithm, we first establish a social network graph by using an existing social network dataset; then, according to the user connection relationship, the Louvain community discovery algorithm is used to divide the social network graph into multiple communities; next, we regard each community graph as an independent social network graph and calculate the quality score of each node and the feature value of each edge in the community graph; finally, we use the local hash to filter the feature value of each edge into the equal length binary feature number of each group of progressive comparisons. The community graphs with user abnormal interactions are obtained by comparing the thresholds according to the similarity. The experimental results show that our method can has good efficiency and accuracy of user interaction anomaly detection in the community.
引用
收藏
页码:131 / 136
页数:6
相关论文
共 50 条
  • [1] A Deep Graph Network with Multiple Similarity for User Clustering in Human-Computer Interaction
    Kang, Yan
    Pu, Bin
    Kou, Yongqi
    Yang, Yun
    Chen, Jianguo
    Muhammad, Khan
    Yang, Po
    Xu, Lida
    Hijji, Mohammad
    ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS, 2024, 20 (02)
  • [2] A User Similarity Calculation Based on the Location for Social Network Services
    Lee, Min-Joong
    Chung, Chin-Wan
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT I, 2011, 6587 : 38 - 52
  • [3] Friend Recommendation by User Similarity Graph Based on Interest in Social Tagging Systems
    Wu, Bu-Xiao
    Xiao, Jing
    Chen, Jie-Min
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, ICIC 2015, PT III, 2015, 9227 : 375 - 386
  • [4] User similarity-based graph convolutional neural network for shilling attack detection
    Zhang, Yan
    Hao, Qingbo
    Zheng, Wenguang
    Xiao, Yingyuan
    APPLIED INTELLIGENCE, 2025, 55 (05)
  • [5] Detecting Dynamic Topics in Social Network Using Citation based Anomaly Detection
    Kayalvizhi, P. .
    Selvi, C. Anoor
    PROCEEDINGS OF 2015 IEEE 9TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND CONTROL (ISCO), 2015,
  • [6] A Hierarchical Agglomerative algorithm of Community Detecting in social network based on Enhanced Similarity
    Kong, Bing
    Li, Lei
    Zhou, Lihua
    Bao, Chongming
    2014 SIXTH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS (IHMSC), VOL 1, 2014, : 396 - 400
  • [7] A novel subgraph -isomorphism method in social network based on graph similarity detection
    Rong, Huan
    Ma, Tinghuai
    Tang, Meili
    Cao, Jie
    SOFT COMPUTING, 2018, 22 (08) : 2583 - 2601
  • [8] Social Network Event Recommendation Algorithms Based on User Similarity Random Walk
    Ma T.-M.
    Zhou F.-C.
    Wang S.
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2019, 40 (11): : 1533 - 1538
  • [9] An anomaly detection model of user behavior based on similarity clustering
    Hu, Shuai
    Xiao, Zhihua
    Rao, Qiang
    Liao, Rongtao
    PROCEEDINGS OF 2018 IEEE 4TH INFORMATION TECHNOLOGY AND MECHATRONICS ENGINEERING CONFERENCE (ITOEC 2018), 2018, : 835 - 838
  • [10] Web graph similarity for anomaly detection
    Papadimitriou, Panagiotis
    Dasdan, Ali
    Garcia-Molina, Hector
    JOURNAL OF INTERNET SERVICES AND APPLICATIONS, 2010, 1 (01) : 19 - 30