Skip to main content

Extraction of Dynamic User Behaviors from Web Logs

  • Conference paper
Intelligent Data Engineering and Automated Learning (IDEAL 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2690))

  • 972 Accesses

Abstract

Our paper proposes an approach which makes possible prediction of future states to be visited in k steps corresponding to k web pages hyper-linked, based on both content and traversed paths. To make this prediction possible, three concepts have been highlighted. The first one represents user exploration sessions by Markov models. The second one avoids the problem of Markov model high-dimensionality and sparsely by clustering web documents, based on their content, before applying Markov analysis. The third one extracts the most representative user behaviors (represented by Markov models) by considering a clustering method. The original application of the approach concerns the exploitation of multimedia archives in the perspective of the Copyright Deposit that preserves French’s WWW documents. The approach may be the exploitation tool for any web site.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rabiner, L.R.: A tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proc. of IEEE 77(2), 257–286 (1989)

    Article  Google Scholar 

  2. Hu, J., Brown, M.K., Turin, W.: HMM based on-line handwriting recognition. IEEE Trans. Pattern Analysis and Machine Intelligence 18(10), 1039–1045 (1996)

    Article  Google Scholar 

  3. Hughey, R., Krogh, A.: Hidden Markov Model for sequence analysis: extension and analysis of the basic method. Comp. Appl. in the Biosciences 12, 95–107 (1996)

    Google Scholar 

  4. Eickeler, S., Kosmala, A., Rigoll, G.: Hidden Markov Model based online gesture recognition. In: Proc. Int. Conf. on Pattern Recognition (ICPR), pp. 1755–1757 (1998)

    Google Scholar 

  5. Jebara, T., Pentland, A.: Action Reaction Learning: Automatic Visual Analysis and Synthesis of interactive behavior. In: 1st Intl. Conf. on Computer Vision Systems (ICVS 1999) (1999)

    Google Scholar 

  6. Rabiner, L.R., Lee, C.H., Juang, B.H., Wilpon, J.G.: HMM Clustering for Connected Word Recognition. In: Proceedings of IEEE ICASSP, pp. 405–408 (1989)

    Google Scholar 

  7. Lee, K.F.: Context-Dependent Phonetic Hidden Markov Models for Speaker Independent Continuous Speech Recognition. IEEE Transactions on Acoustics, Speech and Signal Processing 38(4), 599–609 (1990)

    Article  Google Scholar 

  8. Smyth, P.: Clustering sequences with HMM. In: Mozer, M., Jordan, M., Petsche, T. (eds.) Advances in Neural Information Processing, vol. 9. MIT Press, Cambridge (1997)

    Google Scholar 

  9. Smyth, P.: Clustering sequences with hidden markov models. In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) NIPS-WS 1996, vol. 9 (1997)

    Google Scholar 

  10. Li, C., Biswas, G.: Clustering Sequence Data using Hidden Markov Model Representation. In: SPIE 1999 Conference on Data Mining and Knowledge Discovery: Theory, Tools, and Technology, pp. 14–21 (1999)

    Google Scholar 

  11. Li, C., Biswas, G.: A Bayesian Approach to Temporal Data Clustering using Hidden Markov Models. In: Intl. Conference on Machine Learning, pp. 543–550 (2000)

    Google Scholar 

  12. Schwarz, G.: Estimating the dimension of a model. The Annals of Statistics 6(2), 461–464 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  13. Stolcke, A., Omohundro, S.: Hidden Markov Model Induction by Bayesian Model Merging. In: Hanson, S.J., Cowan, J.D., Giles, C.L. (eds.) Advances in Neural Information Processing Systems, vol. 5, pp. 11–18 (1993)

    Google Scholar 

  14. Cheeseman, P., Stutz, J.: Bayesian Classification (autoclass): Theory and Results. In: Advances in Knowledge discovery and data mining, pp. 153–180 (1996)

    Google Scholar 

  15. Law, M.H., Kwok, J.T.: Rival penalized competitive learning for model-based sequence. In: Proceedings Intl Conf. on Pattern Recognition (ICPR), vol. 2, pp. 195–198 (2000)

    Google Scholar 

  16. Cadez, I., Ganey, S., Smyth, P.: A general probabilistic framework for clustering individuals. Technical report, Univ. Calif., Irvine (March 2000)

    Google Scholar 

  17. Smyth, P.: Probabilistic model-based clustering of multivariate and sequential data. In: Proc. of 7th Int. Workshop AI and Statistics, pp. 299–304 (1999)

    Google Scholar 

  18. Ni, Z.: Normal orthant probabilities in the equicorrelated case. Jour. Math. Analysis and Applications 246, 280–295 (2000)

    Article  MATH  Google Scholar 

  19. Ng, R.T., Han, J.: CLARANS: A Method for Clustering Objects for Spatial Data Mining. TJDE 14(5), 1003–1016 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hafri, Y., Bachimont, B., Stachev, P. (2003). Extraction of Dynamic User Behaviors from Web Logs. In: Liu, J., Cheung, Ym., Yin, H. (eds) Intelligent Data Engineering and Automated Learning. IDEAL 2003. Lecture Notes in Computer Science, vol 2690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45080-1_80

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45080-1_80

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40550-4

  • Online ISBN: 978-3-540-45080-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics