[1]杨大鑫,王荣波,黄孝喜,等.基于最小方差的 K-means 用户聚类推荐算法[J].计算机技术与发展,2018,28(01):104-107.[doi:10.3969/ j. issn.1673-629X.2018.01.022]
　YANG Da-xin,WANG Rong-bo,HUANG Xiao-xi,et al.K-means User Clustering Recommendation Algorithm Based on Minimum Variance[J].Computer Technology and Development,2018,28(01):104-107.[doi:10.3969/ j. issn.1673-629X.2018.01.022]
点击复制

基于最小方差的 K-means 用户聚类推荐算法()

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
28
期数:
2018年01期
页码:
104-107
栏目:
智能、算法、系统工程
出版日期:
2018-01-10

文章信息/Info

Title:
K-means User Clustering Recommendation Algorithm Based on Minimum Variance
文章编号:
1673-629X(2018)01-0104-04
作者:
杨大鑫; 王荣波; 黄孝喜; 谌志群
杭州电子科技大学 计算机学院,浙江 杭州 310018
Author(s):
YANG Da-xin; WANG Rong-bo; HUANG Xiao-xi; CHEN Zhi-qun
School of Computer,Hangzhou Dianzi University,Hangzhou 310018,China
关键词:
信息过载; 协同过滤算法; Weighted Slope One; 最小方差;  K -means 聚类
Keywords:
information overload; collaborative filtering algorithm; Weighted Slope One; minimum variance;  K -means clustering
分类号:
TP391
DOI:
10.3969/ j. issn.1673-629X.2018.01.022
文献标志码:
A
摘要:
协同过滤推荐算法是一种传统的推荐技术,具有简单高效的特点,在实际中有广泛的应用,获得了大量研究者的青睐。 虽然传统的协同过滤推荐算法在一定程度上缓解了用户当前所面临的信息超载问题,但其在处理大数据时存在的数据稀疏性和扩展性等问题却日益突出。 于是,提出了一种基于最小方差的 K -means 用户聚类推荐算法。 在缓解数据稀疏性方面,利用 Weighted Slope One 算法对初始用户—项目评分矩阵进行有效填充,降低了数据稀疏性;在提高算法扩展性方面,采用基于最小方差的 K -means 算法对用户评分数据进行聚类,将相似的用户聚到一起,减小目标用户的最近邻搜索空间,提高了算法扩展性。 通过在 MovieLens 数据集上的对比实验,结果表明,相比于传统的协同过滤推荐算法,改进算法具有更高的推荐准确度。
Abstract:
Collaborative filtering recommendation algorithm is a kind of traditional recommendation technology which is so simple and efficient with a wide range of applications that it has been favorite by a large number of researchers. Although the traditional collaborative filtering recommendation algorithm has alleviated the information overload faced by users to a certain extent,the data sparsity and expansibility in dealing with large data is becoming more and more prominent. For this,a K -means user clustering recommendation algorithm based on minimum variance is proposed. The Weighted Slope One algorithm is used to fill the initial user-item scoring matrix effectively,and the data sparsity is reduced. Then K -means algorithm based on minimum variance is adopted to carry out the user rating data clustering,with similar users clustered together to reduce the target user’s nearest neighbor search space and improve its expansibility. The contrast experiments on MovieLens datasets show that the proposed algorithm has higher recommendation accuracy than the conventional collaborative filtering recommendation algorithm.

相似文献/References:

[1]叶树鑫[],何聚厚[][]. 协作学习中基于协同过滤的学习资源推荐研究[J].计算机技术与发展,2014,24(10):63.
　YE Shu-xin[],HE Ju-hou[][]. esearch on Learning Material Recommendation Based on Collaborative Filtering Algorithm in Cooperative Learning[J].Computer Technology and Development,2014,24(01):63.
[2]谢人强,陈震. 基于共同评分项和权重计算的推荐算法研究[J].计算机技术与发展,2016,26(09):69.
　XIE Ren-qiang,CHEN Zhen. Research on Recommendation Algorithm Based on Co-rating and Weight Calculation[J].Computer Technology and Development,2016,26(01):69.
[3]马婉贞,钱育蓉. 基于标签匹配的协同过滤推荐算法研究[J].计算机技术与发展,2017,27(07):25.
　MA Wan-zhen,QIAN Yu-rong. Investigation on Collaborative Filtering Recommendation Algorithm with Tag Matching[J].Computer Technology and Development,2017,27(01):25.
[4]施海鹰. 基于关联规则挖掘的分类随机游走算法[J].计算机技术与发展,2017,27(09):1.
　SHI Hai-ying. Random-walk Classification Algorithm with Association Rules Mining[J].Computer Technology and Development,2017,27(01):1.
[5]沈鹏,李涛.混合协同过滤算法在推荐系统中的应用[J].计算机技术与发展,2019,29(03):69.[doi:10.3969/ j. issn.1673-629X.2019.03.014]
　SHEN Peng,LI Tao.Application of Hybrid Collaborative Filtering Algorithm in Recommendation System[J].Computer Technology and Development,2019,29(01):69.[doi:10.3969/ j. issn.1673-629X.2019.03.014]
[6]孔元元,白智远,张 飒,等.融合时间与兴趣相似度的产品推荐方法研究[J].计算机技术与发展,2019,29(09):195.[doi:10. 3969 / j. issn. 1673-629X. 2019. 09. 037]
　KONG Yuan-yuan,BAI Zhi-yuan,ZHANG Sa,et al.Research on Products Recommendation Method Integrated with Time Weight and Interest Similarity[J].Computer Technology and Development,2019,29(01):195.[doi:10. 3969 / j. issn. 1673-629X. 2019. 09. 037]
[7]马瑞新,郭芳清,刘振娇,等.融合上下文信息与核密度估计的协同过滤推荐[J].计算机技术与发展,2021,31(04):34.[doi:10. 3969 / j. issn. 1673-629X. 2021. 04. 006]
　MA Rui-xin,GUO Fang-qing,LIU Zhen-jiao,et al.Collaborative Filtering Recommendation Algorithm for FusionContext Information and Kernel Density Estimation[J].Computer Technology and Development,2021,31(01):34.[doi:10. 3969 / j. issn. 1673-629X. 2021. 04. 006]
[8]任静霞,武志峰.动态信任衰减和信息匹配的混合推荐算法[J].计算机技术与发展,2021,31(10):30.[doi:10. 3969 / j. issn. 1673-629X. 2021. 10. 006]
　REN Jing-xia,WU Zhi-feng.Hybrid Recommendation Algorithm Based on Dynamic Trust Decay and Information Matching[J].Computer Technology and Development,2021,31(01):30.[doi:10. 3969 / j. issn. 1673-629X. 2021. 10. 006]
[9]刘昊东,王 诚.基于热门度修正因子和置信度的协同过滤算法[J].计算机技术与发展,2023,33(03):127.[doi:10. 3969 / j. issn. 1673-629X. 2023. 03. 019]
　LIU Hao-dong,WANG Cheng.Collaborative Filtering Algorithm Based on Popularity Correction Factor and Confidence[J].Computer Technology and Development,2023,33(01):127.[doi:10. 3969 / j. issn. 1673-629X. 2023. 03. 019]

更新日期/Last Update: 2018-03-13