{"title":"利用深度强化学习增强社交网络中的群体影响力最大化","authors":"Smita Ghosh;Tiantian Chen;Weili Wu","doi":"10.1109/TCSS.2024.3459853","DOIUrl":null,"url":null,"abstract":"In contemporary society, groups are pivotal in shaping decisions and actions. The consensus of a majority of members on specific topics often guides the collective decision-making in groups. Group influence maximization (GIM) aims to select <inline-formula><tex-math>$k$</tex-math></inline-formula> seed users in a network to maximize the number of eventually activated groups. A group is said to be activated if <inline-formula><tex-math>$\\beta$</tex-math></inline-formula> percent of users in this group are activated. This study delves into the strategic selection of seed users in social networks to maximize the spread of a topic, thereby activating the highest number of groups. The GIM problem, inherently NP-hard when computing the influence spread from a selected set of nodes, has traditionally faced obstacles in ensuring theoretical robustness, time efficiency, and adaptability in large and complex network environments. To overcome these challenges, we introduce a robust framework called GIMDRL that addresses the GIM problem in social networks using deep reinforcement learning (DRL). Our approach integrates node embeddings from multiple graph neural networks, thereby utilizing diverse information for effective network analysis. This integration plays a crucial role in optimizing the parameter learning process. Extensive experiments are conducted on real-world and synthetic datasets to assess the performance of our proposed framework. The results of these experiments indicate that our approach significantly outperforms existing methods in GIM, even when trained on sampled graphs. This highlights our model's strong capacity for generalization in varying network scenarios.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":"12 2","pages":"573-585"},"PeriodicalIF":4.5000,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhanced Group Influence Maximization in Social Networks Using Deep Reinforcement Learning\",\"authors\":\"Smita Ghosh;Tiantian Chen;Weili Wu\",\"doi\":\"10.1109/TCSS.2024.3459853\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In contemporary society, groups are pivotal in shaping decisions and actions. The consensus of a majority of members on specific topics often guides the collective decision-making in groups. Group influence maximization (GIM) aims to select <inline-formula><tex-math>$k$</tex-math></inline-formula> seed users in a network to maximize the number of eventually activated groups. A group is said to be activated if <inline-formula><tex-math>$\\\\beta$</tex-math></inline-formula> percent of users in this group are activated. This study delves into the strategic selection of seed users in social networks to maximize the spread of a topic, thereby activating the highest number of groups. The GIM problem, inherently NP-hard when computing the influence spread from a selected set of nodes, has traditionally faced obstacles in ensuring theoretical robustness, time efficiency, and adaptability in large and complex network environments. To overcome these challenges, we introduce a robust framework called GIMDRL that addresses the GIM problem in social networks using deep reinforcement learning (DRL). Our approach integrates node embeddings from multiple graph neural networks, thereby utilizing diverse information for effective network analysis. This integration plays a crucial role in optimizing the parameter learning process. Extensive experiments are conducted on real-world and synthetic datasets to assess the performance of our proposed framework. The results of these experiments indicate that our approach significantly outperforms existing methods in GIM, even when trained on sampled graphs. This highlights our model's strong capacity for generalization in varying network scenarios.\",\"PeriodicalId\":13044,\"journal\":{\"name\":\"IEEE Transactions on Computational Social Systems\",\"volume\":\"12 2\",\"pages\":\"573-585\"},\"PeriodicalIF\":4.5000,\"publicationDate\":\"2024-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Computational Social Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10705687/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10705687/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
Enhanced Group Influence Maximization in Social Networks Using Deep Reinforcement Learning
In contemporary society, groups are pivotal in shaping decisions and actions. The consensus of a majority of members on specific topics often guides the collective decision-making in groups. Group influence maximization (GIM) aims to select $k$ seed users in a network to maximize the number of eventually activated groups. A group is said to be activated if $\beta$ percent of users in this group are activated. This study delves into the strategic selection of seed users in social networks to maximize the spread of a topic, thereby activating the highest number of groups. The GIM problem, inherently NP-hard when computing the influence spread from a selected set of nodes, has traditionally faced obstacles in ensuring theoretical robustness, time efficiency, and adaptability in large and complex network environments. To overcome these challenges, we introduce a robust framework called GIMDRL that addresses the GIM problem in social networks using deep reinforcement learning (DRL). Our approach integrates node embeddings from multiple graph neural networks, thereby utilizing diverse information for effective network analysis. This integration plays a crucial role in optimizing the parameter learning process. Extensive experiments are conducted on real-world and synthetic datasets to assess the performance of our proposed framework. The results of these experiments indicate that our approach significantly outperforms existing methods in GIM, even when trained on sampled graphs. This highlights our model's strong capacity for generalization in varying network scenarios.
期刊介绍:
IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.