{"title":"Maximizing diversity and persuasiveness of opinion articles in social networks","authors":"Liman Du, Wenguo Yang, Suixiang Gao","doi":"10.1007/s10878-024-01226-7","DOIUrl":null,"url":null,"abstract":"<p>Social-media platforms have created new ways for individuals to keep in touch with others, share their opinions and join the discussion on different issues. Traditionally studied by social science, opinion dynamic has attracted the attention from scientists in other fields. The formation and evolution of opinions is a complex process affected by the interplay of different elements that incorporate peer interaction in social networks and the diversity of information to which each individual is exposed. In addition, supplementary information can have an important role in driving the opinion formation and evolution. And due to the character of online social platforms, people can easily end an existing follower-followee relationship or stop interacting with a friend at any time. Taking a step in this direction, we propose the OG–IC model which considers the dynamic of both opinion and relationship in this paper. It not only considers the direct influence of friends but also highlights the indirect effect of group when individuals are exposed to new opinions. And it allows nodes which represent users of social networks to slightly adjust their own opinion and sometimes redefine friendships. A novel problem in social network whose purpose is simultaneously maximizing both the diversity of supplementary information that individuals access to and the influence of supplementary information on individual’s existing opinion is formulated. This problem is proved to be NP-hard and its objective function is neither submodular nor supermodular. However, an algorithm with approximate ratio guarantee is designed based on the sandwich framework. And the effectiveness of our algorithm is experimentally demonstrated on both synthetic and real-world data sets.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"79 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01226-7","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Social-media platforms have created new ways for individuals to keep in touch with others, share their opinions and join the discussion on different issues. Traditionally studied by social science, opinion dynamic has attracted the attention from scientists in other fields. The formation and evolution of opinions is a complex process affected by the interplay of different elements that incorporate peer interaction in social networks and the diversity of information to which each individual is exposed. In addition, supplementary information can have an important role in driving the opinion formation and evolution. And due to the character of online social platforms, people can easily end an existing follower-followee relationship or stop interacting with a friend at any time. Taking a step in this direction, we propose the OG–IC model which considers the dynamic of both opinion and relationship in this paper. It not only considers the direct influence of friends but also highlights the indirect effect of group when individuals are exposed to new opinions. And it allows nodes which represent users of social networks to slightly adjust their own opinion and sometimes redefine friendships. A novel problem in social network whose purpose is simultaneously maximizing both the diversity of supplementary information that individuals access to and the influence of supplementary information on individual’s existing opinion is formulated. This problem is proved to be NP-hard and its objective function is neither submodular nor supermodular. However, an algorithm with approximate ratio guarantee is designed based on the sandwich framework. And the effectiveness of our algorithm is experimentally demonstrated on both synthetic and real-world data sets.
期刊介绍:
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.