Exploring a Topical Representation of Documents for Recommendation Systems

Israel Mendonça, Antoine Trouvé, Akira Fukuda, K. Murakami
{"title":"Exploring a Topical Representation of Documents for Recommendation Systems","authors":"Israel Mendonça, Antoine Trouvé, Akira Fukuda, K. Murakami","doi":"10.1109/ICAWST.2018.8517192","DOIUrl":null,"url":null,"abstract":"In this paper, we address the performance problems inherited when we use word embedding for recommendation. Free-text documents has no structural constructing rules, and are hard to model. Hence, the problem of having an accurate model, that conveys all the important information is a nontrivial problem. We convert the document to a numeric structure using word-embedding and test two document representations: one based in the center of this numeric representation and the other one based on pre-defined set of topics. We build a free text recommendation system and study how the performance, in terms of precision and recommendation time, is affected by both representations. We then vary the number of topics used to represent documents and verify the tradeoffs inherited from having a compact representation. The more compact the recommendation, the shorter the recommendation time, however more information is lost in the compactation process. We empirically test different possibilities for the topics and find an optimal point that is 3 times faster than a baseline and almost as accurate as it.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 9th International Conference on Awareness Science and Technology (iCAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAWST.2018.8517192","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we address the performance problems inherited when we use word embedding for recommendation. Free-text documents has no structural constructing rules, and are hard to model. Hence, the problem of having an accurate model, that conveys all the important information is a nontrivial problem. We convert the document to a numeric structure using word-embedding and test two document representations: one based in the center of this numeric representation and the other one based on pre-defined set of topics. We build a free text recommendation system and study how the performance, in terms of precision and recommendation time, is affected by both representations. We then vary the number of topics used to represent documents and verify the tradeoffs inherited from having a compact representation. The more compact the recommendation, the shorter the recommendation time, however more information is lost in the compactation process. We empirically test different possibilities for the topics and find an optimal point that is 3 times faster than a baseline and almost as accurate as it.
探索用于推荐系统的文档主题表示
在本文中,我们解决了使用词嵌入进行推荐时遗留的性能问题。自由文本文档没有结构化的构造规则,很难建模。因此,拥有一个准确的模型,传达所有重要信息的问题是一个非常重要的问题。我们使用词嵌入将文档转换为数字结构,并测试两种文档表示:一种基于该数字表示的中心,另一种基于预定义的主题集。我们构建了一个自由文本推荐系统,并研究了这两种表示对推荐精度和推荐时间的影响。然后,我们改变用于表示文档的主题的数量,并验证从紧凑表示继承的权衡。推荐越紧凑,推荐时间越短,但在压缩过程中丢失的信息越多。我们根据经验测试了主题的不同可能性,并找到了一个比基线快3倍且几乎与基线一样准确的最佳点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信