1. 南京工业大学 机构 计算机科学与技术学院,江苏,南京,211816
2. 淮阴工学院 机构 计算机与软件工程系,江苏,淮安,223003
纸质出版:2018
移动端阅览
赵阳, 朱全银, 胡荣林, 瞿学新. 基于自编码机和聚类的混合推荐算法[J]. 微电子学与计算机, 2018, 35(11): 52-56.
ZHAO Yang, ZHU Quan-Yin, HU Rong-Lin, et al. Hybrid Recommendation Algorithm Based on Autoencoder and Clustering[J]. 2018, 35(11): 52-56.
针对传统的协同过滤推荐算法在稀疏数据集上表现不佳的情况
提出了一种将自编码机(Autoencoder)和聚类结合的混合推荐算法.首先将用户项目评分数据和用户人口统计学数据作为自编码机的输入
提取用户特征.然后利用提取到的用户特征对用户聚类得到用户类别
从而使近邻搜索范围减小.接着通过计算平均绝对误差(MAE)寻找到适用于同一类别用户的推荐算法
最后组合各类别上适用的推荐算法
得到混合推荐模型.推荐阶段
计算目标用户类别
并使用混合推荐模型得到推荐结果.实验结果表明
该算法可以有效的提高推荐质量。
With the problem that traditional collaborative filtering recommendation algorithm does not recommend high quality on sparse data sets
a hybrid recommendation algorithm that based on autoencoder and clustering is proposed. First
the users project rating data and user demographic data as the input data from the autoencoder to extract user characteristics. Then use the extracted user characteristics to cluster the users to obtain the user categories
so that the search range of the neighbor decreases. Then search for a recommendation algorithm for the same type of users by calculating mean absolute error (MAE)
and get a hybrid recommendation model. Finally calculate the target user category and use the hybrid recommendation model to get the recommended results. Experimental results show that this algorithm can effectively improve the quality of recommendation.
Shang S, Hui Y, Hui P, et al. Privacy preserving recommendation system based on groups[J]. Computer Science, 2013(129): 407-409. DOI: 407
Li X, She J. Collaborative variational autoencoder for recommender systems[C]// The ACM SIGKDD International Conference. Nova Scotia, Canada, ACM, 2017: 305-314.
Resnick P, Iacovou N, Suchak M, et al. Group Lens: an open architecture for collaborative filtering of netnews[C]// ACM Conference on Computer Supported Cooperative Work. Chapel Hill, NC, USA, ACM, 1994: 175-186.
Breese John S, Heckerman, David Kadie Carl. Empirical analysis of predictive algorithms for collaborative filtering[J]. Uncertainty in Artificial Intelligence, 2013, 98 (7): 43-52. DOI: 43
David Arthur, Sergei Vassilvitskii. K-Means++: the advantages of careful seeding[J]. Society for Industrial and Applied Mathematics, 2007, 11(6):1027-1035. DOI: 1027
Hu R, Dou W, Liu J. ClubCF: a clustering-based collaborative filtering approach for big data application[J]. Emerging Topics in Computing IEEE Transactions on, 2014, 2(3):302-313. DOI: 302
林建辉, 严宣辉, 黄波.基于SVD与模糊聚类的协同过滤推荐算法[J].计算机系统应用, 2016, 25(11):156-163. DOI: 156
Shang M S, Lü L, Zeng W, et al. Relevance is more significant than correlation: Information filtering on sparse data[J]. Europhysics Letters, 2010, 88(6): 68008-68012. DOI: 68008
Wen J, Zhou W. An improved item-based collaborative filtering algorithm based on clustering method[J]. Journal of Computational Information Systems, 2012, 8(2):571-578. DOI: 571
朱郁筱, 吕琳媛.推荐系统评价指标综述[J].电子科技大学学报, 2012, 41(2):163-175. DOI: 163
朱东郡, 李敬兆, 谭大禹, 等.基于标签聚类和兴趣划分的协同过滤推荐算法[J].计算机工程, 2017, 43 (11) :146-151. DOI: 146
王志虎, 黄曼莹.基于用户历史行为的协同过滤推荐算法[J].微电子学与计算机, 2017, 34(5):132-136. DOI: 132
0
浏览量
9
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010602201714号