Skip to main content

Novel and Efficient Hybrid Strategies for Constraining the Search Space in Frequent Itemset Mining

  • Chapter
Trends in Intelligent Systems and Computer Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 6))

  • 804 Accesses

Association rule mining was originally applied in market basket analysis which aims at understanding the behaviour and shopping preferences of retail customers. The knowledge is used in product placement, marketing campaigns, and sales promotions. In addition to the retail sector, the market basket analysis framework is also being extended to the health and other service sectors. The application of association rule mining now extends far beyond market basket analysis and includes detection of network intrusions, attacks from Web server logs, and prediciting user traversal patterns on the Web.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Ceglar, A. and Roddick, J.F. (2006). Association mining, ACM Computing Surveys, vol. 38, no. 2.

    Google Scholar 

  2. Agrawal, R., Imielinski T., and Swami, A. (1993). Mining association rules between sets of items in large databases, ACM SIGMOD Conference on Management of Data.

    Google Scholar 

  3. Davey, B.A. and Priestley, H.A. (1990). Introduction to Lattices and Order, Cambridge University Press, UK.

    MATH  Google Scholar 

  4. Shenoy, P. et al. (2000). Turbo charging vertical mining of large databases, International Conference on Management of Data.

    Google Scholar 

  5. Zaki, M.J. (2000). Scalable algorithms for association mining, IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 3, pp. 372–390.

    Article  MathSciNet  Google Scholar 

  6. Zaki, M.J. and Gouda, K. (2003). Fast vertical mining using diffsets, SIGKDD’.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Kalpana, B., Nadarajan, R. (2008). Novel and Efficient Hybrid Strategies for Constraining the Search Space in Frequent Itemset Mining. In: Castillo, O., Xu, L., Ao, SI. (eds) Trends in Intelligent Systems and Computer Engineering. Lecture Notes in Electrical Engineering, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74935-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-74935-8_21

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-74934-1

  • Online ISBN: 978-0-387-74935-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics