论文标题
使用关联规则加速推荐系统
Speeding Up Recommender Systems Using Association Rules
论文作者
论文摘要
推荐系统被认为是人工智能发展最快的分支之一。寻找更有效的技术来生成建议的需求变得紧急。但是,如果延迟生成并将其显示给用户,许多建议将变得无用。因此,我们专注于提高推荐系统的速度,而不会影响准确性。在本文中,我们建议一种基于分解机和关联规则(FMAR)的新型推荐系统。我们介绍了一种使用两种算法生成关联规则的方法:(i)Apriori和(ii)频繁的模式(FP)生长。这些关联规则将用于减少传递给分解机建议模型的项目数量。我们表明,FMAR已大大减少了推荐系统必须预测的新项目数量,因此减少了生成建议所需的时间。另一方面,在构建FMAR工具时,我们专注于在预测时间和生成建议的准确性之间保持平衡,以确保与没有关联规则的分数计算机的准确性相比,准确性不会显着影响。
Recommender systems are considered one of the most rapidly growing branches of Artificial Intelligence. The demand for finding more efficient techniques to generate recommendations becomes urgent. However, many recommendations become useless if there is a delay in generating and showing them to the user. Therefore, we focus on improving the speed of recommendation systems without impacting the accuracy. In this paper, we suggest a novel recommender system based on Factorization Machines and Association Rules (FMAR). We introduce an approach to generate association rules using two algorithms: (i) apriori and (ii) frequent pattern (FP) growth. These association rules will be utilized to reduce the number of items passed to the factorization machines recommendation model. We show that FMAR has significantly decreased the number of new items that the recommender system has to predict and hence, decreased the required time for generating the recommendations. On the other hand, while building the FMAR tool, we concentrate on making a balance between prediction time and accuracy of generated recommendations to ensure that the accuracy is not significantly impacted compared to the accuracy of using factorization machines without association rules.