首页> 外文会议>International Conference on Engineering, Technology, and Industrial Application >Merging Pearson Correlation and TAN-ELR algorithm in recommender system
【24h】

Merging Pearson Correlation and TAN-ELR algorithm in recommender system

机译:在推荐系统中合并Pearson相关和Tan-Elr算法

获取原文

摘要

The selection of lecturers in a university is done every semester. In general, the selection process has a high degree of subjectivity, considering the selection of a lecturer for a particular course is made based on decision maker sourced from the history of the course and the request of the concerned lecturer. With the recommender system, the selection of lecturer for teaching certain courses can be done systematically without any subjectivity. Recommender system is a system which able to provide a recommendation to the user on several items, such as music, videos, movies, books, and so on. There are several algorithms with low error rate and high degree of accuracy to be implemented in the recommender system, such as Pearson Correlation and TAN-ELR algorithm. However, Pearson Correlation as memory-based collaborative filtering has a lack of sparsity data while TAN-ELR as model-based collaborative filtering has a deficiency in terms of scalability. To overcome the lack of sparsity in Pearson Correlation and scalability in TAN-ELR, merging these two algorithms is done by hybrid collaborative filtering method. It is done by weighting each algorithm using Joint Mixture Voter method. For testin the method, Mean Absolute Error (MAE) is calculated to estimate the accuracy of the built recommender system. The results show the larger the amount of training data, the lower the MAE value of the Pearson Correlation algorithm and the higher the MAE value of the TAN-ELR algorithm. In addition, the smaller the amount of training data, the best weights given by the merging algorithm is 0% for Pearson Correlation and 100% for TAN-ELR. Meanwhile, the greater the training data, the best weighting on combining algorithms is 100% for Pearson Correlation and 0% for TAN ELR. Merging Pearson Correlation algorithm and TAN-ELR algorithm with Joint Mixture Voter yields the smallest MAE values depending on the percentage of each algorithm.
机译:每学期都完成了大学讲师。通常,考虑到特定课程的选择是基于来自课程历史的决策者和有关讲师的要求,考虑到特定课程的选择,选择过程具有高度的主体性。通过推荐系统,可以在没有任何主观性的情况下系统地完成用于教学某些课程的讲师的选择。推荐系统是一个能够在几个项目上向用户提供建议的系统,例如音乐,视频,电影,书籍等。在推荐系统中实现有几种具有较低差错率和高精度的算法,例如Pearson相关性和Tan-Elr算法。然而,Pearson相关性作为基于内存的协作滤波的相关性缺乏稀疏数据,而TAN-ELR作为基于模型的协作滤波的缺乏性缺乏可扩展性。为了克服Pearson相关性和Tan-Elr中的可扩展性缺乏稀疏性,通过混合协同过滤方法合并这两种算法。通过使用关节混合物选民方法加权每种算法来完成。对于该方法,计算平均绝对误差(MAE)以估计内置推荐系统的准确性。结果表明,培训数据量越大,Pearson相关算法的MAE值越低,Tan-Elr算法的MAE值越高。此外,培训数据量越小,合并算法给出的最佳重量为Pearson相关的0%,而Tan-Elr为100%。同时,培训数据越大,合并算法上的最佳加权为Pearson相关性为100%,棕褐色的相关性为0%。合并Pearson相关算法和Tan-Elr算法与关节混合物选民产生最小的MAE值,具体取决于每种算法的百分比。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号