基于启发式聚类模型和类别相似度的协同过滤推荐算法

doi:10.3969/j.issn.0372-2112.2016.07.027

电子学报 ›› 2016, Vol. 44 ›› Issue (7): 1708-1713.DOI: 10.3969/j.issn.0372-2112.2016.07.027

基于启发式聚类模型和类别相似度的协同过滤推荐算法

王兴茂, 张兴明, 吴毅涛, 潘俊池

国家数字交换系统工程技术研究中心, 河南郑州 450002

收稿日期:2014-12-12 修回日期:2015-10-15 出版日期:2016-07-25
- 作者简介:
- 王兴茂 男,1989年生于辽宁营口,国家数字交换系统工程技术研究中心硕士生,主要研究方向为数据挖掘、用户行为分析、推荐算法.E-mail:wxmcat@163.com;张兴明 男,1963年生于河南新乡,国家数字交换系统工程技术研究中心教授,主要研究方向为通信与信息系统、宽带信息网络等
- 基金资助:
- 国家973重点基础研究发展计划 (No.2012CB315901); 国家863高技术研究发展计划 (No.2011AA01A103)

A Collaborative Recommendation Algorithm Based on Heuristic Clustering Model and Category Similarity

WANG Xing-mao, ZHANG Xing-ming, WU Yi-tao, PAN Jun-chi

National Digital Switching System Engineering and Technological R & D Center, Zhengzhou, Henan 450002, China

Received:2014-12-12 Revised:2015-10-15 Online:2016-07-25 Published:2016-07-25
- Supported by:
- National Program on Key Basic Research Project of China (973 Program) (No.2012CB315901); National High Technology Research and Development Program of China (863 Program) (No.2011AA01A103)

摘要/Abstract

摘要：

基于k-近邻的协同过滤推荐算法对于邻居数量k的确定过于主观,并且推荐时以k-近邻均值加权推荐不够准确.针对这两个问题,本文首先引入并改进最大最小距离聚类算法,进而设计启发式聚类模型将用户进行不规定类别数的自由聚类划分,目标用户所在类的用户为邻居用户,客观确定邻居数量;然后在推荐时定义类别相似度,针对性地建立目标用户未评分和评分项目的潜在类别关系,改进k-近邻均值加权算法.实验结果表明,该算法提高了推荐准确度(约0.035MAE).

Abstract:

The collaborative recommendation algorithm based on kNN confirms the number of neighbours subjectively,and is not accurate enough to predict by kNN mean weighting calculating.To address these two problems,the maximum and minimum distance clustering algorithm was introduced and improved to design the heuristic clustering model,the model divided the users allodially without the determination of the category numbers,the neighbours of the target users were the users who were in the same category with the target users;then the category similarity was defined to build the category relation between the unscore and score items of the target user in prediction,and the kNN mean weighting calculating was advanced based on the category similarity.The experiments show that this algorithm improves the degree of accuracy (reducing about 0.035 MAE).

Key words: collaborative, recommendation algorithm, clustering algorithm, heuristic clustering model, category similarity

中图分类号:

TP393

王兴茂, 张兴明, 吴毅涛, 等. 基于启发式聚类模型和类别相似度的协同过滤推荐算法[J]. 电子学报, 2016, 44(7): 1708-1713.

WANG Xing-mao, ZHANG Xing-ming, WU Yi-tao, et al. A Collaborative Recommendation Algorithm Based on Heuristic Clustering Model and Category Similarity[J]. Acta Electronica Sinica, 2016, 44(7): 1708-1713.

参考文献

[1] 张锋,等.两方参与的隐私保护协同过滤推荐研究[J].电子学报,2009,37(1):84-89. Zhang Feng,et al.Research on privacy-preserving tw o-party collaborative filtering recommendation[J].Acta Electronica Sinica,2009,37(1):84-89.(in Chinese)
[2] 黄世平,黄晋,陈健,等.自动建立信任的防攻击推荐算法研究[J].电子学报,2013,41(2):84-89. Huang Shi-ping,Huang Jin,Chen Jian,et al.Anti-attack recommender algorithm bas ed on automatic trust establishment[J].Acta Electronica Sinica,2013,41(2):84-89.(in Chinese)
[3] 吴永辉,等.基于主题的自适应、在线网络热点发现方法及新闻推荐系统[J].电子学报,2010,38(11):2620-2624. Wu Yong-hui,et al.Adaptive on-line web topic detection method for web news recommendation system[J].Acta Electronica Sinica,2010,38(11):2620-2624.(in Chinese)
[4] 韩立新.对搜索引擎中评分方法的研究[J].电子学报,2005,33(11):2094-2096. Han Li-xin.A study on the ranking method of search engines[J].Acta Electronic a Sinica,2005,33(11):2094-2096.(in Chinese)
[5] Song Y,Zhang L,et al.Automatic tag recommendation algorithm for social recomme nder systems[J].ACM Transactions on the Web,2011,5(1):4-39.
[6] 李聪.电子商务协同过滤可扩展性研究综述[J].现代图书情报技术,2010,(11):37-44. Li Cong.Review of scalability problem in ecommerce collaborative filtering[J]. Modern Library and Information Technology,2010,(11):37-44.(in Chinese)
[7] Adomavicius G,Tuzhilin A.Toward the next generation of recommender systems:A sur vey of the state-of-the-art and possible extensions[J].IEEE Transactions on Knowledge and Data Engineering,2005,17(6):734-749.
[8] Truong K,Ishikawa F,Honiden S.Improving accuracy of recommender system by item clustering[J].IEICE-Trans Inf Syst,2007,E90-D(9):1363-1373.
[9] 张莉,秦桃,滕丕强.一种改进的基于用户聚类的协同过滤算法[J].情报科学,2014,32(10):24-28. Zhang Li,Qin Tao,Teng Pi-qiang.An improved collabrative filtering algorithm bas ed on user clustering[J].Information Science,2014,32(10):24-28.(in Chinese)
[10] Rashid A M,Lam S K,et al.ClustKNN:A highly scalable hybrid model & memory-based CF algorithm[A].Proceedings of the KDD Workshop on Web Mining and Web Usage A nalysis[C].Philadelphia,Pennsylvania:ACM,2006.1-59593-444-8.
[11] George T,Merugu S.A scalable collaborative filtering framework based on co-clus tering[A].Proceedings of the Fifth IEEE International Conference on Data Mining[C].Washington DC:IEEE Computer Society,2005.625-628.
[12] 李弼程,邵美珍,黄杰.模式识别原理与应用[M].西安电子科技大学出版社,2008.2. Li Bi-cheng,Shao Mei-zhen,Huang Jie.Principle and Application of Pattern Recog nition[M].Xidian University Publisher,2008.2.(in Chinese)
[13] Haralambos,Marmanis,Dmitry.智能Web算法[M].电子工业出版社,2011.7.
[14] KRZYWICKI A,WOBCKE W,CAI X.Interaction-based collaborative filtering methods for recommendation in online dating[A].Web Information Systems Engineering-WISE 2010[C].Berlin Heidelberg:Springer,2010.342-356.
[15] ZHANG J Y,PEARL P.A recursive prediction algorithm for collaborative filtering recommender systems[A].Proceedings of the 2007 ACM Conference on Recommender Systems[C].ACM,2007.57-64.

基于启发式聚类模型和类别相似度的协同过滤推荐算法

A Collaborative Recommendation Algorithm Based on Heuristic Clustering Model and Category Similarity

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	汪禹宏, 张屹. 基于适应度指导交配限制策略的重组算子与多目标优化研究[J]. 电子学报, 2022, 50(3): 710-717.
[2]	张帅, 高旻, 文俊浩, 熊庆宇, 唐旭. 基于自监督学习的去流行度偏差推荐方法[J]. 电子学报, 2022, 50(10): 2361-2371.
[3]	郭景峰, 朱晓松, 李爽. 直播电视推荐系统的评分预测算法研究[J]. 电子学报, 2020, 48(9): 1735-1740.
[4]	任开旭, 王玉龙, 刘同存, 李炜. 融合多维语义表示的概率矩阵分解模型[J]. 电子学报, 2019, 47(9): 1848-1854.
[5]	雷涛, 张肖, 加小红, 刘侍刚, 张艳宁. 基于模糊聚类的图像分割研究进展[J]. 电子学报, 2019, 47(8): 1776-1791.
[6]	李林峰, 刘真, 魏港明, 任爽, 葛梦凡. 基于共享知识模型的跨领域推荐算法[J]. 电子学报, 2018, 46(8): 1947-1953.
[7]	鲜征征, 李启良, 黄晓宇, 陆寄远, 李磊. 融合显/隐式信任协同过滤算法的差分隐私保护[J]. 电子学报, 2018, 46(12): 3050-3059.
[8]	俞春花, 刘学军, 李斌, 章玮. 基于上下文相似度和社会网络的移动服务推荐方法[J]. 电子学报, 2017, 45(6): 1530-1536.
[9]	陈广智, 何文, 李磊. 采用协同过滤技术进行工作流活动推荐[J]. 电子学报, 2017, 45(4): 890-897.
[10]	李改, 陈强, 李磊. 基于评分预测与排序预测的协同过滤推荐算法[J]. 电子学报, 2017, 45(12): 3070-3075.
[11]	黄震华, 张佳雯, 张波, 喻剑, 向阳, 黄德双. 语义推荐算法研究综述[J]. 电子学报, 2016, 44(9): 2262-2275.
[12]	张维玉, 吴斌, 耿玉水, 朱江. 基于协同矩阵分解的评分与信任联合预测[J]. 电子学报, 2016, 44(7): 1581-1586.
[13]	谢晓东, 彭声明, 刘艳, 汪康炜, 王田, 王成. 蜕变关系敏感度及其聚类分析[J]. 电子学报, 2016, 44(5): 1196-1201.
[14]	印桂生, 张亚楠, 董宇欣, 韩启龙. 基于受限信任关系和概率分解矩阵的推荐[J]. 电子学报, 2014, 42(5): 904-911.
[15]	袁里驰. 中心词驱动句法分析中的平滑技术[J]. 电子学报, 2013, 41(7): 1337-1342.