Generic placeholder image

Recent Advances in Computer Science and Communications

Author(s): Nguyen Thon Da*, Tan Hanh and Ho Trung Thanh

DOI: 10.2174/2666255814666201230115148

DownloadDownload PDF Flyer Cite As
Predicting Buying Behavior using CPT+: A Case Study of an E-commerce Company

Page: [1096 - 1102] Pages: 7

  • * (Excluding Mailing and Handling)

Abstract

Recently, predicting the buying behaviour of customers on e-commerce websites is a very critical issue in business management. This could help merchants understand the tendencies of consumers in choosing and buying products. It has become increasingly common these days that predicting buying behaviour on online systems. Although this is a challenging task, it is an exciting and hot topic for researchers. This article intends to be proposed as a predictive model for buying behaviour on online systems. This model may be represented as a two-stage process. First, a sequence database is built from a shopping cart. Second, the prediction will be performed by using the CPT+, which is an improved model of CPT (Compact Prediction Tree). The main contribution of this paper is that we proposed a solution for predicting buying behaviour in the e-commerce context (a case study of an e-commerce company). The core prediction is mainly based on sequence prediction, in particularly, CPT+ (Compact Prediction Tree).

Keywords: Sequence prediction, customer behaviour prediction, compact prediction tree, CPT, CPT+, E-commerce.

Graphical Abstract

[1]
P-N. Tan, M. Steinbach, and V. Kumar, Introduction to data mining., Pearson Education: India, 2016.
[2]
T. Gueniche, P. Fournier-Viger, and V.S. Tseng, "Compact Prediction Tree: A Lossless Model for Accurate Sequence Prediction", ADMA, no. 2, pp. 177-188, 2013.
[http://dx.doi.org/10.1007/978-3-642-53917-6_16]
[3]
R. Agrawal, and R. Srikant, "Fast algorithms for mining association rules", Proc. 20th int. conf. very large databases, VLDB, vol. 1215. 1994, pp. 487-499.
[4]
C. Cumby, A. Fano, R. Ghani, and M. Krema, "Predicting customer shopping lists from point-of-sale purchase data", Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, 2004, pp. 402-409.
[http://dx.doi.org/10.1145/1014052.1014098]
[5]
A. Carlson, C. Cumby, J. Rosen, and D. Roth, "The SNoW learning architecture", Technical report .UIUCDCS1999.
[6]
R. Ismail, Z. Othman, and A.A. Bakar, "Associative prediction model and clustering for product forecast data", 2010 10th International Conference on Intelligent Systems Design and Applications, 2010, pp. 1459-1464.
[http://dx.doi.org/10.1109/ISDA.2010.5687116]
[7]
T. Gueniche, P. Fournier-Viger, R. Raman, and V.S. Tseng, "CPT+: Decreasing the time/space complexity of the Compact Prediction Tree", Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2015, pp. 625-636.
[http://dx.doi.org/10.1007/978-3-319-18032-8_49]
[8]
P. Fournier-Viger, R. Nkambou, and V.S-M. Tseng, "RuleGrowth: mining sequential rules common to several sequences by pattern-growth", Proceedings of the 2011 ACM symposium on applied computing, 2011, pp. 956-961.
[http://dx.doi.org/10.1145/1982185.1982394]
[9]
P. Fournier-Viger, U. Faghihi, R. Nkambou, and E.M. Nguifo, "CMRules: Mining sequential rules common to several sequences", Knowl. Base. Syst., vol. 25, no. 1, pp. 63-76, 2012.
[http://dx.doi.org/10.1016/j.knosys.2011.07.005]
[10]
P. Fournier-Viger, T. Gueniche, S. Zida, and V.S. Tseng, "ERMiner: sequential rule mining using equivalence classes", International Symposium on Intelligent Data Analysis, 2014, pp. 108-119.
[http://dx.doi.org/10.1007/978-3-319-12571-8_10]
[11]
W. Tian, B. Choi, and V.V. Phoha, "An adaptive web cache access predictor using neural network", International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, 2002, pp. 450-459.
[http://dx.doi.org/10.1007/3-540-48035-8_44]
[12]
J. Cleary, and I. Witten, "Data compression using adaptive coding and partial string matching", IEEE Trans. Commun., vol. 32, no. 4, pp. 396-402, 1984.
[http://dx.doi.org/10.1109/TCOM.1984.1096090]
[13]
V. Padmanabhan, and J. Mogul, "Using Prefetching to Improve World Wide Web Latency", Comput. Commun., vol. 16, pp. 358-368, 1998.
[14]
J. Pitkow, and P. Pirolli, "Mininglongestrepeatin g subsequences to predict world wide web surfing", Proc. Usenix Symp. on Internet Technologies and systems, 1999, p. 1. p
[15]
P. Laird, and R. Saul, "Discrete sequence prediction and its applications", Mach. Learn., vol. 15, no. 1, pp. 43-68, 1994.
[http://dx.doi.org/10.1007/BF01000408]
[16]
J. Ziv, and A. Lempel, "Compression of individual sequences via variable-rate coding", IEEE Trans. Inf. Theory, vol. 24, no. 5, pp. 530-536, 1978.
[http://dx.doi.org/10.1109/TIT.1978.1055934]
[17]
R. Begleiter, R. El-Yaniv, and G. Yona, "On prediction using variable-order Markov models", J. Artif. Intell. Res., vol. 22, pp. 385-421, 2004.
[http://dx.doi.org/10.1613/jair.1491]
[18]
F.M. Willems, Y.M. Shtarkov, and T.J. Tjalkens, "The context-tree weighting method: basic properties", IEEE Trans. Inf. Theory, vol. 41, no. 3, pp. 653-664, 1995.
[http://dx.doi.org/10.1109/18.382012]
[19]
K. Gopalratnam, and D.J. Cook, "Online sequential prediction via incremental parsing: The active lezi algorithm", IEEE Intell. Syst., vol. 22, no. 1, pp. 52-58, 2007.
[http://dx.doi.org/10.1109/MIS.2007.15]
[20]
P. Fournier-Viger, "The SPMF open-source data mining library version 2", Joint European conference on machine learning and knowledge discovery in databases, 2016, pp. 36-40.
[http://dx.doi.org/10.1007/978-3-319-46131-1_8]
[21]
T. Gueniche, P. Fournier-Viger, and V.S. Tseng, "Compact prediction tree: A lossless model for accurate sequence prediction", International Conference on Advanced Data Mining and Applications, 2013, pp. 177-188.
[http://dx.doi.org/10.1007/978-3-642-53917-6_16]
[22]
M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, "Spark: Cluster computing with working sets", HotCloud, vol. 10, no. 10-10, p. 95, 2010.