Characterizing and curating conversation threads: Expansion, focus, volume, re-entry
|Characterizing and curating conversation threads: Expansion, focus, volume, re-entry|
|Author(s)||Backstrom L., Kleinberg J., Lee L., Danescu-Niculescu-Mizil C.|
|Published in||WSDM 2013 - Proceedings of the 6th ACM International Conference on Web Search and Data Mining|
|Keyword(s)||comment threads, conversations, facebook, feed ranking, likes, on-line communities, recommendation, social networks, user-generated content, wikipedia (Extra: comment threads, conversations, Facebook, feed ranking, likes, On-line communities, recommendation, Social Networks, User-generated content, Wikipedia, Data mining, Forecasting, Information retrieval, World Wide Web, Social networking (online))|
|Article||BASE, CiteSeerX, Google Scholar|
|Web||Ask, Bing, Google (PDF), Yahoo!|
|Download and mirrors|
|Local copy||Not available|
|Remote mirror(s)||Not available|
|Export and share|
|BibTeX, CSV, RDF, JSON|
|Browse properties · List of conference papers|
Characterizing and curating conversation threads: Expansion, focus, volume, re-entry is a 2013 conference paper written in English by Backstrom L., Kleinberg J., Lee L., Danescu-Niculescu-Mizil C. and published in WSDM 2013 - Proceedings of the 6th ACM International Conference on Web Search and Data Mining.
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.
- This section requires expansion. Please, help!
Probably, this publication is cited by others, but there are no articles available for them in WikiPapers. Cited 2 time(s)