{"title":"A Graph-Based Recommender System for Food Products","authors":"Arpita Mathur, Sai Kumar Juguru, M. Eirinaki","doi":"10.1109/GC46384.2019.00020","DOIUrl":null,"url":null,"abstract":"In this paper we present a graph-based recommender system that is not relying on explicit item ratings to generate recommendations. Instead, it employs neighborhood-based and graph mining techniques to generate item profiles using their reviews' text. The proposed algorithm uses user review feedback to find products related to each other and tries to find a balance between similar products and highly popular products. It achieves this balance by ranking the products based on the similarity to the target product as well as its connectivity among similar products. The algorithm breaks the entire dataset into subgroups of similar products, which makes the proposed algorithm scalable as well. We present a proof-of-concept implementation of the proposed algorithm in the food product domain and present some preliminary results.","PeriodicalId":129268,"journal":{"name":"2019 First International Conference on Graph Computing (GC)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 First International Conference on Graph Computing (GC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GC46384.2019.00020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper we present a graph-based recommender system that is not relying on explicit item ratings to generate recommendations. Instead, it employs neighborhood-based and graph mining techniques to generate item profiles using their reviews' text. The proposed algorithm uses user review feedback to find products related to each other and tries to find a balance between similar products and highly popular products. It achieves this balance by ranking the products based on the similarity to the target product as well as its connectivity among similar products. The algorithm breaks the entire dataset into subgroups of similar products, which makes the proposed algorithm scalable as well. We present a proof-of-concept implementation of the proposed algorithm in the food product domain and present some preliminary results.