Skip to main content
SpringerLink
Log in

FOL-Mine - A More Efficient Method for Mining Web Access Pattern

  • Conference paper
Advances in Computing and Communications (ACC 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 191))

Included in the following conference series:

  • 1398 Accesses

Abstract

In this paper, we propose an efficient sequential access pattern mining algorithm, FOL-mine. The FOL-mine algorithm is based on the projected data base of each frequent event and eliminates the need for construction of pattern tree. First Occurrence List, the Basic data structure used in the algorithm, manages suffix building very efficiently. There is no need to rebuild the projection databases. Experimental analysis of the algorithms reveals significant performance gain over other access pattern mining algorithms.

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

Access this chapter

Log in via an institution
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. Kosala, R., Blockeel, H.: Web Mining Research: A Survey. ACM SIGKDD Explorations 2, 1–15 (2000)

    Article  Google Scholar 

  2. Srivastava, J., Cooley, R., Deshpande, M., Tan, P.N.: Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data. ACM SIGKDD Explorations 1, 12–23 (2000)

    Article  Google Scholar 

  3. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: 20th International Conference on Very Large Databases, Santiago, Chile, pp. 487–499 (1994)

    Google Scholar 

  4. Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: 11th International Conference on Data Engineering, Taipei, Taiwan, pp. 3–14 (1995)

    Google Scholar 

  5. Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance improvements. In: 5th International Conference on Extending Database Technology (EDBT), Avignon, France, pp. 3–17 (1996)

    Google Scholar 

  6. Pei, J., Han, J., Mortazavi-asl, B., Zhu, H.: Mining Access Patterns Efficiently from Web Logs. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol. 1805, pp. 396–407. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Lu, Y., Ezeife, C.I.: Position Coded Pre-order Linked WAP-Tree for Web Log Sequential Pattern Mining. In: Whang, K.-Y., Jeon, J., Shim, K., Srivastava, J. (eds.) PAKDD 2003. LNCS (LNAI), vol. 2637, pp. 337–349. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Zhou, B., Hui, S.C., Fong, A.: CS-Mine: An Efficient WAP-Tree Mining for Web Access Patterns. In: Yu, J.X., Lin, X., Lu, H., Zhang, Y. (eds.) APWeb 2004. LNCS, vol. 3007, pp. 523–532. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Zhou, B., Hui, S.C., Fong, A.C.M.: Efficient Sequential Access Pattern Mining for Web Recommendations. Int.J. Knowledge based and Intelligent Engineering Systems (2006)

    Google Scholar 

  10. Tang, P., Turkia, M.P., Gallivan, K.A.: Mining web access patterns with first-occurrence linked WAP-trees. In: 16th International Conference on Software Engineering and Data Engineering (SEDE 2007), Las Vegas, USA, pp. 247–252 (2007)

    Google Scholar 

  11. Pearson, E.A., Tang, P.: Mining Frequent Sequential Patterns with First-Occurrence Forests. In: 46th ACM Southeastern Conference (ACMSE), Auburn, Alabama, pp. 34–39 (2008)

    Google Scholar 

  12. Lu, Y., Ezeife, C.I.: PLWAP sequential Mining: open source code. In: First International Workshop on Open Source Data Mining: Frequent Patterns Mining Implementation, Chicago, Illinois, pp. 26–35 (2005)

    Google Scholar 

  13. Rajimol, A., Raju, G.: Web Acces Pattern Mining – A Survey. In: 2nd International Conference on Data Engineering and Management (ICDEM 2010), LNCS, vol. 6144, Springer, Heidelberg (2010)

    Google Scholar 

  14. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufman, San Francisco (2007)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of computer Science, Mahatma Gandhi University, Kottayam, Kerala, India

    A. Rajimol

  2. Department of IT, Kannur University, Kannur, Kerala, India

    G. Raju

Authors
  1. A. Rajimol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Raju
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Machine Intelligence Research Labs (MIR Labs), Auburn, 98071-2259, Washington, USA

    Ajith Abraham

  2. Departamento de Comunicaciones, Universidad Politcnica de Valencia, 46071, Valencia, Spain

    Jaime Lloret Mauri

  3. Avaya Labs Research, Basking Ridge, NJ, USA

    John F. Buford

  4. University of Massachusetts, 100 Morrissey Blvd., 02125-3393, Boston, MA, USA

    Junichi Suzuki

  5. Rajagiri School of Engineering and Technology, Rajagiri Valley, Kakkanad, 682 039, Kochi, India

    Sabu M. Thampi

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rajimol, A., Raju, G. (2011). FOL-Mine - A More Efficient Method for Mining Web Access Pattern. In: Abraham, A., Lloret Mauri, J., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22714-1_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22714-1_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22713-4

  • Online ISBN: 978-3-642-22714-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation