Skip to main content

A Unified Approach to Web Usage Mining Based on Frequent Sequence Mining

  • Conference paper
  • 2056 Accesses

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

Abstract

This paper gives a method to treat Web usage mining as requent sequence mining. It provides a unified representation of three different types of source for Web usage mining. The source include an access log recorded in a Web server, the hypertext documents, and the hype-text structure or the graph of linkage. All of these information are represented as sequences. An efficient sequence mining PrefixSpan is inspected to mine with the unified information and an extension of PrefixSpan is proposed for our purpose. A preliminary experiment is also explained.

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   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. 20th Int’l Conf. Very Large Data Bases, pp. 487–499 (1994)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proc. 11th Int’l Conf. Data Engineering, pp. 3–14 (1995)

    Google Scholar 

  3. Han, J., et al.: FreeSpan:Frequent Pattern-Projected Sequential Pattern Mining. In: Proc. 6th ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining, pp. 355–359. ACM Press, New York (2000)

    Google Scholar 

  4. Han, J., et al.: Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach. IEEE Trans. Knowledge and Data Engineering 16(11), 1424–1440 (2004)

    Article  Google Scholar 

  5. Tzvetkov, P.D., Yan, X.D., Han, J.D.: TSP: Mining Top-K Closed Sequential Patterns. In: Proc. 3rd IEEE Int’l Conf. on Data Mining, pp. 347–354 (2003)

    Google Scholar 

  6. Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Proc. 5th Int’l Conf. Extending Database Technology, pp. 3–17 (1996)

    Google Scholar 

  7. Chen, M., Park, J., Yu, P.: Data mining for path traversal patterns in a Web envirionment. In: Proc. 16th Int’l Conference on Distributed Computing Systems, pp. 385–392 (1996)

    Google Scholar 

  8. Srivastava, J., Cooley, R., Deshpande, M., Tan, P.: Web usage mining: Discovery and applications of usage pattern from web data. SIGKDD Explorations 1(2), 12–23 (2000)

    Article  Google Scholar 

  9. Yan, T.W., Jacobsen, M., Garcia-Molina, H., Dayal, U.: From User Access Patterns to Dynamic Hypertext Linking. In: Proc. 5th Int’l World Wide Web Conference, pp. 1007–1014 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Inuzuka, N., Hayakawa, Ji. (2007). A Unified Approach to Web Usage Mining Based on Frequent Sequence Mining. In: Apolloni, B., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2007. Lecture Notes in Computer Science(), vol 4693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74827-4_123

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74827-4_123

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74826-7

  • Online ISBN: 978-3-540-74827-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics