Mining Interest Navigation Patterns Based on Hybrid Markov Model

  • Yijun Yu
  • Huaizhong Lin
  • Yimin Yu
  • Chun Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4027)


Each user accesses a Website with certain interest. The interest is associated with his navigation patterns. The interest navigation patterns represent different interest of the users. In this paper, hybrid Markov model is proposed for interest navigation pattern discovery. The novel model is better in prediction overlay rate and prediction correct rate than traditional Markov models. User group interest is also defined in this paper. The probability of user group interest navigation from one page to another is computed by navigation path characteristics and time characteristics. Compared with the previous ones, the results of the experiment show that the performance is improved efficiently by the hybrid Markov model.


Markov Model User Group User Access Output Symbol Path Pattern 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wexelblat, A., Maes, P.: Footprints:History-rich Web browsing. In: The CHI 1999 Conference on Human Factors in Computing Systems (CHI 1999), pp. 270–277. ACM, Pittsburgh (1999)Google Scholar
  2. 2.
    Bettina, B., Andreas, H., Dunja, M., Maarten, V.S., Myra, S., Gerd, S.: Web Mining: From Web to Semantic Web. In: First European Web Mining Forum, EMWF 2003, Cavtat-Dubrovnik, Croatia (2003)Google Scholar
  3. 3.
    Zaiane, O.R., Srivastava, J., Spiliopoulou, M., Masand, B.M.: Mining Web Data for Discovering Usage Patterns and Profiles. In: 4th International Workshop, pp. 19–29. Springer, Edmonton (2002)Google Scholar
  4. 4.
    Borges, J., Levene, M.: A Heuristic to Capture Longer User Web Navigation Patterns. In: Bauknecht, K., Madria, S.K., Pernul, G. (eds.) EC-Web 2000. LNCS, vol. 1875, pp. 155–164. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Papoulis, A.: Probability, random variables, and stochastic processes. McGraw Hill, New York (1991)Google Scholar
  6. 6.
    Mogul, J.C., Chan, Y., Kelly, T.: Design, Implementation and Evaluation of Duplicate Transfer Detection in HTTP. NSDI, 43–56 (2004)Google Scholar
  7. 7.
    Sarukkai, R.: Link prediction and path analysis using Markov chains. Computer Networks 33(1-6), 377–386 (2000)CrossRefGoogle Scholar
  8. 8.
    Borges, J., Levene, M.: Generating Dynamic Higher-Order Markov Models in Web Usage Mining. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS, vol. 3721, pp. 34–45. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Pirolli, P., Fu, W.: SNIF-ACT: A Model of Information Foraging on the World Wide Web. In: Brusilovsky, P., Corbett, A.T., de Rosis, F. (eds.) UM 2003. LNCS, vol. 2702, pp. 45–54. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yijun Yu
    • 1
  • Huaizhong Lin
    • 1
  • Yimin Yu
    • 1
  • Chun Chen
    • 1
  1. 1.Computer InstituteZhejiang UniversityHangzhouChina

Personalised recommendations