What's Happening and What Happened: Searching the Social Web

Omar Alonso, Vasileios Kandylas, S. Tremblay, J. Hofman, S. Sen
{"title":"What's Happening and What Happened: Searching the Social Web","authors":"Omar Alonso, Vasileios Kandylas, S. Tremblay, J. Hofman, S. Sen","doi":"10.1145/3091478.3091484","DOIUrl":null,"url":null,"abstract":"Every day millions of users share links and post comments on different social networks. At scale, this behavior can be very useful for building a new type of search engine that exploits relevant links and their associated metadata in a temporal fashion. Our goal is to find links that are relevant on social networks as a mechanism to discover what people are talking about at a given point in time and make such information searchable and persistent. In other words, a continually updated archive of relevant content that is currently being shared, beyond the obvious trending news of the day. The techniques we use surface new and interesting content by mining social network posts that contain links, constructing diffusion trees from those links, and extracting related entities and other associated metadata. By looking at the size of the trees and their structure in combination with the conversation around each link and related topics, we designed and implemented a search engine that provides relevant fresh content and features a \"wayback machine''. We demonstrate the effectiveness of our approach by processing a dataset comprising millions of English language tweets generated over a one year period. Finally, we perform an offline evaluation of our techniques and conduct a use case study using an available data set of fake and real news links.","PeriodicalId":165747,"journal":{"name":"Proceedings of the 2017 ACM on Web Science Conference","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 ACM on Web Science Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3091478.3091484","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Every day millions of users share links and post comments on different social networks. At scale, this behavior can be very useful for building a new type of search engine that exploits relevant links and their associated metadata in a temporal fashion. Our goal is to find links that are relevant on social networks as a mechanism to discover what people are talking about at a given point in time and make such information searchable and persistent. In other words, a continually updated archive of relevant content that is currently being shared, beyond the obvious trending news of the day. The techniques we use surface new and interesting content by mining social network posts that contain links, constructing diffusion trees from those links, and extracting related entities and other associated metadata. By looking at the size of the trees and their structure in combination with the conversation around each link and related topics, we designed and implemented a search engine that provides relevant fresh content and features a "wayback machine''. We demonstrate the effectiveness of our approach by processing a dataset comprising millions of English language tweets generated over a one year period. Finally, we perform an offline evaluation of our techniques and conduct a use case study using an available data set of fake and real news links.
正在发生的事情和已经发生的事情:搜索社交网络
每天都有数百万用户在不同的社交网络上分享链接和发表评论。在一定规模上,这种行为对于构建一种新型搜索引擎非常有用,这种搜索引擎以一种临时的方式利用相关链接及其相关元数据。我们的目标是找到与社交网络相关的链接,作为一种机制来发现人们在特定时间点谈论的内容,并使这些信息可搜索和持久。换句话说,就是不断更新的相关内容的存档,这些内容目前正在被分享,而不是当天明显的趋势新闻。我们使用的技术通过挖掘包含链接的社交网络帖子,从这些链接中构建扩散树,提取相关实体和其他相关元数据来呈现新的有趣内容。通过观察树的大小和它们的结构,结合每个链接和相关主题的对话,我们设计并实现了一个搜索引擎,提供相关的新鲜内容和功能的“时光机”。我们通过处理包含一年内生成的数百万条英语推文的数据集来证明我们方法的有效性。最后,我们对我们的技术进行离线评估,并使用假新闻链接和真实新闻链接的可用数据集进行用例研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信