Leveraging User Interest to Improve Thread Recommendation in Online Forum

Xuning Tang, Mi Zhang, Christopher C. Yang
{"title":"Leveraging User Interest to Improve Thread Recommendation in Online Forum","authors":"Xuning Tang, Mi Zhang, Christopher C. Yang","doi":"10.1109/SOCIETY.2013.13","DOIUrl":null,"url":null,"abstract":"Nowadays thread recommendation is considered to be beneficial to improve the end-user stickiness of an online forum. Given the fact of information overload and the diverse interests of forum users, a recommender system in online forum can satisfy not only forum users' information needs by directing them to what they might be interested in, but also their social needs by connecting them to their friends. Some traditional recommender systems rely on a bipartite graph model to capture users' interests. As an extension, some other content-based methods are proposed to further understand the potential connections between Web users and Web contents. However, due to the prevalence of short and sparse messages in online social media, it is hard for traditional content-based methods to capture Web users' interests. In this paper, we propose a novel graphical model to extract hidden topics from Web contents, cluster Web contents into clusters, and detect users' interests on each cluster. Then we introduce two reran king models which utilize the detected user interest to boost the performance of thread recommendation. Experiment results on a public dataset showed that our proposed methods substantially outperformed the naïve content-based approach. In addition, by testing our approaches with different parameter settings, we observed, to some extent, how forum users' information needs and their social needs interplay to decide which threads they will look for.","PeriodicalId":348108,"journal":{"name":"2013 International Conference on Social Intelligence and Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Social Intelligence and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCIETY.2013.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Nowadays thread recommendation is considered to be beneficial to improve the end-user stickiness of an online forum. Given the fact of information overload and the diverse interests of forum users, a recommender system in online forum can satisfy not only forum users' information needs by directing them to what they might be interested in, but also their social needs by connecting them to their friends. Some traditional recommender systems rely on a bipartite graph model to capture users' interests. As an extension, some other content-based methods are proposed to further understand the potential connections between Web users and Web contents. However, due to the prevalence of short and sparse messages in online social media, it is hard for traditional content-based methods to capture Web users' interests. In this paper, we propose a novel graphical model to extract hidden topics from Web contents, cluster Web contents into clusters, and detect users' interests on each cluster. Then we introduce two reran king models which utilize the detected user interest to boost the performance of thread recommendation. Experiment results on a public dataset showed that our proposed methods substantially outperformed the naïve content-based approach. In addition, by testing our approaches with different parameter settings, we observed, to some extent, how forum users' information needs and their social needs interplay to decide which threads they will look for.
利用用户兴趣改进在线论坛的主题推荐
目前,在线论坛的主题推荐被认为是提高最终用户粘性的重要手段。考虑到信息过载和论坛用户兴趣的多样性,在线论坛的推荐系统不仅可以满足论坛用户的信息需求,将他们引导到他们可能感兴趣的东西上,还可以满足他们的社交需求,将他们与朋友联系起来。一些传统的推荐系统依赖于一个二分图模型来捕捉用户的兴趣。作为扩展,提出了其他一些基于内容的方法来进一步理解Web用户和Web内容之间的潜在连接。然而,由于在线社交媒体中消息短而稀疏,传统的基于内容的方法很难捕捉到Web用户的兴趣。在本文中,我们提出了一种新的图形模型来从Web内容中提取隐藏主题,将Web内容聚类,并在每个聚类上检测用户的兴趣。然后,我们引入了两个reran king模型,它们利用检测到的用户兴趣来提高线程推荐的性能。在公共数据集上的实验结果表明,我们提出的方法实质上优于naïve基于内容的方法。此外,通过对我们的方法进行不同参数设置的测试,我们在一定程度上观察了论坛用户的信息需求和社交需求如何相互作用来决定他们将寻找哪些主题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信