Skip to main content

An Incremental FP-Growth Web Content Mining and Its Application in Preference Identification

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2005)

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

  • 1310 Accesses

Abstract

This paper presents a real application of Web-content mining using an incremental FP-Growth approach. We firstly restructure the semi-structured data retrieved from the web pages of Chinese car market to fit into the local database, and then employ an incremental algorithm to discover the association rules for the identification of car preference. To find more general regularities, a method of attribute-oriented induction is also utilized to find customer’s consumption preferences. Experimental results show some interesting consumption preference patterns that may be beneficial for the government in making policy to encourage and guide car consumption.

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. Cooley, R., Mobasher, B., Srivastava, J.: Web Mining: Information and Pattern Discovery on the World Wide Web (1999), http://www-users.cs.umn.edu/~mobasher/webminer/survey/survey.html

  2. Kushmerick, N.D., Weld, S., Doorenbos, R.: Wrapper induction for information extraction. In: Proceeding of the 15th International Joint Conference on Artificial Intelligence, pp. 729–737 (1997)

    Google Scholar 

  3. Kushmerick, N.: Wrapper induction for information extraction. Ph.D. Dissertation, Dept. of Computer Science, Univ. of Washington, TR UW-CSE-97-11-04 (1997)

    Google Scholar 

  4. Adelberg, B.: NoDOSE - A tool for semi-automatically extracting structured and semistructured data from text documents. In: Proceedings of SIGMOD 1998, pp. 283–294 (1998)

    Google Scholar 

  5. Liu, L., Pu, C., Han, W.: Xwrap: An XML-enabled Wrapper Construction System for Web Information Sources. In: International Conference on Data Engineering, San Diego, CA (2000)

    Google Scholar 

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

    Google Scholar 

  7. Webb, G.L.: Efficient search for association rules. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 99–107 (2000)

    Google Scholar 

  8. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: VLDB 1994, pp. 487–499 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hang, X., Liu, J.N.K., Ren, Y., Dai, H. (2005). An Incremental FP-Growth Web Content Mining and Its Application in Preference Identification. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553939_18

Download citation

  • DOI: https://doi.org/10.1007/11553939_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28896-1

  • Online ISBN: 978-3-540-31990-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics