利用用户体验识别社交网络扩散过程中的重要节点

F. Kazemzadeh, A. Safaei, M. Mirzarezaee
{"title":"利用用户体验识别社交网络扩散过程中的重要节点","authors":"F. Kazemzadeh, A. Safaei, M. Mirzarezaee","doi":"10.1109/CSICC58665.2023.10105397","DOIUrl":null,"url":null,"abstract":"The influence maximization problem (IMP) has been proposed in social networks. Nowadays, it is considered an important and practical problem due to the earnings potential by identifying a set of influential nodes, and therefore, it has been attracted by many researchers. This problem seeks to identify a set with K nodes among the social network nodes to maximize the influence and diffusion of information in that community. Algorithms proposed by other researchers have many shortcomings in terms of accuracy and run time of the algorithm. Hence, this article aimed to find the best, most accurate, and fastest solution to the problem.The article presented the UXM algorithm and used the User Experience criterion for the first time to solve this problem. At first, taking into account the reach club phenomenon and using criteria such as clustering coefficient, degree and also using user experience, nodes with more influence have been selected as the primary candidate set. Then, according to the component nodes, K final influential nodes have been selected. In this way, it could identify the set of nodes as accurately as possible with high efficiency in the shortest possible time. The evaluation of this algorithm and its comparison with other algorithms indicated excellent results in terms of run time and accuracy in selecting the set of nodes by the proposed algorithm.","PeriodicalId":127277,"journal":{"name":"2023 28th International Computer Conference, Computer Society of Iran (CSICC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Identification Important Nodes in Diffusion Process by User Experience on Social Network\",\"authors\":\"F. Kazemzadeh, A. Safaei, M. Mirzarezaee\",\"doi\":\"10.1109/CSICC58665.2023.10105397\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The influence maximization problem (IMP) has been proposed in social networks. Nowadays, it is considered an important and practical problem due to the earnings potential by identifying a set of influential nodes, and therefore, it has been attracted by many researchers. This problem seeks to identify a set with K nodes among the social network nodes to maximize the influence and diffusion of information in that community. Algorithms proposed by other researchers have many shortcomings in terms of accuracy and run time of the algorithm. Hence, this article aimed to find the best, most accurate, and fastest solution to the problem.The article presented the UXM algorithm and used the User Experience criterion for the first time to solve this problem. At first, taking into account the reach club phenomenon and using criteria such as clustering coefficient, degree and also using user experience, nodes with more influence have been selected as the primary candidate set. Then, according to the component nodes, K final influential nodes have been selected. In this way, it could identify the set of nodes as accurately as possible with high efficiency in the shortest possible time. The evaluation of this algorithm and its comparison with other algorithms indicated excellent results in terms of run time and accuracy in selecting the set of nodes by the proposed algorithm.\",\"PeriodicalId\":127277,\"journal\":{\"name\":\"2023 28th International Computer Conference, Computer Society of Iran (CSICC)\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 28th International Computer Conference, Computer Society of Iran (CSICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSICC58665.2023.10105397\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 28th International Computer Conference, Computer Society of Iran (CSICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSICC58665.2023.10105397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在社会网络中提出了影响最大化问题(IMP)。目前,由于确定一组有影响的节点所具有的收益潜力,它被认为是一个重要而现实的问题,因此受到了许多研究者的关注。这个问题寻求在社会网络节点中确定一个具有K个节点的集合,以最大化该社区中信息的影响和扩散。其他研究人员提出的算法在精度和算法运行时间方面存在许多不足。因此,本文旨在找到最佳、最准确和最快的解决方案。本文提出了UXM算法,并首次使用了用户体验准则来解决这一问题。首先,考虑到达俱乐部现象,利用聚类系数、程度等标准,并结合用户体验,选择影响力较大的节点作为主要候选集。然后,根据组成节点,选择K个最终影响节点。这样可以在尽可能短的时间内以高效率尽可能准确地识别节点集。对该算法的评价以及与其他算法的比较表明,该算法在运行时间和节点集选择精度方面都取得了优异的成绩。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Identification Important Nodes in Diffusion Process by User Experience on Social Network
The influence maximization problem (IMP) has been proposed in social networks. Nowadays, it is considered an important and practical problem due to the earnings potential by identifying a set of influential nodes, and therefore, it has been attracted by many researchers. This problem seeks to identify a set with K nodes among the social network nodes to maximize the influence and diffusion of information in that community. Algorithms proposed by other researchers have many shortcomings in terms of accuracy and run time of the algorithm. Hence, this article aimed to find the best, most accurate, and fastest solution to the problem.The article presented the UXM algorithm and used the User Experience criterion for the first time to solve this problem. At first, taking into account the reach club phenomenon and using criteria such as clustering coefficient, degree and also using user experience, nodes with more influence have been selected as the primary candidate set. Then, according to the component nodes, K final influential nodes have been selected. In this way, it could identify the set of nodes as accurately as possible with high efficiency in the shortest possible time. The evaluation of this algorithm and its comparison with other algorithms indicated excellent results in terms of run time and accuracy in selecting the set of nodes by the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信