Social networks are inevitable parts of our daily life,where an unprecedented amount of complex data corresponding to a diverse range of applications are generated.As such,it is imperative to conduct research on socia...Social networks are inevitable parts of our daily life,where an unprecedented amount of complex data corresponding to a diverse range of applications are generated.As such,it is imperative to conduct research on social events and patterns from the perspectives of conventional sociology to optimize services that originate from social networks.Event tracking in social networks finds various applications,such as network security and societal governance,which involves analyzing data generated by user groups on social networks in real time.Moreover,as deep learning techniques continue to advance and make important breakthroughs in various fields,researchers are using this technology to progressively optimize the effectiveness of Event Detection(ED)and tracking algorithms.In this regard,this paper presents an in-depth comprehensive review of the concept and methods involved in ED and tracking in social networks.We introduce mainstream event tracking methods,which involve three primary technical steps:ED,event propagation,and event evolution.Finally,we introduce benchmark datasets and evaluation metrics for ED and tracking,which allow comparative analysis on the performance of mainstream methods.Finally,we present a comprehensive analysis of the main research findings and existing limitations in this field,as well as future research prospects and challenges.展开更多
Online social networks are increasingly connecting people around the world.Influence maximization is a key area of research in online social networks,which identifies influential users during information dissemination...Online social networks are increasingly connecting people around the world.Influence maximization is a key area of research in online social networks,which identifies influential users during information dissemination.Most of the existing influence maximization methods only consider the transmission of a single channel,but real-world networks mostly include multiple channels of information transmission with competitive relationships.The problem of influence maximization in an environment involves selecting the seed node set for certain competitive information,so that it can avoid the influence of other information,and ultimately affect the largest set of nodes in the network.In this paper,the influence calculation of nodes is achieved according to the local community discovery algorithm,which is based on community dispersion and the characteristics of dynamic community structure.Furthermore,considering two various competitive information dissemination cases as an example,a solution is designed for self-interested information based on the assumption that the seed node set of competitive information is known,and a novel influence maximization algorithm of node avoidance based on user interest is proposed.Experiments conducted based on real-world Twitter dataset demonstrates the efficiency of our proposed algorithm in terms of accuracy and time against notable influence maximization algorithms.展开更多
基金This work was supported by the National Natural Science Foundation of China(No.62302199)the China Postdoctoral Science Foundation(No.2023M731368)+3 种基金the Natural Science Foundation of the Jiangsu Higher Education Institutions(No.22KJB520016)the Jiangsu University Innovative Research Project(No.KYCX22_3671)the Youth Foundation Project of Humanities and Social Sciences of Ministry of Education in China(No.22YJC870007)the Jiangsu University Undergraduate Student English Teaching Excellence Program,and the Ministry of Education's Industry-Education Cooperation Collaborative Education Project(No.202102306005).
文摘Social networks are inevitable parts of our daily life,where an unprecedented amount of complex data corresponding to a diverse range of applications are generated.As such,it is imperative to conduct research on social events and patterns from the perspectives of conventional sociology to optimize services that originate from social networks.Event tracking in social networks finds various applications,such as network security and societal governance,which involves analyzing data generated by user groups on social networks in real time.Moreover,as deep learning techniques continue to advance and make important breakthroughs in various fields,researchers are using this technology to progressively optimize the effectiveness of Event Detection(ED)and tracking algorithms.In this regard,this paper presents an in-depth comprehensive review of the concept and methods involved in ED and tracking in social networks.We introduce mainstream event tracking methods,which involve three primary technical steps:ED,event propagation,and event evolution.Finally,we introduce benchmark datasets and evaluation metrics for ED and tracking,which allow comparative analysis on the performance of mainstream methods.Finally,we present a comprehensive analysis of the main research findings and existing limitations in this field,as well as future research prospects and challenges.
基金supported by the National Natural Science Foundation of China(Nos.61502209 and 61502207)
文摘Online social networks are increasingly connecting people around the world.Influence maximization is a key area of research in online social networks,which identifies influential users during information dissemination.Most of the existing influence maximization methods only consider the transmission of a single channel,but real-world networks mostly include multiple channels of information transmission with competitive relationships.The problem of influence maximization in an environment involves selecting the seed node set for certain competitive information,so that it can avoid the influence of other information,and ultimately affect the largest set of nodes in the network.In this paper,the influence calculation of nodes is achieved according to the local community discovery algorithm,which is based on community dispersion and the characteristics of dynamic community structure.Furthermore,considering two various competitive information dissemination cases as an example,a solution is designed for self-interested information based on the assumption that the seed node set of competitive information is known,and a novel influence maximization algorithm of node avoidance based on user interest is proposed.Experiments conducted based on real-world Twitter dataset demonstrates the efficiency of our proposed algorithm in terms of accuracy and time against notable influence maximization algorithms.
