7 September 2020 in IEEE Access
Microblogging—a popular social media service platform—has become a new information channel for users to receive and exchange the most up-to-date information on current events. Consequently, it is a crucial platform for maximizing community influence which has broad application prospects in recommendation system, advertising and other fields. With the rapid development of the mobile Internet, online social networks are gradually infiltrating into our daily lives, in which the communities are an important part of social networks. The combination of social networking and edge computing technology has important application value and is the development trend of influence maximization in future networks. However, traditional influence maximization models look for the most influential seed nodes while ignoring the fact that the selected seed nodes are various for different event topics, which significantly reduces the efficiency and accuracy of event propagation. In addition, most existing methods focus only on event propagation and neglect multiple topics in event propagation. At the same time, the interests of users in the network are not always single and the user's interest and the topic of the event will change over time, thus making it challenging to track momentous events in a timely manner. To address these issues, this paper proposes a Multi-Topic Learning-based Independent Cascade model (MTL-IC), and a Similarity Priority Mechanism-based Event Evolution model (SPM-EE). MTL-IC incorporates multi-topic factors and considers the authority and hub in interests of user, which makes the results more efficient and more accurate. SPM-EE can update the seed users according to their changeable interest in time, which largely improve the precision of event evolution. The experimental results, using Twitter datasets, demonstrate the effectiveness of our proposed methods for both dynamic community influence maximization and event evolution.
1 January 2021 in Wireless Communications and Mobile Computing
Link prediction in online social networks intends to predict users who are yet to establish their network of friends, with the motivation of offering friend recommendation based on the current network structure and the attributes of nodes. However, many existing link prediction methods do not consider important information such as community characteristics, text information, and growth mechanism. In this paper, we propose an intelligent data management mechanism based on relationship strength according to the characteristics of social networks for achieving a reliable prediction in online social networks. Secondly, by considering the network structure attributes and interest preference of users as important factors affecting the link prediction process in online social networks, we propose further improvements in the prediction process by designing a friend recommendation model with a novel incorporation of the relationship information and interest preference characteristics of users into the community detection algorithm. Finally, extensive experiments conducted on a Twitter dataset demonstrate the effectiveness of our proposed models in both dynamic community detection and link prediction.
6 November 2019 in IEEE Access
with the rapid development of online social networks, there is a trend of information interconnection among online social networks. User’s social behaviors are no longer confined to a single network but interact in the form of overlapping networks. Studying the problem of maximizing the influence of overlapping networks can not only make the influence spread to the extent that a single network cannot reach, but also effectively control the cost of advertising while maintaining the scope of diffusion. However, the existing models of user identification and influence propagation in overlapping networks are still not efficient enough. For this reason, this paper studies the problem of maximizing influence in overlapping networks based on user interests. First, network coupling is carried out through the "bridge" role of overlapping network users; secondly, independent cascade model is used. On the basis of this, a User Interest-based Influence Propagation Model of the Overlay Network (UI-IPM) is designed. Finally, based on the UI-IPM model, a heuristic algorithm combined with the greedy algorithm is designed to maximize the impact of overlapping networks (UI-IPM) and achieve Influence Maximization of the Overlay Network (IMON) mining seed nodes. The experimental results show the effectiveness of IMON algorithm in terms of influence sphere and time efficiency, and also verify the efficiency of seed nodes mining in overlapping network environment compared with a single network environment.