Web Page Prediction Based on Conditional Random Fields

Web page prefetching is used to reduce the access latency of the Internet. However, if most prefetched Web pages are not visited by the users in their subsequent accesses, the limited network bandwidth and server resources will not be used efficiently and may worsen the access delay problem. Therefore, it is critical that we have an accurate prediction method during prefetching. Conditional Random Fields (CRFs), which are popular sequential learning models, have already been successfully used for many Natural Language Processing (NLP) tasks such as POS tagging, name entity recognition (NER) and segmentation. In this paper, we propose the use of CRFs in the field of Web page prediction. We treat the accessing sessions of previous Web users as observation sequences and label each element of these observation sequences to get the corresponding label sequences, then based on these observation and label sequences we use CRFs to train a prediction model and predict the probable subsequent Web pages for the current users. Our experimental results show that CRFs can produce higher Web page prediction accuracy effectively when compared with other popular techniques like plain Markov Chains and Hidden Markov Models (HMMs).

[1]  Andrew McCallum,et al.  Maximum Entropy Markov Models for Information Extraction and Segmentation , 2000, ICML.

[2]  Xin Jin,et al.  An approach to intelligent Web pre-fetching based on hidden Markov model , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[3]  Ramesh R. Sarukkai,et al.  Link prediction and path analysis using Markov chains , 2000, Comput. Networks.

[4]  Ben Taskar,et al.  An Introduction to Conditional Random Fields for Relational Learning , 2007 .

[5]  Michalis Vazirgiannis,et al.  Usage-based PageRank for Web personalization , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[6]  John B. Horrigan,et al.  Pew Internet & American Life Project , 2002 .

[7]  Kotagiri Ramamohanarao,et al.  Personalized PageRank for Web Page Prediction Based on Access Time-Length and Frequency , 2007 .

[8]  J. Nocedal.  Updating Quasi-Newton Matrices With Limited Storage , 1980 .

[9]  Jorge Nocedal,et al.  On the limited memory BFGS method for large scale optimization , 1989, Math. Program..

[10]  Noah A. Smith,et al.  Computationally Efficient M-Estimation of Log-Linear Structure Models , 2007, ACL.

[11]  Philip S. Yu,et al.  Data mining for path traversal patterns in a web environment , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[12]  Andrew McCallum,et al.  Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.

[13]  Michael D. Smith,et al.  Using Path Profiles to Predict HTTP Requests , 1998, Comput. Networks.

[14]  Xiaojin Zhu,et al.  Kernel conditional random fields: representation and clique selection , 2004, ICML.

[15]  Hanna M. Wallach,et al.  Conditional Random Fields: An Introduction , 2004 .

[16]  Jaideep Srivastava,et al.  Web usage mining: discovery and applications of usage patterns from Web data , 2000, SKDD.

[17]  Andrew McCallum,et al.  Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data , 2004, J. Mach. Learn. Res..

[18]  George Karypis,et al.  Selective Markov Models for Predicting Web-Page Accesses , 2001, SDM.

[19]  J. Darroch,et al.  Generalized Iterative Scaling for Log-Linear Models , 1972 .

[20]  Kotagiri Ramamohanarao,et al.  Layered Approach Using Conditional Random Fields for Intrusion Detection , 2010, IEEE Transactions on Dependable and Secure Computing.

[21]  Venkata N. Padmanabhan.  Improving World Wide Web Latency , 1995 .

[22]  Cheng-Zhong Xu,et al.  Neural nets based predictive prefetching to tolerate WWW latency , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[23]  Adam Berger,et al.  The Improved Iterative Scaling Algorithm A Gentle Introduction , 2003 .

[24]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[25]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[26]  Paul Barford,et al.  The network effects of prefetching , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.