An Efficient Data Mining Algorithm for Discovering Web Access Patterns | SpringerLink
Skip to main content

An Efficient Data Mining Algorithm for Discovering Web Access Patterns

  • Conference paper
  • First Online:
Web Technologies and Applications (APWeb 2003)

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

Included in the following conference series:

Abstract

In this paper, we propose a data mining technology to find non-simple frequent traversal patterns in a web environment where users can travel from one object to another through the corresponding hyperlinks. We keep track and remain the original user traversal paths in a web log, and apply the proposed data mining techniques to discover the complete traversal path which is traversed by a sufficient number of users, that is, non-simple frequent traversal patterns, from web logs. The non-simple frequent traversal patterns include forward and backward references, which are used to suggest potentially interesting traversal path to the users. The experimental results show that the discovered patterns can present the complete browsing paths traversed by most of the users and our algorithm outperforms other algorithms in discovered information and execution times.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Agrawal, R. and et al.: Mining Sequential Patterns. Proceedings of the International Conference on Data Engineering (ICDE), (1995) 3–14

    Google Scholar 

  2. Chen M.S., Park, J.S. and Yu, P.S.: Efficient Data Mining for Path Traversal Patterns. IEEE Transactions on Knowledge and Data Engineering (TKDE), (1998) 209–220

    Google Scholar 

  3. Pei, J., Han, J., Mortazavi-asi, B. and Zhu, H.: Mining Access Patterns Efficiently from Web Logs. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), (2000) 396–407

    Google Scholar 

  4. Yen, S.J. and Lee, Y.S.: An Efficient Data Mining Technique for Discovering Interesting Sequential Patterns. Proceedings of the International Conference on Data Mining (ICDM), (2001) 663–664

    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

Yen, SJ., Lee, YS. (2003). An Efficient Data Mining Algorithm for Discovering Web Access Patterns. In: Zhou, X., Orlowska, M.E., Zhang, Y. (eds) Web Technologies and Applications. APWeb 2003. Lecture Notes in Computer Science, vol 2642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36901-5_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-36901-5_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-02354-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics