Skip to main content

Study of Visitor Behavior by Web Usage Mining

  • Conference paper
Information Processing and Management (BAIP 2010)

Abstract

Web usage mining focuses on discovering the potential knowledge from the browsing patterns of users and to find the correlation between the pages on analysis. With exponential growth of web log, the conventional data mining techniques were proved to be inefficient, as they need to be re-executed every time. As web log is incremental in nature, it is necessary for web miners to use incremental mining techniques to extract the usage patterns and study the visiting characteristics of user. The data on the web log is heterogeneous and non scalable, hence we require an improved algorithm which reduces the computing cost significantly.

This paper discusses an algorithm to suit for continuously growing web log, based on association rule mining with incremental technique. The algorithm is proved to be more efficient as it avoids the generation of candidates, reduces the number of scans and allows interactive mining with different supports. To validate the efficiency of proposed algorithm, several experiments were conducted and results proven this are claimed.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Savasere, A., Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: Proceedings of the VLDB Conference (1995)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. VLDB, 487–499 (1994)

    Google Scholar 

  3. Brin, S., Motwani, R., Ullman Jeffrey, D., Shalom, T.: Dynamic itemset counting and implication rules for market basket data. In: SIGMOD (1997)

    Google Scholar 

  4. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: SIGMOD, pp. 1–12 (2000)

    Google Scholar 

  5. Pei, J., Han, J., Nishio, S., Tang, S., Yang, D.: H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases. In: Proc. 2001 Int. Conf. on Data Mining (2001)

    Google Scholar 

  6. Chen, M.S., Huang, X.M., Lin, I.Y.: Capturing User Access Patterns in the Web for Data Mining. In: Proceedings of the IEEE International Conference on Tools with Artificial Intelligence, pp. 345–348 (1999)

    Google Scholar 

  7. Brown, C.M., Danzig, B.B., Hardy, D., Manber, U., Schwartz, M.F.: The harvest information discovery and access system. In: Proc. 2nd International World Wide Web Conference (1994)

    Google Scholar 

  8. Frakes, W.B., Baeza-Yates, R.: Infomation Retrieval Data Structures and Algorithms. Prentice Hall, Englewood Cliffs (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rao, V.V.R.M., Kumari, V.V., Raju, K.V.S.V.N. (2010). Study of Visitor Behavior by Web Usage Mining. In: Das, V.V., et al. Information Processing and Management. BAIP 2010. Communications in Computer and Information Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12214-9_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12214-9_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12213-2

  • Online ISBN: 978-3-642-12214-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics