随时间跟踪在线主题:了解动态标签社区。

Q1 Mathematics
Computational Social Networks Pub Date : 2018-01-01 Epub Date: 2018-10-19 DOI:10.1186/s40649-018-0058-6
Philipp Lorenz-Spreen, Frederik Wolf, Jonas Braun, Gourab Ghoshal, Nataša Djurdjevac Conrad, Philipp Hövel
{"title":"随时间跟踪在线主题:了解动态标签社区。","authors":"Philipp Lorenz-Spreen,&nbsp;Frederik Wolf,&nbsp;Jonas Braun,&nbsp;Gourab Ghoshal,&nbsp;Nataša Djurdjevac Conrad,&nbsp;Philipp Hövel","doi":"10.1186/s40649-018-0058-6","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>Hashtags are widely used for communication in online media. As a condensed version of information, they characterize topics and discussions. For their analysis, we apply methods from network science and propose novel tools for tracing their dynamics in time-dependent data. The observations are characterized by bursty behaviors in the increases and decreases of hashtag usage. These features can be reproduced with a novel model of dynamic rankings.</p><p><strong>Hashtag communities in time: </strong>We build temporal and weighted co-occurrence networks from hashtags. On static snapshots, we infer the community structure using customized methods. On temporal networks, we solve the bipartite matching problem of detected communities at subsequent timesteps by taking into account higher-order memory. This results in a matching protocol that is robust toward temporal fluctuations and instabilities of the static community detection. The proposed methodology is broadly applicable and its outcomes reveal the temporal behavior of online topics.</p><p><strong>Modeling topic-dynamics: </strong>We consider the size of the communities in time as a proxy for online popularity dynamics. We find that the distributions of gains and losses, as well as the interevent times are fat-tailed indicating occasional, but large and sudden changes in the usage of hashtags. Inspired by typical website designs, we propose a stochastic model that incorporates a ranking with respect to a time-dependent prestige score. This causes occasional cascades of rank shift events and reproduces the observations with good agreement. This offers an explanation for the observed dynamics, based on characteristic elements of online media.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"5 1","pages":"9"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-018-0058-6","citationCount":"9","resultStr":"{\"title\":\"Tracking online topics over time: understanding dynamic hashtag communities.\",\"authors\":\"Philipp Lorenz-Spreen,&nbsp;Frederik Wolf,&nbsp;Jonas Braun,&nbsp;Gourab Ghoshal,&nbsp;Nataša Djurdjevac Conrad,&nbsp;Philipp Hövel\",\"doi\":\"10.1186/s40649-018-0058-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Background: </strong>Hashtags are widely used for communication in online media. As a condensed version of information, they characterize topics and discussions. For their analysis, we apply methods from network science and propose novel tools for tracing their dynamics in time-dependent data. The observations are characterized by bursty behaviors in the increases and decreases of hashtag usage. These features can be reproduced with a novel model of dynamic rankings.</p><p><strong>Hashtag communities in time: </strong>We build temporal and weighted co-occurrence networks from hashtags. On static snapshots, we infer the community structure using customized methods. On temporal networks, we solve the bipartite matching problem of detected communities at subsequent timesteps by taking into account higher-order memory. This results in a matching protocol that is robust toward temporal fluctuations and instabilities of the static community detection. The proposed methodology is broadly applicable and its outcomes reveal the temporal behavior of online topics.</p><p><strong>Modeling topic-dynamics: </strong>We consider the size of the communities in time as a proxy for online popularity dynamics. We find that the distributions of gains and losses, as well as the interevent times are fat-tailed indicating occasional, but large and sudden changes in the usage of hashtags. Inspired by typical website designs, we propose a stochastic model that incorporates a ranking with respect to a time-dependent prestige score. This causes occasional cascades of rank shift events and reproduces the observations with good agreement. This offers an explanation for the observed dynamics, based on characteristic elements of online media.</p>\",\"PeriodicalId\":52145,\"journal\":{\"name\":\"Computational Social Networks\",\"volume\":\"5 1\",\"pages\":\"9\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1186/s40649-018-0058-6\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Social Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1186/s40649-018-0058-6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2018/10/19 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-018-0058-6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2018/10/19 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 9

摘要

背景:标签在网络媒体中被广泛用于交流。作为信息的浓缩版本,它们具有主题和讨论的特征。对于它们的分析,我们应用了网络科学的方法,并提出了新的工具来追踪它们在时间相关数据中的动态。观察结果的特点是标签使用的增加和减少的突发行为。这些特征可以用一种新的动态排名模型再现。及时的标签社区:我们从标签中构建时间和加权的共现网络。对于静态快照,我们使用自定义方法推断社区结构。在时间网络上,我们通过考虑高阶记忆来解决在后续时间步中检测到的社区的二部匹配问题。这使得匹配协议对静态社区检测的时间波动和不稳定性具有鲁棒性。所提出的方法具有广泛的适用性,其结果揭示了在线话题的时间行为。建模主题动态:我们考虑社区的规模作为在线流行动态的代理。我们发现,收益和损失的分布,以及事件间时间是肥尾的,表明标签的使用偶尔发生,但大而突然的变化。受典型网站设计的启发,我们提出了一个随机模型,该模型结合了与时间相关的声望分数的排名。这导致了偶尔级联的等级转移事件,并以良好的一致性再现了观察结果。这为观察到的动态提供了一种基于网络媒体特征元素的解释。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Tracking online topics over time: understanding dynamic hashtag communities.

Tracking online topics over time: understanding dynamic hashtag communities.

Tracking online topics over time: understanding dynamic hashtag communities.

Tracking online topics over time: understanding dynamic hashtag communities.

Background: Hashtags are widely used for communication in online media. As a condensed version of information, they characterize topics and discussions. For their analysis, we apply methods from network science and propose novel tools for tracing their dynamics in time-dependent data. The observations are characterized by bursty behaviors in the increases and decreases of hashtag usage. These features can be reproduced with a novel model of dynamic rankings.

Hashtag communities in time: We build temporal and weighted co-occurrence networks from hashtags. On static snapshots, we infer the community structure using customized methods. On temporal networks, we solve the bipartite matching problem of detected communities at subsequent timesteps by taking into account higher-order memory. This results in a matching protocol that is robust toward temporal fluctuations and instabilities of the static community detection. The proposed methodology is broadly applicable and its outcomes reveal the temporal behavior of online topics.

Modeling topic-dynamics: We consider the size of the communities in time as a proxy for online popularity dynamics. We find that the distributions of gains and losses, as well as the interevent times are fat-tailed indicating occasional, but large and sudden changes in the usage of hashtags. Inspired by typical website designs, we propose a stochastic model that incorporates a ranking with respect to a time-dependent prestige score. This causes occasional cascades of rank shift events and reproduces the observations with good agreement. This offers an explanation for the observed dynamics, based on characteristic elements of online media.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:481959085
Book学术官方微信