期刊文献+

改进的K-means算法及其在铁路客户细分中的应用 被引量:4

Improved K-means Algorithm and its application in railway customer segmentation
下载PDF
导出
摘要 提出使用距离均和识别孤立点,并引入方差对孤立点进行判断处理,对传统的K-means算法进行改进并将改进后的K-means算法应用到铁路客户细分领域,实验结果表明,改进后的K-means算法能更为准确地对铁路货运客户进行聚类分析,从多维的角度较为全面、深入地细分客户消费行为特征,从而辅助铁路货运营销部门制定有针对性的营销策略,进行高效的客户关系管理,提高市场竞争力。 This paper put forward the idea of improving the traditional K-means Algorithm with identifying the isolated points by average distance sum, and judged and processed the isolated points by introducing variance. The improved K-means Algorithm was applied to the field of railway freight customer segmentation. The experimental result showed that the improved K-means Algorithm could carry out cluster analysis on railway freight customers more accurately, sectionalize the characteristics of customers' consuming behaviors in a comprehensive and in-depth manner from multidimensional perspectives, thus assist railway freight marketing department to formulate targeted marketing strategies, carry out high efficient customer relation management and increase market competitiveness.
出处 《铁路计算机应用》 2014年第6期45-48,共4页 Railway Computer Application
关键词 数据挖掘 铁路货运 K-MEANS算法 data mining railway freight transportation K-means Algorithm
  • 相关文献

参考文献4

二级参考文献17

  • 1吕巍,蒋波,陈洁.基于K-means算法的中国移动市场顾客行为细分策略研究[J].管理学报,2005,2(1):80-84. 被引量:15
  • 2蒋盛益,李庆华,李新.数据流挖掘算法研究综述[J].计算机工程与设计,2005,26(5):1130-1132. 被引量:21
  • 3卢辉斌,徐刚,李段.一种基于孤立点检测的入侵检测方法[J].微机发展,2005,15(6):93-94. 被引量:3
  • 4胡吉明,鲜学丰.挖掘关联规则中Apriori算法的研究与改进[J].计算机技术与发展,2006,16(4):99-101. 被引量:59
  • 5吴志丹,赵大宇,唐恒永.一种改进的关联规则挖掘算法[J].沈阳师范大学学报(自然科学版),2006,24(3):257-259. 被引量:4
  • 6Kuramitsu K. Finding Periodic Outliers over a Monogenetic Event Stream[C]//Proc. of International Workshop on Ubiquitous Data Management. Tokyo, Japan: [s. n.], 2005: 97-104.
  • 7Portnoy L, Eskin E, Stolfo S J. Intrusion Detection with Unlabeled Data Using Clustering[C]//Proc. of ACM CSS Workshop on Data Mining Applied to Security. Philadelphia, USA: ACM Press, 2001.
  • 8Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases[ C]//Proceedings of the ACM SIGMOD Conference on Management of data(ACM SIGMOD'93). Washington, USA: [ s. n. ], 1993 : 207 - 216.
  • 9Agrawal R, Srikant R. Fast Algorithms for Mining Association Rules in Large Database[ C]//Proceeding of the 20th International Conference on Very Large Databases. Santiago, Chile: [s. n. ], 1994:487 - 499.
  • 10Cheung D W, Han J, Ng V, et al. A fast distributed Algorithm for mining association rules[C]//In: Proc 1996 Int Corrf Parallel and Distributed Information Systems. Miami Beach, FL: [s.n. ] ,1996:31-44.

共引文献17

同被引文献31

引证文献4

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部