Tag-based top-N recommendation using a pairwise topic model

Zhengyang Li, Congfu Xu
{"title":"Tag-based top-N recommendation using a pairwise topic model","authors":"Zhengyang Li, Congfu Xu","doi":"10.1109/IRI.2013.6642450","DOIUrl":null,"url":null,"abstract":"Tagging systems enable users to organise their online entities with distinct tags. Exploiting these user generated content and underlying bilingual information have become more and more important in recommendation system. Probabilistic topic model has been widely used in document management and social network mining. In this paper, we propose a new method to do tag-based recommendation with topic model. Some existing methods are based on mining association rules and similarity measures. In these cases, tags serve as the essential intermediates for statistical computation, but they have the drawbacks that results are sensitive to parameter setup. Even though they are popular in some real application situations, they are simply lack of scalability as the computational procedure differs over distinguished platforms. It's natural to take tags as words, from which topics can be effectively extracted by using topic model. Under the assumption of the generating process in topic model, user's topic distribution parameter implies his or her topic preference. Recommendation results are obtained according to the final probability calculated by summing over topics. Our experiments show that the proposed model is effective to do both tags and items recommendation on two sparse datasets.","PeriodicalId":418492,"journal":{"name":"2013 IEEE 14th International Conference on Information Reuse & Integration (IRI)","volume":"37 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 14th International Conference on Information Reuse & Integration (IRI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRI.2013.6642450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Tagging systems enable users to organise their online entities with distinct tags. Exploiting these user generated content and underlying bilingual information have become more and more important in recommendation system. Probabilistic topic model has been widely used in document management and social network mining. In this paper, we propose a new method to do tag-based recommendation with topic model. Some existing methods are based on mining association rules and similarity measures. In these cases, tags serve as the essential intermediates for statistical computation, but they have the drawbacks that results are sensitive to parameter setup. Even though they are popular in some real application situations, they are simply lack of scalability as the computational procedure differs over distinguished platforms. It's natural to take tags as words, from which topics can be effectively extracted by using topic model. Under the assumption of the generating process in topic model, user's topic distribution parameter implies his or her topic preference. Recommendation results are obtained according to the final probability calculated by summing over topics. Our experiments show that the proposed model is effective to do both tags and items recommendation on two sparse datasets.
使用成对主题模型的基于标签的top-N推荐
标签系统使用户能够用不同的标签组织他们的在线实体。利用这些用户生成的内容和潜在的双语信息在推荐系统中变得越来越重要。概率主题模型在文档管理和社交网络挖掘中得到了广泛的应用。本文提出了一种基于主题模型的标签推荐方法。现有的一些方法是基于挖掘关联规则和相似度量。在这些情况下,标签作为统计计算的基本中间物,但它们的缺点是结果对参数设置很敏感。尽管它们在一些实际应用程序中很流行,但由于计算过程在不同的平台上不同,它们缺乏可伸缩性。将标签作为词是很自然的,使用主题模型可以有效地从中提取主题。在主题模型生成过程的假设下,用户的主题分布参数反映了用户的主题偏好。推荐结果根据主题求和计算的最终概率得到。实验表明,该模型可以有效地在两个稀疏数据集上进行标签推荐和项目推荐。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信