Learning the Structures of Online Asynchronous Conversations

被引:12
作者
Chen, Jun [1 ]
Wang, Chaokun [1 ]
Lin, Heran [1 ]
Wang, Weiping [2 ]
Cai, Zhipeng [3 ]
Wang, Jianmin [1 ]
机构
[1] Tsinghua Univ, Sch Software, Beijing 100084, Peoples R China
[2] Chinese Acad Sci, Inst Informat Engn, Beijing 100093, Peoples R China
[3] Georgia State Univ, Dept Comp Sci, Atlanta, GA 30302 USA
来源
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2017), PT I | 2017年 / 10177卷
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Asynchronous conversations; Conversation structure; Reply-to" relation; ALGORITHMS;
D O I
10.1007/978-3-319-55753-3_2
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The online social networks have embraced huge success from the crowds in the last two decades. Now, more and more people get used to chat with friends online via instant messaging applications on personal computers or mobile devices. Since these conversations are sequentially organized, which fails to show the logical relations between messages, they are called asynchronous conversations in previous studies. Unfortunately, the sequential layouts of messages are usually not intuitive to see how the conversation evolves as time elapses. In this paper, we propose to learn the structures of online asynchronous conversations by predicting the "reply-to" relation between messages based on text similarity and latent semantic transferability. A heuristic method is also brought forward to predict the relation, and then recover the conversation structure. We demonstrate the effectiveness of the proposed method through experiments on a real-world web forum comment data set.
引用
收藏
页码:19 / 34
页数:16
相关论文
共 28 条
  • [1] [Anonymous], 2013, Proceedings of the 22nd international conference on World Wide Web
  • [2] [Anonymous], 2010, P 16 ACM SIGKDD INT, DOI DOI 10.1145/1835804.1835875
  • [3] [Anonymous], 1974, SOLVING LEAST SQUARE
  • [4] [Anonymous], 2010, P 2010 43 HAWAII INT, DOI DOI 10.1353/JSM.2016.0009
  • [5] Latent Dirichlet allocation
    Blei, DM
    Ng, AY
    Jordan, MI
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) : 993 - 1022
  • [6] Chen J, 2015, AAAI CONF ARTIF INTE, P16
  • [7] Dou Shen, 2006, Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, P35, DOI 10.1145/1148170.1148180
  • [8] OPTIMUM BRANCHINGS
    EDMONDS, J
    [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04): : 233 - +
  • [9] Elsner M., 2008, ACL 2008 P 46 ANN M, P834
  • [10] Disentangling Chat
    Elsner, Micha
    Charniak, Eugene
    [J]. COMPUTATIONAL LINGUISTICS, 2010, 36 (03) : 389 - 409