Characterizing and curating conversation threads: expansion, focus, volume, re-entry

L. Backstrom, J. Kleinberg, Lillian Lee, Cristian Danescu-Niculescu-Mizil
{"title":"Characterizing and curating conversation threads: expansion, focus, volume, re-entry","authors":"L. Backstrom, J. Kleinberg, Lillian Lee, Cristian Danescu-Niculescu-Mizil","doi":"10.1145/2433396.2433401","DOIUrl":null,"url":null,"abstract":"Discussion threads form a central part of the experience on many Web sites, including social networking sites such as Facebook and Google Plus and knowledge creation sites such as Wikipedia. To help users manage the challenge of allocating their attention among the discussions that are relevant to them, there has been a growing need for the algorithmic curation of on-line conversations --- the development of automated methods to select a subset of discussions to present to a user.\r\n\r\nHere we consider two key sub-problems inherent in conversational curation: length prediction --- predicting the number of comments a discussion thread will receive --- and the novel task of re-entry prediction --- predicting whether a user who has participated in a thread will later contribute another comment to it. The first of these sub-problems arises in estimating how interesting a thread is, in the sense of generating a lot of conversation; the second can help determine whether users should be kept notified of the progress of a thread to which they have already contributed. We develop and evaluate a range of approaches for these tasks, based on an analysis of the network structure and arrival pattern among the participants, as well as a novel dichotomy in the structure of long threads. We find that for both tasks, learning-based approaches using these sources of information.","PeriodicalId":123187,"journal":{"name":"WSDM '13: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"107","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"WSDM '13: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2433396.2433401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 107

Abstract

Discussion threads form a central part of the experience on many Web sites, including social networking sites such as Facebook and Google Plus and knowledge creation sites such as Wikipedia. To help users manage the challenge of allocating their attention among the discussions that are relevant to them, there has been a growing need for the algorithmic curation of on-line conversations --- the development of automated methods to select a subset of discussions to present to a user. Here we consider two key sub-problems inherent in conversational curation: length prediction --- predicting the number of comments a discussion thread will receive --- and the novel task of re-entry prediction --- predicting whether a user who has participated in a thread will later contribute another comment to it. The first of these sub-problems arises in estimating how interesting a thread is, in the sense of generating a lot of conversation; the second can help determine whether users should be kept notified of the progress of a thread to which they have already contributed. We develop and evaluate a range of approaches for these tasks, based on an analysis of the network structure and arrival pattern among the participants, as well as a novel dichotomy in the structure of long threads. We find that for both tasks, learning-based approaches using these sources of information.
描述和管理对话线索:扩展、焦点、数量、重新进入
在许多网站上,讨论话题是用户体验的核心部分,包括Facebook和Google Plus等社交网站,以及维基百科等知识创造网站。为了帮助用户管理在与他们相关的讨论中分配注意力的挑战,对在线对话的算法管理的需求越来越大——开发自动方法来选择讨论的子集呈现给用户。在这里,我们考虑了会话管理中固有的两个关键子问题:长度预测——预测一个讨论线程将收到的评论数量——以及重新进入预测的新任务——预测曾经参与过某个线程的用户是否会在以后再发表评论。第一个子问题出现在评估一个线程的有趣程度上,即产生大量的对话;第二种方法可以帮助确定是否应该将用户已经贡献的线程的进度通知用户。基于对网络结构和参与者的到达模式的分析,以及长线程结构的新二分法,我们开发和评估了一系列用于这些任务的方法。我们发现,对于这两项任务,基于学习的方法使用这些信息源。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信