Recommender Systems Using Category Correlations Based on WordNet Similarity

Sang-Min Choi, Da-Jung Cho, Yo-Sub Han, K. L. Man, Y. Sun
{"title":"Recommender Systems Using Category Correlations Based on WordNet Similarity","authors":"Sang-Min Choi, Da-Jung Cho, Yo-Sub Han, K. L. Man, Y. Sun","doi":"10.1109/PLATCON.2015.26","DOIUrl":null,"url":null,"abstract":"Recently, many internet users are not only information consumers but also information providers. There is lots of information on the Web and most people can search information what they want through the Web. One problem of the large number of data in the Web is that we often spend most of our time to find a correct result from search results. Thus, people start looking for a better system that can suggest relevant information instead of letting users go through all search results: We call such systems recommendation systems. Conventional recommendation systems are based on collaborative filtering (CF) approaches. The CF approaches have two problems: sparsity and cold-start. Some researchers have studied to alleviate the problems in CF approaches. One of them is the recommendation algorithm based on category correlations. In this study, researchers utilize genre information in movie domain as category. They have drawn genre correlations using genre counting method. This approach can alleviate the user-side cold-start problems, however, there exists one problem that extensions of the approach are less likely. If a domain has singular category, then we cannot apply previous approaches. It means that we cannot draw category correlations. Because of this reason, we propose a novel approach that can draw category correlations for not only multiple categories but also singular one. We utilize word similarities provided by WordNet.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Platform Technology and Service","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PLATCON.2015.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Recently, many internet users are not only information consumers but also information providers. There is lots of information on the Web and most people can search information what they want through the Web. One problem of the large number of data in the Web is that we often spend most of our time to find a correct result from search results. Thus, people start looking for a better system that can suggest relevant information instead of letting users go through all search results: We call such systems recommendation systems. Conventional recommendation systems are based on collaborative filtering (CF) approaches. The CF approaches have two problems: sparsity and cold-start. Some researchers have studied to alleviate the problems in CF approaches. One of them is the recommendation algorithm based on category correlations. In this study, researchers utilize genre information in movie domain as category. They have drawn genre correlations using genre counting method. This approach can alleviate the user-side cold-start problems, however, there exists one problem that extensions of the approach are less likely. If a domain has singular category, then we cannot apply previous approaches. It means that we cannot draw category correlations. Because of this reason, we propose a novel approach that can draw category correlations for not only multiple categories but also singular one. We utilize word similarities provided by WordNet.
基于WordNet相似度的分类相关性推荐系统
近年来,许多互联网用户既是信息消费者,也是信息提供者。网络上有大量的信息,大多数人可以通过网络搜索他们想要的信息。Web中大量数据的一个问题是,我们经常花费大部分时间从搜索结果中找到正确的结果。因此,人们开始寻找一个更好的系统,可以建议相关的信息,而不是让用户浏览所有的搜索结果:我们称这样的系统为推荐系统。传统的推荐系统是基于协同过滤(CF)方法的。CF方法有两个问题:稀疏性和冷启动。一些研究者已经开始研究如何缓解CF方法中存在的问题。其中之一是基于类别相关性的推荐算法。在本研究中,研究者利用电影领域的类型信息作为分类。他们使用类型计数法绘制了类型相关性。这种方法可以缓解用户端冷启动问题,但是,存在一个问题,该方法的扩展不太可能。如果一个领域具有奇异范畴,那么我们就不能应用以前的方法。这意味着我们无法绘制类别相关性。因此,我们提出了一种新的方法,既可以绘制多个类别的类别相关性,也可以绘制单个类别的类别相关性。我们利用WordNet提供的单词相似度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信