Abstract
Recently, dynamic social network research has attracted a great amount of attention, especially in the area of anomaly analysis that analyzes the anomalous change in the evolution of dynamic social networks. However, most of the current research focused on anomaly analysis of the macro representation of dynamic social networks and failed to analyze the nodes that have anomalous structural changes at a micro level. To identify and evaluate anomalous structural change-based nodes in generalized dynamic social networks that only have limited structural information, this research considers undirected and unweighted graphs and develops a multiple-neighbor superposition similarity method (\(\)), which mainly consists of a multiple-neighbor range algorithm (\(\)) and a superposition similarity fluctuation algorithm (\(\)). \(\) introduces observation nodes, characterizes the structural similarities of nodes within multiple-neighbor ranges, and proposes a new multiple-neighbor similarity index on the basis of extensional similarity indices. Subsequently, \(\) maximally reflects the structural change of each node, using a new superposition similarity fluctuation index from the perspective of diverse multiple-neighbor similarities. As a result, based on \(\) and \(\), \(\) not only identifies anomalous structural change-based nodes by detecting the anomalous structural changes of nodes but also evaluates their anomalous degrees by quantifying these changes. Results obtained by comparing with state-of-the-art methods via extensive experiments show that \(\) can accurately identify anomalous structural change-based nodes and evaluate their anomalous degrees well.
- L. Akoglu, H. Tong, and D. Koutra. 2015. Graph based anomaly detection and description: A survey. Data Min. Knowl. Discov. 29, 3 (2015), 626–688. Google Scholar
Digital Library
- L. Akoglu and C. Faloutsos. 2008. Event detection in time series of mobile communication graphs. In Proceedings of the Army Science Conference.Google Scholar
- J. Bian, Y. Yang, H. Zhang, and T. Chua. 2015. Multimedia summarization for social events in microblog stream. IEEE Trans. Multimedia 17, 2 (2015), 216–228.Google Scholar
Digital Library
- C. Noble and J. Cook. 2003. Graph-based anomaly detection. In SIGKDD. Google Scholar
Digital Library
- W. Fang, J. Sun, H. Chen, and X. Wu. 2016. A decentralized quantum-inspired particle swarm optimization algorithm with structured population. Inf. Sci. 330 (2016), 19–48. Google Scholar
Digital Library
- G. Guo, F. Zhu, E. Chen, Q. Liu, L. Wu, and C. Guan. 2016. From footprint to evidence: An exploratory study of mining social data for credit scoring. ACM Trans. Web 10, 4 (2016), 22. Google Scholar
Digital Library
- G. Grinstein, C. Plaisant, S. Laskowski, T. O'Connell, J. Scholtz, and M. Whiting. 2008. VAST 2008 Challenge: Introducing mini-challenges. In VAST 195–196.Google Scholar
- M. Hoefer. 2011. Local matching dynamics in social networks. 2011. Inf. Comput. 222, 4 (2011), 113–124. Google Scholar
Digital Library
- K. Henderson, B. Gallagher, T. Eliassi-Rad, H. Tong, S. Basu, and L. Akoglu. 2012. RolX: Structural role extraction and mining in large graphs. In SDMKDD. Google Scholar
Digital Library
- W. Hu, H. Wang, Z. Qiu, and B. Du. 2016. An event detection method for social networks based on hybrid link prediction and quantum swarm intelligent. World Wide Web 20, 4 (2016), 1–21. Google Scholar
Digital Library
- E. Leicht, H. Petter, and M. Newman. 2006. Vertex similarity in networks. Phys. Rev. E 73, 2 (2006), 026120.Google Scholar
Cross Ref
- T. Zhou, L. Lü, and Y. Zhang. 2009. Predicting missing links via local information. Eur. Phys. J. B 71, 4 (2009), 623–630.Google Scholar
Cross Ref
- E. Ravasz, A. Somera, D. Mongru, Z. Oltvai, and L. Barabási. 2002. Hierarchical organization of modularity in metabolic networks. Science 297, 5586 (2002), 1551–1555.Google Scholar
- L. Adamic and E. Adar. 2003. Friends and neighbors on the web. Soc. Netw. 25, 3 (2003), 211–230.Google Scholar
Cross Ref
- L. Hou, M. Small, and S. Lao. 2014. Maximum entropy networks are more controllable than preferential attachment networks. Phys. Lett. A 378, 46 (2014), 3426–3430.Google Scholar
Cross Ref
- H. Huang, J. Tang, L. Liu, J. Luo, and X. Fu. 2015. Triadic closure pattern analysis and prediction in social networks. IEEE Trans. Knowl. Data Eng. 27, 12 (2015), 3374–3389. Google Scholar
Digital Library
- W. Jiang, G. Wang, M. Z. A. Bhuiyan, and J. Wu. 2016. Understanding graph-based trust evaluation in online social networks. ACM Comput. Surv. 49, 1 (2016), 1–35. Google Scholar
Digital Library
- U. Kang, S. Papadimitriou, J. Sun, and H. Tong. 2011. Centralities in large networks: Algorithms and observations. In SDM.Google Scholar
- B. Klimt and Y. Yang. 2004. The enron corpus: A new dataset for email classification research. In Lecture Notes in Computer Science, Vol. 3201, 217–226. Google Scholar
Digital Library
- L. Hu, B. Zhang, L. Hou, and J. Li. 2017. Adaptive online event detection in news streams. Knowl.-Bas. Syst. 138, C (2017), 105–112. Google Scholar
Digital Library
- R. Lida. 2017. Anomaly Detection in Large Evolving Graphs. Ph.D. Dissertation.Google Scholar
- R. Bridges, J. Collins, E. Ferragut, J. Laska, and B. Sullivan. 2016. A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization. Soc. Netw. Anal. Min. 6, 1 (2016), 99.Google Scholar
Cross Ref
- V. Dmitry and T. Hemal. 2015. Anomaly Detection in Graph: Unsupervised Learning, Graph-based Features and Deep Architecture. Technical Report.Google Scholar
- L. Lü, L. Pan, T. Zhou, Y. C. Zhang, and H. E. Stanley. 2015. Toward link predictability of complex networks. Proc. Natl. Acad. Sci. U.S.A. 112, 8 (2015), 2325.Google Scholar
Cross Ref
- Y. Liu, J. Slotine, and A. L. Barabasi. 2011. Controllability of complex networks. Nature 473, 7346 (2011), 167–173.Google Scholar
- L. Lü and T. Zhou. 2011. Link prediction in complex networks: A survey. Physica A 390, 6 (2011), 1150–1170.Google Scholar
Cross Ref
- L. Li, L. Jiao, J. Zhao, and M. Gong, 2017. Quantum-behaved discrete multi-objective particle swarm optimization for complex network clustering. Pattern Recogn. 63 (2017), 1–14. Google Scholar
Digital Library
- S. Liu, Q. Qu, and S. Wang. 2018. Heterogeneous anomaly detection in social diffusion with discriminative feature discovery. Inf. Sci. 439-440 (2018), 1–18.Google Scholar
- Q. Lin, S. Liu, Q. Zhu, C. Tang, R. Song, and J. Chen. 2018. Particle swarm optimization with a balanceable fitness estimation for many-objective optimization problems. IEEE Trans. Evol. Comput. 22, 1 (2018), 32–46.Google Scholar
- J. Leskovec, J. Kleinberg, and C. Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1 (2007), 1. Google Scholar
Digital Library
- J. Leskovec, J. Kleinberg, and C. Faloutsos. 2006. Overview of the 2003 KDD cup. In SIGKDD.Google Scholar
- J. Leskovec and C. Faloutsos. 2006. Sampling from large graphs. In SIGKDD. Google Scholar
Digital Library
- Y. Li, X. Bai, L. Jiao, X. Yu. 2017. Partitioned-cooperative quantum-behaved particle swarm optimization based on multilevel thresholding applied to medical image segmentation. Appl. Soft Comput. 56 (2017), 345–356. Google Scholar
Digital Library
- Y. Matsubara, Y. Sakurai, B. A. Prakash, L. Li, and C. Faloutsos. 2017. Nonlinear dynamics of information diffusion in social networks. ACM Trans. Web 11, 2 (2017), 1–40. Google Scholar
Digital Library
- X. Ma, D. Di, and W. Qua. 2019. Community detection in multi-layer networks using joint nonnegative matrix factorization. IEEE Trans. Knowl. Data Eng. (2019). Google Scholar
Digital Library
- C. Coello, G. Pulido, and M. Lechuga. 2004. Handling multiple objectives with particle swarm optimization. IEEE Trans. Evol. Comput. 8, 3 (2004), 256–279. Google Scholar
Digital Library
- M. Nascimento. 2014. Community detection in networks via a spectral heuristic based on the clustering coefficient. Discr. Appl. Math. 176, 3 (2014), 89–99. Google Scholar
Digital Library
- C. C. Noble and D. J. Cook, 2003. Graph-based anomaly detection. In SIGKDD. Google Scholar
Digital Library
- P. Pietro, O. Tore, and M. Kathleen. 2009. Patterns and dynamics of users' behavior and interaction: Network analysis of an online community. J. Am. Soc. Inf. Sci. Technol. 60, 5 (2009), 911–932. Google Scholar
Digital Library
- A. Paranjape, A. R. Benson, and J. Leskovec. 2017. Motifs in temporal networks. In WSDM 601–610. Google Scholar
Digital Library
- G. Stilo and P. Velardi. 2016. Efficient temporal mining of micro-blog texts and its application to event discovery. Data Min. Knowl. Discov. 30, 2 (2016), 372–402. Google Scholar
Digital Library
- R. Rossi, B. Gallagher, J. Neville, and K. Henderson. 2012. Role-dynamics: Fast mining of large dynamic networks. In WWW. 997–1006. Google Scholar
Digital Library
- R. A. Rossi, B. Gallagher, J. Neville, and K. Henderson. 2013. Modeling dynamic behavior in large evolving graphs. In WSDM. 667–676. Google Scholar
Digital Library
- G. Song, Y. Li, X. Chen, X. He, and J. Tang. 2017. Influential node tracking on dynamic social network: An interchange greedy approach. ACM Trans. Knowl. Discov. Data 29, 2 (2017), 359–372. Google Scholar
Digital Library
- P. Shoubridge, M. Kraetzl, W. Wallis, and H. Bunke. 2002. Detection of abnormal change in a time series of graphs. J. Interconnect. Netw. 3, 1 (2002), 85–101.Google Scholar
Cross Ref
- K. Saito, M. Kimura, K. Ohara, and H. Motoda. 2016. A new centrality measure of node importance for information diffusion over social network. Inf. Sci. 329, 985–1000. Google Scholar
Digital Library
- H. Wang, W. B. Hu, Z. Qiu, and B. Du. 2017. Nodes' evolution diversity and link prediction in social networks. IEEE Trans. Knowl. Data Eng. 29, 10 (2017), 2263–2274.Google Scholar
Digital Library
- H. Wang, J. Wu, W. B. Hu, and X. Wu. 2019. Detecting and assessing anomalous evolutionary behaviors of nodes in evolving social networks. ACM Trans. Knowl. Discov. Data 13, 1 (2019), 1–24. Google Scholar
Digital Library
- Y. Wang, F. Ma, Z. Jin, Y. Ye, G. Xun, K. Jha, L. Su, and J. Gao. 2018. EANN: Event adversarial neural networks for multi-Modal fake news detection. In SIGKDD. Google Scholar
Digital Library
- Xue, S. Hirche, and M. Cao. 2019. Opinion behavior analysis in social networks under the influence of coopetitive media. (unpublished).Google Scholar
- A. De, S. Bhattacharya, S. Sarkar, N. Ganguly, and S. Chakrabarti. 2016. Discriminative link prediction using local, community and global signals. IEEE Trans. Knowl. Data Eng. 28, 8 (2016), 2057–2070.Google Scholar
Digital Library
- J. P. Onnela, J. Saramaki, J. Kertész, and K. Kaski. 2005. Intensity and coherence of motifs in weighted complex networks. Phys. Rev. E 71, 6 (2005), 531–536.Google Scholar
Cross Ref
Index Terms
Identifying and Evaluating Anomalous Structural Change-based Nodes in Generalized Dynamic Social Networks
Recommendations
Exploiting Anomalous Structural Nodes in Dynamic Social Networks
WWW '22: Companion Proceedings of the Web Conference 2022As a long-lasting challenge in dynamic social networks, anomaly analysis research has attracted much attention. Unfortunately, existing methods focus on the macro representation of dynamic social networks and fail to analyze the micro-level nodes. ...
A New Community Structure Detection Method Based on Structural Similarity
CIS '11: Proceedings of the 2011 Seventh International Conference on Computational Intelligence and SecurityCommunity structure detection is to use the graph topology, which means the community structure, is analyzed from the complex network. It is very important to understand and use the network structure. Recently, a lot of algorithms are presented to ...
Structural similarity measure between UML class diagrams based on UCG
AbstractIn software reuse, the reuse of UML class diagram produced in design phase has received more attention due to the important influence on the following developing process. The reuse is based on similarity. The similarity between class diagrams ...






Comments