Skip to main content

Using Markov Chains for Structural Link Prediction in Adaptive Web Sites

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2109))

Abstract

My research investigates into using Markov chains to make link prediction and the transition matrix derived from Markov chains to acquire structural knowledge about Web sites. The structural knowledge is acquired in the form of three types of clusters: hierarchical clusters, reference clusters, and grid clusters. The predicted Web pages and acquired Web structures are further integrated to assist Web users in their navigation in the Web site.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Albrecht, D., Zukerman, I., and Nicholson, A.: Pre-sending Documents on the WWW: A Comparative Study. In Proc. of the Sixteenth International Joint Conference on Artificial Intelligence, 1274–1279 (1999).

    Google Scholar 

  2. Hong, J.: Graph Construction and Analysis as a Paradigm for Plan Recognition. In Proc. of the Seventeenth National Conference on Artificial Intelligence, 774–779 (2000).

    Google Scholar 

  3. Perkowitz, M., Etzioni, O.: Adaptive Web Sites: an AI challenge. In Proc. of the Fifteenth International Joint Conference on Artificial Intelligence (1997).

    Google Scholar 

  4. Sarukkai, R.:Link prediction and path analysis using Markov chains. In Proc. 9th WWW (2000).

    Google Scholar 

  5. Spears, W.: A compression algorithm for probability transition matrices. In SIAM Matrix Analysis and Applications, Vol. 20,No.1, 60–77 (1998).

    Article  MATH  MathSciNet  Google Scholar 

  6. Wishart, D.: Efficient Hierarchical Analysis for Data Mining and Knowledge Discovery. Computing Science and Statistics, 30,257–263 (1998).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhu, J. (2001). Using Markov Chains for Structural Link Prediction in Adaptive Web Sites. In: Bauer, M., Gmytrasiewicz, P.J., Vassileva, J. (eds) User Modeling 2001. UM 2001. Lecture Notes in Computer Science(), vol 2109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44566-8_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-44566-8_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42325-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics