Please wait a minute...
浙江大学学报(工学版)
浙江大学学报(工学版)
服务计算     
基于Logistic函数和用户聚类的协同过滤算法
毛宜钰, 刘建勋, 胡蓉, 唐明董
1. 湖南科技大学 计算机科学与工程学院,知识处理与网络化制造湖南省普通高校重点实验室,湖南 湘潭 411201； 2. 南京大学 计算机软件新技术国家重点实验室,江苏 南京 210000
Collaborative filtering algorithm based on Logistic function and user clustering
MAO Yi-yu, LIU Jian-xun, HU Rong, TANG Ming-dong
1. Key Lab of Knowledge Processing and Networked Manufacturing, School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan 411201, China; 2. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210000, China
 全文: PDF(1012 KB)   HTML
摘要：

针对协同过滤推荐算法的数据稀疏性和可扩展性问题,提出一种基于Logistic函数和用户聚类的协同过滤算法.计算用户对服务关键词的偏好度,构建用户-关键词偏好向量,并基于此向量对用户进行聚类；采用Logistic函数计算用户对服务的兴趣度,并根据兴趣度相似性在目标用户所在类内寻找其最近邻居；通过最近邻居预测用户对服务的兴趣度,将兴趣度较高的服务推荐给用户.基于真实数据集的实验证明,与传统协同过滤算法相比,本文算法能取得更高的准确率,且聚类后算法运行时间显著减少,有效地提高了推荐的实时性.
Abstract: A collaborative filtering algorithm based on Logistic function and user clustering was proposed in view of the data sparsity and scalability issues of collaborative filtering. At first, a user’s preference for service keywords was computed, and a user-keyword preference vector was constructed, based on which users were clustered. Then, a user’s interest in service was computed by using a Logistic function. According to the similarity between users’ interest, the nearest neighbors were found in the cluster, which included the target user. At last, the user’s interest in a service was predicted through the neighbors’ interests in the service, and services with high interest prediction were recommended to the user. The experimental results based on real data set show that this algorithm can achieve higher accuracy than traditional collaborative filtering algorithms, and the running time of clustering algorithm is significantly reduced, which effectively improves the real-time performance of recommendation.
出版日期: 2017-06-11
CLC:  TP 301  
基金资助:

国家自然科学基金资助项目（61572186, 61572187)；南京大学计算机软件新技术国家重点实验室资助项目（KFKT2015B04）； 湖南省高校创新平台开放基金资助项目（15K043）.
通讯作者: 胡蓉，女，讲师. ORCID: 0000-0003-4970-8731.     E-mail: ronghu@126.com
作者简介: 毛宜钰（1992—），女，硕士生，从事服务计算研究. ORCID: 0000-0002-4693-6408. E-mail: 1270397155@qq.com
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
作者相关文章　　

引用本文:

毛宜钰, 刘建勋, 胡蓉, 唐明董. 基于Logistic函数和用户聚类的协同过滤算法[J]. 浙江大学学报(工学版), 10.3785/j.issn.1008-973X.2017.06.024.

MAO Yi-yu, LIU Jian-xun, HU Rong, TANG Ming-dong. Collaborative filtering algorithm based on Logistic function and user clustering. JOURNAL OF ZHEJIANG UNIVERSITY (ENGINEERING SCIENCE), 10.3785/j.issn.1008-973X.2017.06.024.

参考文献(References)：
［1］ SCHOLZ M B, FORMAN G, PAN R. Collaborative filtering model having improved predictive performance: US Patent 9,355,414［P］. 2016-5-31.
［2］ YANG X, WU J, DANG Y, et al. A product recommendation approach based on the latent social trust network model for collaborative filtering ［C］∥ 2016 IEEE International Conference on Software Quality, Reliability and Security Companion (QRSC). Vienna：IEEE, 2016: 178-185.
［3］ 王海艳,杨文彬,王随昌,等.基于可信联盟的服务推荐方法［J］.计算机学报,2014, 37(2): 301-311.
WANG Hai-yan, YANG Wen-bin, WANG Sui-chang, et al. A service recom-mendation method based on trustworthy community ［J］. Chinese Journal of Computers, 2014, 37(2): 301-311.
［4］ PAPAGELIS M, PLEXOUSAKIS D, KUTSURAS T. Alleviating the sparsity problem of collaborative filtering using trust inferences ［M］ ∥International Conference on Trust Management. Berlin Heidelberg: Springer, 2005: 224-239.
［5］ 邓爱林,朱扬勇,施伯乐.基于项目评分预测的协同过滤推荐算法［J］.软件学报,2003,14(9): 1621-1628.
DENG Ai-lin, ZHU Yang-yong, SHI Bai-le. A collaborative filtering recommendation algorithm based on item rating prediction ［J］. Journal of Software, 2003, 14(9): 1621-1628.
［6］ KALELI C. An entropy-based neighbor selection approach for collaborative filtering ［J］. Knowledge-Based Systems, 2014, 56: 273-280.
［7］ HATAMI M, PASHAZADEH S. Enhancing prediction in collaborative filtering-based recommender systems ［J］. International Journal of Computer Sciences andEngineering, 2014, 2(1): 48-51.
［8］ EL ALAMI Y E M, NFAOUI E H, El BEQQALI O. Toward an effective hybrid collaborative filtering: a new approach based on matrix factorization and heuristicbased neighborhood
［C］ ∥ Intelligent Systems and Computer Vision (ISCV). Hong Kong: IEEE, 2015: 1-8.
［9］ RUSSELL S, YOON V. Applications of wavelet data reduction in a recommender system ［J］. Expert Systems with Applications, 2008, 34(4): 2316-2325.
［10］ SARWAR B, KARYPIS G, KONSTAN J, et al. Application of dimensionality reduction in recommender system-a case study ［R］. Minneapolis: US Minnesota University Minneapolis Department of Computer Science, 2000.
［11］ DAKHEL G M, MAHDAVI M. A new collaborative filtering algorithm using K-means clustering and neighbors’ voting ［C］∥ International Conference on Hybrid Intelligent Systems. Melacca: IEEE, 2011: 179-184.
［12］ LI Y, MENG X F, LIU J, et al. Study of the long-range evolution of online human-interest based on small data ［J］. Journal of Computer Research and Development, 2015, 4(4): 779-788.
［13］ LIU J, SUN P, NI H. Estimation of user interestdegree based on neural network ［J］. Computer Engineering, 2011, 7(7): 187-189.
［14］ 金海金.基于用户行为及语义相关实时更新的用户兴趣模型［D］.成都:西南师范大学,2005.
JIN Haijin. The user interests model with real-time updated user interests based on user behaviors and similar semantic［D］. Chengdu: Southwestern NormalUniversity, 2005.
［15］ CHAOBO H E, SHEN Y, JIANHUI Y U, et al. A recommender system based on historical usage data for Web service discovery ［J］. IEEE Transactions on Consumer Electronics, 2012, 6(1): 51-63.
［16］ SU X, KHOSHGOFTAAR T M. A survey of collaborative filtering techniques ［J］.Advances in artificialintelligence, 2009(12): 4.
［17］ HOFMANN T. Latent semantic models for collaborative filtering ［J］. ACM Transactions on Informatiotems (TOIS), 2004, 22(1): 89-115.
［18］ GONG S. A collaborative filtering recommendationalgorithm based on user clustering and item clustering ［J］. Journal of Software, 2010, 5(7): 745-752.
[1] 鲁建厦,翟文倩,李嘉丰,易文超,汤洪涛. 基于改进混合蛙跳算法的多约束车辆路径优化[J]. 浙江大学学报(工学版), 2021, 55(2): 259-270.
[2] 程松,邹宗峰. 平面桁架构建的定日镜面形支撑结构优化及实验[J]. 浙江大学学报(工学版), 2020, 54(12): 2310-2320.
[3] 冀俊忠,宋晓妮,杨翠翠. 基于鱼群算法的脑功能连接邻域粗糙集特征归约方法[J]. 浙江大学学报(工学版), 2020, 54(11): 2247-2257.
[4] 付晓峰,牛力,胡卓群,李建军,吴卿. 基于过渡帧概念训练的微表情检测深度网络[J]. 浙江大学学报(工学版), 2020, 54(11): 2128-2137.
[5] 吴其,黄小红,马严,丛群. 复合型日志的模板提取方法[J]. 浙江大学学报(工学版), 2020, 54(8): 1557-1561.
[6] 刘葛辉,陈绍宽,金华,刘爽,彭宏勤. 基于延迟时间模型的不完全检修计划优化模型[J]. 浙江大学学报(工学版), 2020, 54(7): 1298-1307.
[7] 周朝君,黄明辉,陆新江. 基于低维约束嵌入的分布参数系统建模[J]. 浙江大学学报(工学版), 2019, 53(11): 2154-2162.
[8] 徐嘉豪,冀俊忠,杨翠翠. 基于蝙蝠算法的蛋白质网络功能模块检测[J]. 浙江大学学报(工学版), 2019, 53(8): 1618-1629.
[9] 董立岩,金佳欢,方塬程,王越群,李永丽,孙铭会. 基于非负矩阵分解的Slope One算法[J]. 浙江大学学报(工学版), 2019, 53(7): 1349-1353.
[10] 隋昊,覃高峰,崔祥波,陆新江. 基于误差均值与方差最小化的鲁棒T-S模糊建模方法[J]. 浙江大学学报(工学版), 2019, 53(2): 382-387.
[11] 张丽娜, 余阳. 海量O2O服务组合的优化[J]. 浙江大学学报(工学版), 2017, 51(6): 1259-1268.
[12] 董立岩, 朱琪, 李永丽. 基于最大共识的模型组合算法[J]. 浙江大学学报(工学版), 2017, 51(2): 416-421.
[13] 张小骏, 刘志镜, 李杰. 基于图像处理思想的激波捕捉自适应网格方法[J]. 浙江大学学报(工学版), 2017, 51(1): 89-94.
[14] 易树平, 刘觅, 温沛涵. 面向智能车间的工艺规划辅助决策方法[J]. 浙江大学学报(工学版), 2016, 50(10): 1911-1921.
[15] 过晓芳,王宇平,代才. 新的混合分解高维多目标进化算法[J]. 浙江大学学报(工学版), 2016, 50(7): 1313-1321.