Abstract
In this paper, a method for constructing transferable “web” and “clickstream” prediction models based on sequential pattern evaluation indices is proposed. To predict end points, click streams are assumed as sequential data. Further, a sequential pattern generation method is applied to extract features of each click stream data. Based on these features, a classification learning algorithm is applied to construct click stream end point prediction models. In this study, the evaluation indices for sequential patterns are introduced to abstract each clickstream data for transferring the constructed predictive models between different periods. This method is applied to a benchmark clickstream dataset to predict the end points. The results show that the method can obtain more accurate predictive models with a decision tree learner and a classification rule learner. Subsequently, the evaluation of the availability for transferring the predictive morels between different periods is discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Entree chicago recommendation data, http://kdd.ics.uci.edu/databases/entree/entree.html
Agrawal, R., Srikant, R.: Mining sequential patterns. In: Yu, P.S., Chen, A.L.P. (eds.) ICDE, pp. 3–14. IEEE Computer Society (1995)
Frank, E., Wang, Y., Inglis, S., Holmes, G., Witten, I.H.: Using model trees for classification. Machine Learning 32(1), 63–76 (1998)
Hettich, S., Bay, S.D.: The uci kdd archive, http://kdd.ics.uci.edu/
Mabroukeh, N.R., Ezeife, C.I.: A taxonomy of sequential pattern mining algorithms. ACM Comput. Surv. 43, 3:1–3:41 (2010), http://doi.acm.org/10.1145/1824795.1824798
Nakagawa, H.: Automatic term recognition based on statistics of compound nouns. Terminology 6(2), 195–210 (2000)
Padmanabhan, B.: Web Clickstream Data and Pattern Discovery, vol. 3, pp. 99–116 (2009)
Pan, S.J., Yang, Q.: A survey on transfer learning. IEEE Transactions on Knowledge and Data Engineering 22(10), 1345–1359 (2010)
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.C.: Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: Proc. of the 17th International Conference on Data Engineering, pp. 215–224. IEEE Computer Society, Los Alamitos (2001)
Platt, J.: Fast training of support vector machines using sequential minimal optimization. In: Burges, C., Smola, A. (eds.) Advances in Kernel Methods - Support Vector Learning, pp. 185–208. MIT Press (1999)
Quinlan, J.R.: Programs for Machine Learning. Morgan Kaufmann Publishers (1993)
Shannon, C.E.: A mathematical theory of communication. The Bell System Technical Journal 27, 379–423, 623–656 (1948)
Sparck Jones, K.: A statistical interpretation of term specificity and its application in retrieval. Document Retrieval Systems, 132–142 (1988)
Tan, P.N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: Proceedings of International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 32–41 (2002)
Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Abe, H. (2013). Developing Transferable Clickstream Analytic Models Using Sequential Pattern Evaluation Indices. In: Yoshida, T., Kou, G., Skowron, A., Cao, J., Hacid, H., Zhong, N. (eds) Active Media Technology. AMT 2013. Lecture Notes in Computer Science, vol 8210. Springer, Cham. https://doi.org/10.1007/978-3-319-02750-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-02750-0_18
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02749-4
Online ISBN: 978-3-319-02750-0
eBook Packages: Computer ScienceComputer Science (R0)