社交媒体网络中强吸引子的检测。

Q1 Mathematics
Computational Social Networks Pub Date : 2016-01-01 Epub Date: 2016-12-07 DOI:10.1186/s40649-016-0036-9
Ziyaad Qasem, Marc Jansen, Tobias Hecking, H Ulrich Hoppe
{"title":"社交媒体网络中强吸引子的检测。","authors":"Ziyaad Qasem,&nbsp;Marc Jansen,&nbsp;Tobias Hecking,&nbsp;H Ulrich Hoppe","doi":"10.1186/s40649-016-0036-9","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>Detection of influential actors in social media such as Twitter or Facebook plays an important role for improving the quality and efficiency of work and services in many fields such as education and marketing.</p><p><strong>Methods: </strong>The work described here aims to introduce a new approach that characterizes the influence of actors by the strength of attracting new active members into a networked community. We present a model of influence of an actor that is based on the attractiveness of the actor in terms of the number of other new actors with which he or she has established relations over time.</p><p><strong>Results: </strong>We have used this concept and measure of influence to determine optimal seeds in a simulation of influence maximization using two empirically collected social networks for the underlying graphs.</p><p><strong>Conclusions: </strong>Our empirical results on the datasets demonstrate that our measure stands out as a useful measure to define the attractors comparing to the other influence measures.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"3 1","pages":"11"},"PeriodicalIF":0.0000,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-016-0036-9","citationCount":"6","resultStr":"{\"title\":\"Detection of strong attractors in social media networks.\",\"authors\":\"Ziyaad Qasem,&nbsp;Marc Jansen,&nbsp;Tobias Hecking,&nbsp;H Ulrich Hoppe\",\"doi\":\"10.1186/s40649-016-0036-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Background: </strong>Detection of influential actors in social media such as Twitter or Facebook plays an important role for improving the quality and efficiency of work and services in many fields such as education and marketing.</p><p><strong>Methods: </strong>The work described here aims to introduce a new approach that characterizes the influence of actors by the strength of attracting new active members into a networked community. We present a model of influence of an actor that is based on the attractiveness of the actor in terms of the number of other new actors with which he or she has established relations over time.</p><p><strong>Results: </strong>We have used this concept and measure of influence to determine optimal seeds in a simulation of influence maximization using two empirically collected social networks for the underlying graphs.</p><p><strong>Conclusions: </strong>Our empirical results on the datasets demonstrate that our measure stands out as a useful measure to define the attractors comparing to the other influence measures.</p>\",\"PeriodicalId\":52145,\"journal\":{\"name\":\"Computational Social Networks\",\"volume\":\"3 1\",\"pages\":\"11\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1186/s40649-016-0036-9\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Social Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1186/s40649-016-0036-9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2016/12/7 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/s40649-016-0036-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2016/12/7 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 6

摘要

背景:在Twitter或Facebook等社交媒体中发现有影响力的行动者,对于提高教育和营销等许多领域的工作和服务的质量和效率起着重要作用。方法:这里描述的工作旨在引入一种新的方法,通过吸引新的活跃成员进入网络社区的力量来表征行动者的影响。我们提出了一个演员的影响力模型,该模型基于演员的吸引力,即他或她随着时间的推移与之建立关系的其他新演员的数量。结果:我们已经使用这个概念和影响力的措施,以确定最优的种子在影响最大化的模拟使用两个经验收集的社会网络的底层图。结论:我们在数据集上的实证结果表明,与其他影响度量相比,我们的度量作为定义吸引子的有用度量脱颖而出。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Detection of strong attractors in social media networks.

Detection of strong attractors in social media networks.

Detection of strong attractors in social media networks.

Detection of strong attractors in social media networks.

Background: Detection of influential actors in social media such as Twitter or Facebook plays an important role for improving the quality and efficiency of work and services in many fields such as education and marketing.

Methods: The work described here aims to introduce a new approach that characterizes the influence of actors by the strength of attracting new active members into a networked community. We present a model of influence of an actor that is based on the attractiveness of the actor in terms of the number of other new actors with which he or she has established relations over time.

Results: We have used this concept and measure of influence to determine optimal seeds in a simulation of influence maximization using two empirically collected social networks for the underlying graphs.

Conclusions: Our empirical results on the datasets demonstrate that our measure stands out as a useful measure to define the attractors comparing to the other influence measures.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computational Social Networks
Computational Social Networks Mathematics-Modeling and Simulation
自引率
0.00%
发文量
0
审稿时长
13 weeks
期刊介绍: Computational Social Networks showcases refereed papers dealing with all mathematical, computational and applied aspects of social computing. The objective of this journal is to advance and promote the theoretical foundation, mathematical aspects, and applications of social computing. Submissions are welcome which focus on common principles, algorithms and tools that govern network structures/topologies, network functionalities, security and privacy, network behaviors, information diffusions and influence, social recommendation systems which are applicable to all types of social networks and social media. Topics include (but are not limited to) the following: -Social network design and architecture -Mathematical modeling and analysis -Real-world complex networks -Information retrieval in social contexts, political analysts -Network structure analysis -Network dynamics optimization -Complex network robustness and vulnerability -Information diffusion models and analysis -Security and privacy -Searching in complex networks -Efficient algorithms -Network behaviors -Trust and reputation -Social Influence -Social Recommendation -Social media analysis -Big data analysis on online social networks This journal publishes rigorously refereed papers dealing with all mathematical, computational and applied aspects of social computing. The journal also includes reviews of appropriate books as special issues on hot topics.
×
引用
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学术官方微信