[1]朱 虹,李千目,戚湧.一种基于改进最近邻算法的忠诚度预测方法[J].南京理工大学学报(自然科学版),2017,41(04):448.[doi:10.14177/j.cnki.32-1397n.2017.41.04.008]
　Zhu Hong,Li Qianmu,Qi Yong.Loyalty prediction method based on improvednearest neighbor algorithm[J].Journal of Nanjing University of Science and Technology,2017,41(04):448.[doi:10.14177/j.cnki.32-1397n.2017.41.04.008]
点击复制

一种基于改进最近邻算法的忠诚度预测方法()
分享到：

《南京理工大学学报》（自然科学版）[ISSN:1005-9830/CN:32-1397/N]

卷:
41卷
期数:
2017年04期
页码:
448
栏目:
出版日期:
2017-08-31

文章信息/Info

Title:
Loyalty prediction method based on improvednearest neighbor algorithm
文章编号:
1005-9830(2017)04-0448-06
作者:
朱 虹; 李千目; 戚湧
南京理工大学 计算机科学与工程学院,江苏 南京 210094
Author(s):
Zhu Hong; Li Qianmu; Qi Yong
School of Computer Science and Engineering,Nanjing University of Science and Technology,Nanjing 210094,China
关键词:
数据挖掘;  分类;  聚类;  回归;  K最近邻算法;  贝叶斯算法;  忠诚度预测
Keywords:
data mining;  classification;  clustering;  regression;  nearest neighbor algorithm;  bayesian algorithm;  loyalty prediction
分类号:
TP391
DOI:
10.14177/j.cnki.32-1397n.2017.41.04.008
摘要:
为了提高忠诚度预测的准确度和效率,该文将K最近邻(K nearest neighbor,KNN)算法和贝叶斯算法相结合作为分类预测策略,提出一种基于改进最近邻算法的忠诚度预测方法。该方法先将高忠诚客户和低忠诚客户当作同一忠诚度类别,即同属于忠诚客户类别,利用贝叶斯算法对数据集进行初步分类,获得非忠诚客户和忠诚客户,再将忠诚客户作为下一步KNN算法的测试数据,对其做进一步分类,得到高忠诚客户、低忠诚客户和非忠诚客户。实验结果表明,该方法不仅能够降低K值即选择多少个邻居对最近邻算法的影响,减少其内存开销,而且能够有效缩短忠诚度分类的时间以及提高忠诚度分类的准确度。
Abstract:
In order to improve the accuracy and efficiency of loyalty prediction,this paper,combining K nearest neighbor(KNN)with Bayesian algorithm as a classification prediction method,proposes a loyalty prediction method based on improved nearest neighbor.The method first takes high loyal customers and low loyal customers as the same category of loyal customers.The method classifies the data set with Bayesian algorithms to obtain non-loyal customers and loyal customers.It takes loyal customers as test data set of the following KNN algorithm and classifies them to obtain high loyal customers,low loyal customers and non-loyal customers.The experimental results show that this method can not only reduce the impact of the K value on the nearest neighbor algorithm and reduce its memory overhead,but also can effectively shorten the time of loyalty classification and improve the accuracy of the classification accuracy.

参考文献/References:

[1] Yoon V Y,Hostler R E,Guo Z,et al.Assessing the moderating effect of consumer product knowledge and online shopping experience on using recommendation agents for customer loyalty[J].Decision Support Systems,2013,55(4):883-893.
[2]Yoo C W,Sanders G L,Moon J.Exploring the effect of e-WOM participation on e-Loyalty in e-commerce[J].Decision Support Systems,2013,55(3):669-678.
[3]Ngai E W T,Xiu L,Chau D C K.Application of data mining techniques in customer relationship manage-ment:A literature review and classification[J].Expert Systems with Applications,2009,36(10):2592-2602.
[4]Devi R G,Sumanjani P.Improved classification techniques by combining KNN and random forest with naive Bayesian classifier[C]//IEEE International Conference on Engineering and Technology.Coim-batore,India:IEEE,2015:1-4.
[5]Gerlein E A,Mcginnity M,Belatreche A,et al.Evaluating machine learning classification for financial trading:An empirical approach[J].Expert Systems with Applications,2016,54(6):193-207.
[6]Deng Zhenyun,Zhu Xiaoshu,Cheng Debo,et al.Efficient kNN classification algorithm for big data[J].Neurocomputing,2016,195(C):143-148.
[7]Wu X,Kumar V,Ross Quinlan J,et al.Top 10 algorithms in data mining[J].Knowledge and Information Systems,2008,14(1):1-37.
[8]Yu Z,Chen H,Liu J,et al.Hybrid k-nearest neighbor classifier[J].IEEE Transactions on Cybernetics,2015,46(6):1263-1275.
[9]Chun G,Zhu Q.Recognition of multiple power quality disturbances using KNN-Bayesian[J].International Review of Electrical Engineering,2014,9(1):109-112.
[10]Merel J,Shababo B,Naka A,et al.Bayesian methods for event analysis of intracellular currents[J].Journal of Neuroscience Methods,2016,269:21-32.

相似文献/References:

[1]余正涛,邹俊杰,赵兴,等.基于主动学习的最小二乘支持向量机稀疏化[J].南京理工大学学报(自然科学版),2012,36(01):12.
　YU Zheng-tao,ZOU Jun-jie,ZHAO Xing,et al.Sparseness of Least Squares Support Vector Machines Based on Active Learning[J].Journal of Nanjing University of Science and Technology,2012,36(04):12.
[2]潘志松,燕继坤,杨绪兵,等.单实例分类算法研究[J].南京理工大学学报(自然科学版),2009,(04):444.
　PAN Zhi-song,YAN Ji-kun,YANG Xu-bing,et al.Classification Algorithm Based on Single Sample[J].Journal of Nanjing University of Science and Technology,2009,(04):444.
[3]杨文杰,胡明昊,唐振民,等.一种有效的基于约束的关联规则发现算法[J].南京理工大学学报(自然科学版),2005,(01):109.
　YANG Wen-jie,HU Ming-hao,TANG Zhen-min,et al.Effective Algorithm for Mining Constrained Association Rules[J].Journal of Nanjing University of Science and Technology,2005,(04):109.
[4]黄双喜,张友良.并行、协同设计环境下的产品建模[J].南京理工大学学报(自然科学版),1999,(04):312.
　HuangShuangxi ZhangYouliang.The Product Modeling in Concurrent and Cooperative Environment[J].Journal of Nanjing University of Science and Technology,1999,(04):312.
[5]郭英智,申继平,李大庆.平面反射系统分类方法[J].南京理工大学学报(自然科学版),1994,(04):61.
　Guo Yingzhi.Research on Classified Method of Plane Reflecting System。[J].Journal of Nanjing University of Science and Technology,1994,(04):61.
[6]黄 伟,陈 昊,郭雅娟,等.基于集成分类的恶意应用检测方法[J].南京理工大学学报(自然科学版),2016,40(01):35.
　Huang Wei,Chen Hao,Guo Yajuan,et al.Mobile malware detection approach using ensemble classification[J].Journal of Nanjing University of Science and Technology,2016,40(04):35.

备注/Memo

备注/Memo:
收稿日期:2016-06-29 修回日期:2016-09-15基金项目:国家重点研发计划政府间国际科技创新合作重点专项(S2016G9070); 江苏省重大研发计划社会发展项目(BE2017739); 江苏省重大研发计划产业前瞻项目(BE2017100); 中央高校基本科研业务费专项资金(30916015104); 赛尔下一代互联网创新项目(NGII20160122); 中兴通讯产学研合作论坛合作项目(2016ZTE04-11)
作者简介:朱虹(1993-),女,硕士生,主要研究方向:信息安全,数据挖掘,E-mail:18251953319@163.com; 通讯作者:李千目(1979-),男,博士,教授,主要研究方向:信息安全,E-mail:liqianmu@126.com。
引文格式:朱虹,李千目,戚.一种基于改进最近邻算法的忠诚度预测方法[J].南京理工大学学报,2017,41(4):448-453.
投稿网址:http://zrxuebao.njust.edu.cn
更新日期/Last Update: 2017-08-31