{"title":"Recommendation system to simplify opinion formation","authors":"R. Vignesh, Kumar Rishabh","doi":"10.1109/ICDMAI.2017.8073475","DOIUrl":null,"url":null,"abstract":"This paper aims at introducing a new way of recommending movies to users. It is an improvement on the existing approaches of Content Based Recommendation system and Collaborative Filtering. Creating similar feature vectors for both the users and movies, we update it with every passing recommendation made. We then find out the nearest user by calculating the difference in the feature using root mean square error technique. We finally draw out a conclusion and observe the cases where this outperforms other popular algorithms. We also look at its shortcomings and list the scope for future improvements that could be made.","PeriodicalId":368507,"journal":{"name":"2017 International Conference on Data Management, Analytics and Innovation (ICDMAI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Data Management, Analytics and Innovation (ICDMAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMAI.2017.8073475","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper aims at introducing a new way of recommending movies to users. It is an improvement on the existing approaches of Content Based Recommendation system and Collaborative Filtering. Creating similar feature vectors for both the users and movies, we update it with every passing recommendation made. We then find out the nearest user by calculating the difference in the feature using root mean square error technique. We finally draw out a conclusion and observe the cases where this outperforms other popular algorithms. We also look at its shortcomings and list the scope for future improvements that could be made.