期刊文献+

基于二次聚类和隐马尔可夫链的持卡消费行为预测 被引量:1

Customer behavior prediction for card consumption based on two-step clustering and hidden Markov chain
下载PDF
导出
摘要 银行卡支付在社会消费行为中占很大比例,在促进经济增长中发挥重大作用,因此,预测持卡消费行为具有重要意义。然而,传统方法难以有效应对复杂数据和动态变化。为此,提出基于二次聚类和隐马尔可夫链(HMC)理论的个体消费行为预测方法。首先,对消费行为按照序列进行模式聚类,并引入惩罚聚类进行二次聚类,对序列模式中的层次状态进行平衡划分;其次,利用HMC来估计序列中消费层次的状态转移,对用户的未来消费行为进行预测。最后,通过实验比较分析传统聚类、无惩罚序列聚类和带惩罚项的聚类结果表明,提出的基于二次聚类和隐马氏链的方法更适用于消费者行为预测。 Bank card payments account for a large proportion in the social consumption, which plays a major role in the promotion of economic growth. So, predicting consumer behavior is important. However, the traditional methods are difficult to effectively deal with complex data and dynamic changes. Based on this, a customer behavior prediction method for card consumption based on two-step clustering and Hidden Markov Chain( HMC) was presented. Firstly, consumer behaviors were conduced by pattern clustering based on sequence; then the secondary clustering was conducted by introducing penalty clustering, which carried out the equilibrium division of the hierarchical states in the sequential pattern. Secondly, HMC was used to estimate the state transition of consumption levels in the sequence and predict the future consumer behavior of the users. Finally, the experimental comparison and analysis results on the traditional clustering, clustering without penalty and clustering with penalty show that the proposed method based on two-step clustering and HMC is more suitable to the consumer behavior prediction model.
作者 宋涛 王星
出处 《计算机应用》 CSCD 北大核心 2016年第7期1904-1908,共5页 journal of Computer Applications
基金 中央高校基本科研业务费专项(13XNI011)~~
关键词 二次聚类 惩罚聚类 隐马尔可夫链 持卡消费 行为预测 two-step clustering penalty clustering Hidden Markov Chain(HMC) card consumption behavior prediction
  • 相关文献

参考文献9

二级参考文献276

共引文献275

同被引文献14

  • 1Gerard Sahon and Chris Buckley. Introduction to Modern Information Retrieval[M]. McGraw-Hill, New York, 2003.
  • 2Susan T. Dumais. Improving the retrieval of information from external sources [C]// Behavior Research Methods, Instru ments and Computers, 1991 : 221-246.
  • 3Carl D. Meyer. Matrix Analysis and Applied Linear Algebra[C]// SIAM, Philadelphia, 2000.
  • 4Michael W. Berry and Murray Browne. Understanding Search Engines: Mathematical Modeling and Text Retrieval [J]. SIAM, Philadelphia, 2an edition,2005(16):78-93.
  • 5Paolo Boldi and Sebastiano Vigna. The WebGraph framework II. Codes for the World Wide Web [C]// Technical Report 286-03, Universita di Milano, Dipartimento diScienze dell' Informazione Engineering, 2013.
  • 6Matthew Richardson, Petro Domingos. The intelligent surfer: Probabilistic combination of link and content information in PageRank [J]. Advances in Neural Information Processing Systems, 2012 (14): 1398-1399.
  • 7Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, et al. Extrapolation methods for accelerating PageRank computations[C]//In Twelfth International World Wide Web Conference, New York, 2003.
  • 8Grace E. Cho and Carl D. Meyer. Aggregation/disaggregation errors for nearly uncoupled Markov chains [R]. Technical report, NCSU Tech. Report, 2013.
  • 9William J. Stewart Numerical experiments with iteration and aggregation for Markov chains [J]. ORSA Journal on Computing, 2011,4 (3) :50-336.
  • 10Cleve B. Moler. Numerical computing with MATLAB [M]. SIAM, 2004.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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