Recommendation based on co-similarity and spanning tree with minimum weight

O. Baida, N. Hamzaoui, A. Sedqui, A. Lyhyaoui
{"title":"Recommendation based on co-similarity and spanning tree with minimum weight","authors":"O. Baida, N. Hamzaoui, A. Sedqui, A. Lyhyaoui","doi":"10.1109/INTECH.2012.6457807","DOIUrl":null,"url":null,"abstract":"Recommender system is a system that helps users find interesting items. Actually, collaborative filtering technology is one of the most successful techniques in recommender system. In this article we propose a new approach based on the rating of the users that is similar to the active one. In the literature, we find a lot of approaches able to recommend items to the user. Aiming to offer a list of interesting items, we use a hybrid approach of collaborative filtering that performs better than others. Our collaborative filtering approach is based on the graph theory, so we use the dissimilarity matrix as a spanning tree with minimum weight based on Kruskal algorithm. We define a group of criteria that help to determine the best items to recommend without computing the rating prediction.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTECH.2012.6457807","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Recommender system is a system that helps users find interesting items. Actually, collaborative filtering technology is one of the most successful techniques in recommender system. In this article we propose a new approach based on the rating of the users that is similar to the active one. In the literature, we find a lot of approaches able to recommend items to the user. Aiming to offer a list of interesting items, we use a hybrid approach of collaborative filtering that performs better than others. Our collaborative filtering approach is based on the graph theory, so we use the dissimilarity matrix as a spanning tree with minimum weight based on Kruskal algorithm. We define a group of criteria that help to determine the best items to recommend without computing the rating prediction.
基于共相似度和最小权值生成树的推荐
推荐系统是一个帮助用户找到感兴趣的项目的系统。实际上,协同过滤技术是推荐系统中最成功的技术之一。在本文中,我们提出了一种基于与活跃用户相似的用户评级的新方法。在文献中,我们发现了很多能够向用户推荐商品的方法。为了提供一个有趣的项目列表,我们使用了一种混合的协同过滤方法,它的性能比其他方法要好。我们的协同过滤方法是基于图论的,因此我们使用基于Kruskal算法的不相似矩阵作为最小权值的生成树。我们定义了一组标准来帮助确定推荐的最佳项目,而不需要计算评级预测。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信