基于Canopy和共享最近邻的服务推荐算法

doi:10.11896/jsjkx.200200031

计算机科学 ›› 2020, Vol. 47 ›› Issue (11A): 479-481.doi: 10.11896/jsjkx.200200031

基于Canopy和共享最近邻的服务推荐算法

邵欣欣

大连东软信息学院辽宁大连 116023

出版日期:2020-11-15 发布日期:2020-11-17
通讯作者: 邵欣欣(sxx929@163.com)
基金资助:
辽宁省自然科学基金(2019-ZD-0354)

Service Recommendation Algorithm Based on Canopy and Shared Nearest Neighbor

SHAO Xin-xin

Dalian Neusoft University of Information,Dalian,Liaoning 116023,China

Online:2020-11-15 Published:2020-11-17
About author:SHAO Xin-xin,born in 1980,postgra-duate,assistant professor.Her main research interests include computer software and theory,and big data.
Supported by:
This work was supported by the Natural Science Foundation of Liaoning Province,China(2019-ZD-0354).

摘要/Abstract

摘要： 为辅助银行机构进行精准的服务推荐,提出了基于改进的Canopy和共享最近邻相似度的聚类算法。基于该算法对用户进行细分,针对用户群特点进行精准服务推荐。该算法首先采用最大值和最小值对Canopy算法进行改进,并应用该算法得出初始聚类结果,然后利用共享最近邻相似度算法对聚类结果中的交叉部分数据进行归类,最终得出用户聚类数据。该算法在某银行对真实客户数据进行应用,选择基于客户的贡献度、忠诚度和活跃度3个指标进行聚类,结果表明,该算法提高了客户细分的质量和聚类的效率,聚类结果对于客户的消费数据刻画非常准确,能够为银行的精准服务推荐提供数据支持。

关键词: Canopy算法, 服务推荐, 共享最近邻相似度, 聚类指标, 客户聚类

Abstract: In order to improve the accuracy of banking institution service recommendation,a clustering algorithm based on the improved Canopy and shared nearest neighbor similarity is proposed.Based on this algorithm,users are subdivided and accurate service recommendation is made according to the characteristics of user groups.First,the improved Canopy algorithm is used to obtain the initial clustering results.Then the shared nearest neighbor similarity algorithm is used to classify the intersecting data in the clustering results.Finally,the user clustering data are obtained.The algorithm is applied to the real customer data of a bank.Three indexes of customer contribution,loyalty and activity are selected for clustering.The results show that the algorithm improves the quality of customer segmentation and the efficiency of clustering.The result of clustering is very accurate in describing the consumption data of customers.Clustering results can provide data support for accurate service recommendation of banks.

Key words: Canopy algorithm, Clustering index, Customer clustering, Service recommendation, Shared nearest neighbor similarity

中图分类号:

TP391.9

邵欣欣. 基于Canopy和共享最近邻的服务推荐算法[J]. 计算机科学, 2020, 47(11A): 479-481. https://doi.org/10.11896/jsjkx.200200031

SHAO Xin-xin. Service Recommendation Algorithm Based on Canopy and Shared Nearest Neighbor[J]. Computer Science, 2020, 47(11A): 479-481. https://doi.org/10.11896/jsjkx.200200031

参考文献

[1] JI S Q,SHI H B.Optimized K-means clustering algorithm for massive data[J].Computer Engineering and Applications,2014,50(14):143-147.
[2] HAN L B,WANG Q,JIANG Z F,et al.Improved K-means initial clustering center selection algorithm[J].Computer Engineering and Applications,2010,46(17):150-152.
[3] CUI X L,ZHU P F,YANG X.Optimized big data K-meansclustering using MapReduce[J].The Journal of Supercompu-ting,2014(6):1249-1259.
[4] HE H,GUO L,GENG Y.The optimization of CMAC neuralnetwork structure based on Canopy-K-Means algorithm[J].International Journal of Advancements in Computing Technology,2012,4(22):641-647.
[5] WANG Y G,WU C,DAI W.K-means algorithm of randomsample based on MapReduce[J].Computer Engineering and Applications,2016,52(8):74-79.
[6] CAO Y,WANG Y L,HE H M.Intelligent scheduling in pre-burdening of iron ore:Canopy-Kmeans clustering algorithm and combinatorial optimization[J].Control Theory & Applications,2017,34(7):947-955.
[7] TSAI C F,LIN W C,KE S W.Big data mining with parallel computing:A comparison of distributed and MapReduce me-thodologies[J].The Journal of Systems & Software,2016,122(1):83-92.
[8] LIU BAOLONG,SU JIN.Improved Canopy-Kmeans Algorithm based on Double-MapReduce[J].Journal of Xi'an Technological University,2016,36(9):730-737.
[9] CHEN J Y,HE H H.Research on Density-based Clustering Algorithm for Mixed Data with Determine Cluster Centers Automatically[J].Acta Automatica Sinica,2015,41(10):1798-1813.
[10] CAO H,JIA L,SI G,et al.A clustering-analysis-based membership functions formation method for fuzzy controller of ball mill pulverizing system [J].Journal of Process Control,2013,23(1):34-43.
[11] NING K,SUN T J,XU J J.Improved Nearest Neighbor Ab-sorption First Clustering Algorithm for Massive Data[J].Computer Engineering,2018,44(4):35-40.
[12] HU X J,WEI C H.Order batching optimization based on Canopy and k-means algorithm[J].Journal of Hefei University of Technology (Natural Science Edition),2017,40(3):414-419.

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed

基于Canopy和共享最近邻的服务推荐算法

Service Recommendation Algorithm Based on Canopy and Shared Nearest Neighbor

PDF (PC)

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 4

Metrics

本文评价

推荐阅读 0

[1]	王毅, 李政浩, 陈星. 基于用户场景的Android 应用服务推荐方法 Recommendation of Android Application Services via User Scenarios 计算机科学, 2022, 49(6A): 267-271. https://doi.org/10.11896/jsjkx.210700123
[2]	王少伟,刘建勋,曹步清,唐明董,王弦. 基于信息熵多属性决策的Mashup服务推荐方法 Recommended Method of Mashup Services Based on Information Entropy Multi-attribute Decision-making 计算机科学, 2015, 42(2): 263-266. https://doi.org/10.11896/j.issn.1002-137X.2015.02.055
[3]	王海艳,周洋. 基于推荐质量的信任感知推荐系统 Quality of Recommendation Based Trust-aware Recommender System 计算机科学, 2014, 41(6): 119-124. https://doi.org/10.11896/j.issn.1002-137X.2014.06.024
[4]	杜静,叶剑,史红周,何哲,朱珍民. 基于贝叶斯网络的多Agent服务推荐机制研究 Research on Multi-Agent Service Recommendation Mechanism Based on Bayesian Network 计算机科学, 2010, 37(4): 208-.