Skip to main content

Research of Weighted Frequent Patterns Algorithm Based on Web-Log Mining

  • Conference paper

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

Abstract

Web log mining is one of web mining. The process of the Web log mining is introduced. This paper proposes the WFPM algorithm which is improved according to FP-Growth and uses it to mine the weblogs. The new algorithm can find the weighted frequent patterns between pages in the webs, and then helps web managers or companies to improve the web designs or business decisions. The experiments show that in the process of using WFPM algorithm is more efficient in time and space.

This work is partially supported by Henan Science and Technology Development Plan Project #092300410040.

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cooley, R.: Web Usage Mining: Discovery and Application of Interesting Patterns from Web data. PhD thesis, Dept. of Computer Science, University of Minnesota (May 2000)

    Google Scholar 

  2. Lin, W., Alaverz, S.A., Ruiz, C.: Efficient Adaptive-Support Association Rule Mining for Recommendation Systems. Data Mining and Knowledge Discovery 6, 83–105 (2002)

    Article  MathSciNet  Google Scholar 

  3. Agrawal, R., Srikant, R.: Fast algorithms for mining association. In: Proc. of the 20th Int’ l Conf. on Very Large Database, pp. 487–499 (1994)

    Google Scholar 

  4. Han, J., Pei, J., Yin, Y.w.: Mining frequent patterns without candidate generation. In: Proceedings of the 19 th ACM SIG MOD, ACM SIG MOD 2000, Dallas, TX, USA, pp. 1–12 (2000)

    Google Scholar 

  5. Cai, C.H., Fu Ada, W.C., Cheng, C.H., et al.: Mining association rules with weighted items. In: Proc. of the Int’ l Database Engineering and Applications Symposium, pp. 68–77 (1998)

    Google Scholar 

  6. Weimin, O., Cheng, Z., Qingsheng, C.: Database, the development of the weighted association rules. Journal of Software 12(4), 612–619 (2001)

    Google Scholar 

  7. Zhang, W., Lu, J.: Weighted Boolean type of association rules. Computer Engineering 29(9), 55–57 (2003)

    Google Scholar 

  8. Yu, G., Sen, W., Adon, Y.: Weighted association rules, etc. Of the improved algorithm. Computer Engineering and Application 40(22), 177–179 (2004)

    Google Scholar 

  9. Wang, Y., Jiang, B., Song, J.: A new weighted association rule model. Computer Engineering and Application 42(5), 162–164 (2006)

    Google Scholar 

  10. Yang, J., Liu, N., Lan, T.: Weighted maximum frequent itemsets. Mining algorithm. Computer and Microelectronics 25(6), 123–126 (2008)

    Google Scholar 

  11. Yan, Y., Daling, W.: Support personalized recommendation Web page algorithm for mining association rules. Computer Science and Engineering 31(1), 79–81 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zou, L., Xue, H. (2011). Research of Weighted Frequent Patterns Algorithm Based on Web-Log Mining. In: Zeng, D. (eds) Applied Informatics and Communication. ICAIC 2011. Communications in Computer and Information Science, vol 224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23214-5_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23214-5_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23213-8

  • Online ISBN: 978-3-642-23214-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics