User-driven competitive influence maximization in social networks

IF 0.9 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Theoretical Computer Science Pub Date : 2024-08-30 DOI:10.1016/j.tcs.2024.114813
Jiancong Liu, Zhiheng You, Ziwei Liang, Hongwei Du
{"title":"User-driven competitive influence maximization in social networks","authors":"Jiancong Liu,&nbsp;Zhiheng You,&nbsp;Ziwei Liang,&nbsp;Hongwei Du","doi":"10.1016/j.tcs.2024.114813","DOIUrl":null,"url":null,"abstract":"<div><p>Online social networks have emerged as pivotal platforms where users not only interact but also influence each other's decisions and preferences. As these networks grow in complexity, understanding and leveraging influence dynamics within networks have become essential, particularly for businesses and marketers. Competitive Influence Maximization (CIM) in online social networks has garnered significant interest, focusing on maximizing influence spread among multiple entities. However, recent research on CIM often overlooks the differences in user preferences, which realistically impact the propagation of competitive influence. To address this issue, we introduce the User-Driven Competitive Linear Threshold (UDCLT) model. This model takes into account user preference differences for two distinct brands within the identical product category, thereby formulating the User-Driven Competitive Influence Maximization (UDCIM) problem. Based on community structure, we introduce a novel measure, namely Topology Importance (TI), to assess a node's potential influence within a social network by considering its connections within and across communities. To resolve the UDCIM problem effectively, we develop a novel two-phase algorithm, the Community-based Dual Influence Assessment (CDIA) algorithm, which integrates Topology Importance and Dual Influence to identify seed nodes. Various experiments are conducted on four real-world datasets, illustrating the efficiency and effectiveness of the CDIA algorithm in addressing the UDCIM problem.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1018 ","pages":"Article 114813"},"PeriodicalIF":0.9000,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524004304","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Online social networks have emerged as pivotal platforms where users not only interact but also influence each other's decisions and preferences. As these networks grow in complexity, understanding and leveraging influence dynamics within networks have become essential, particularly for businesses and marketers. Competitive Influence Maximization (CIM) in online social networks has garnered significant interest, focusing on maximizing influence spread among multiple entities. However, recent research on CIM often overlooks the differences in user preferences, which realistically impact the propagation of competitive influence. To address this issue, we introduce the User-Driven Competitive Linear Threshold (UDCLT) model. This model takes into account user preference differences for two distinct brands within the identical product category, thereby formulating the User-Driven Competitive Influence Maximization (UDCIM) problem. Based on community structure, we introduce a novel measure, namely Topology Importance (TI), to assess a node's potential influence within a social network by considering its connections within and across communities. To resolve the UDCIM problem effectively, we develop a novel two-phase algorithm, the Community-based Dual Influence Assessment (CDIA) algorithm, which integrates Topology Importance and Dual Influence to identify seed nodes. Various experiments are conducted on four real-world datasets, illustrating the efficiency and effectiveness of the CDIA algorithm in addressing the UDCIM problem.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
社交网络中用户驱动的竞争影响力最大化
在线社交网络已成为一个关键平台,在这里,用户不仅可以互动,还可以影响彼此的决策和偏好。随着这些网络日益复杂,了解和利用网络内的影响力动态已变得至关重要,尤其是对企业和营销人员而言。在线社交网络中的 "竞争影响力最大化"(CIM)引起了人们的极大兴趣,其重点是最大化多个实体之间的影响力传播。然而,近期有关 CIM 的研究往往忽略了用户偏好的差异,而这种差异会对竞争影响力的传播产生现实影响。为了解决这个问题,我们引入了用户驱动的竞争线性阈值(UDCLT)模型。该模型考虑了相同产品类别中两个不同品牌的用户偏好差异,从而提出了用户驱动的竞争影响力最大化(UDCIM)问题。基于社区结构,我们引入了一种新的测量方法,即拓扑重要性(TI),通过考虑节点在社区内和社区间的连接来评估其在社交网络中的潜在影响力。为了有效解决 UDCIM 问题,我们开发了一种新颖的两阶段算法,即基于社群的双重影响力评估(CDIA)算法,该算法综合了拓扑重要性和双重影响力来识别种子节点。我们在四个真实世界数据集上进行了各种实验,说明了 CDIA 算法在解决 UDCIM 问题方面的效率和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.
期刊最新文献
Editorial Board Editorial Board Towards strong regret minimization sets: Balancing freshness and diversity in data selection Adding direction constraints to the 1-2-3 Conjecture Chemical mass-action systems as analog computers: Implementing arithmetic computations at specified speed
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1