Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(697.79KB)
This is an Open Access publication published under CSC-OpenAccess Policy.
An Efficient Hybrid Successive Markov Model for Predicting Web User Usage Behavior using Web Usage Mining
V V R Maheswara Rao, V Valli Kumari
Pages - 43 - 62     |    Revised - 31-01-2011     |    Published - 08-02-2011
Volume - 1   Issue - 5    |    Publication Date - January / February  Table of Contents
MORE INFORMATION
KEYWORDS
Web Usage Mining, Prediction Model, Navigation Behavior, Higher Order Markov Model, Web log Data, Browsing Patterns
ABSTRACT
With the continued growth and proliferation of Web services and Web based information systems, the volumes of user data have reached astronomical proportions. Analyzing such data using Web Usage Mining can help to determine the visiting interests or needs of the web user. As web log is incremental in nature, it becomes a crucial issue to predict exactly the ways how users browse websites. It is necessary for web miners to use predictive mining techniques to filter the unwanted categories for reducing the operational scope. The first-order Markov model has low accuracy in achieving right predictions, which is why extensions to higher order models are necessary. All higher order Markov model holds the promise of achieving higher prediction accuracies, improved coverage than any single-order Markov model but holds high state space complexity. Hence a Hybrid Markov Model is required to improve the operation performance and prediction accuracy significantly. The present paper introduces An Efficient Hybrid Successive Markov Prediction Model, HSMP. The HSMP model is initially predicts the possible wanted categories using Relevance factor, which can be used to infer the users’ browsing behavior between web categories. Then predict the pages in predicted categories using techniques for intelligently combining different order Markov models so that the resulting model has low state complexity, improved prediction accuracy and retains the coverage of the all higher order Markov model. These techniques eliminates low support states, evaluates the probability distribution and estimates the error associated with each state without affecting the overall accuracy as well as protection of the resulting model. To validate the proposed prediction model, several experiments were conducted and results proven this are claimed in this paper.
CITED BY (5)  
1 El-Yazeed, N. A. A Survey on Web Recommendation Systems Based on Web Usage Mining.
2 Liua, L., Lvb, J., Lic, J., & Wangc, Y. Evolutionary Game Model of Information Interaction in Social Network?.
3 Thwe, P. Using Markov Model and Popularity and Similarity-based Page Rank Algorithm for Web Page Access Prediction.
4 Liu, L., Wang, Y., & Liu, S. (2013). Model of opinion interactions base on evolutionary game in social network. In Intelligent Computing Theories and Technology (pp. 64-72). Springer Berlin Heidelberg.
5 Bajaj, P., & Raheja, S. (2014). A Vague Improved Markov Model Approach for Web Page Prediction. arXiv preprint arXiv:1405.7868.
1 Google Scholar
2 CiteSeerX
3 refSeek
4 Scribd
5 SlideShare
6 PdfSR
1 M. Spiliopoulou, “Web Usage Mining for Site Evaluation,” Comm. ACM, vol. 43, no. 8, 2000,pp. 127–134.
2 M. Eirinaki, M. Vazirgiannis, and D. Kapogiannis, “Web Path Recommendations Based on Page Ranking and Markov Models,” Proc. Seventh Ann. ACM Int’l Workshop Web Information and Data Management (WIDM ’05), pp. 2-9, 2005.
3 S. Schechter, M. Krishnan, and M. Smith, Using Path Profiles to Predict HTTP Requests,”Computer Networks and ISDN Systems, vol. 30, pp. 457-467, 1998.
4 X. Chen and X. Zhang, “A Popularity-Based reduction Model for Web Pre fetching,”Computer, pp. 63-70, 2003.
5 R. Walpole, R. Myers, S. Myers and K. Ye, “Probability and Statistics for Engineers and Scientists,” in Paperback, 7 ed., Pearson Education, 2002, pp.82-87.
6 R. M. Suresh and R. Padmajavalli,” An Overview of Data Preprocessing in Data and Web Usage Mining,” Digital Information Management IEEE, pp. 193-198, 2006.
7 Yan Wang,Web Mining and Knowledge Discovery of Usage Patterns, February, 2000.
8 R. Cooley, B. Mobasher, and J. Srivastava. Web mining: Information and pattern discovery on the World Wide Web. In Proceedings of the 9th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’97), 1997.
9 M.-S. Chen, J.S. Park, and P.S. Yu., “Efficient Data Mining for Path Traversal Patterns,” IEEE Trans. Knowledge and Data Eng., vol. 10, no. 2, 1998.
10 M. S. Chen, J. S. Park and P. S. Yu, “Efficient Data Mining for Path Traversal Patterns in a Web Environment”, IEEE Transaction on Knowledge and Data Engineering, 1998.
11 Wang Shachi, Zhao Chengmou. Study on Enterprise Competitive Intelligence System.[J].Science Technology and Industrial, 2005.
12 Tsuyoshi, M and Saito, K. Extracting User’s Interest for Web Log Data. Proceeding of IEEE/ACM/WIC International Conference on Web Intelligence (WI’06), 2006.
13 UCI KDD archive, http://kdd.ics.uci.edu/.
14 M. Deshpande and G. Karypis, “Selective Markov Models for Predicting Web Page Accesses,” ACM Trans. Internet Technology, vol. 4, pp. 163-184, May 2004.
15 J. Borges and M. Levene, “Testing the Predictive Power of Variable History Web Usage,” J.Soft Computing, special issue on Web intelligence, 2006.
16 Proceedings of the IEEE International Conference on Tools with Artificial Intelligence, 1999.
17 M. S. Chen, J. S. Park and P. S. Yu, “Efficient Data Mining for Path Traversal Patterns in a Web Environment”, IEEE Transaction on Knowledge and Data Engineering, 1998.
18 M. Craven, S. Slattery and K. Nigam, “First-Order Learning for Web Mining”, In Proceedings of the 10th European Conference on Machine Learning, Chemnitz, 1998.
19 Tsuyoshi, M and Saito, K. Extracting User’s Interest for Web Log Data. Proceeding of IEEE/ACM/WIC International Conference on Web Intelligence (WI’06), 2006.
Professor V V R Maheswara Rao
Shri Vishnu Engineering College for Women - India
Mahesh_vvr@yahoo.com
Dr. V Valli Kumari
- India