Skip to main content

A Novel Algorithm for Utility-Frequent Itemset Mining in Market Basket Analysis

  • Conference paper
  • First Online:
Book cover Innovations in Bio-Inspired Computing and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 424))

Abstract

Data mining has made a significant impact on business and knowledge management in recent years. Data mining also known as KDD is a powerful new technology having great potential to analyze useful information stored in large data bases. Association rule mining is an active research area, used to find association and/or correlation among frequent item sets. Association rule mining discover frequent item sets with out considering total cost, quantity and number of items in a transaction. Utility based frequent item set mining is a new research area, which provide importance to sale quantity and price among items in a transaction. In this paper, we have proposed a novel approach for utility frequent item set mining. Our method mines novel frequent item sets by giving importance to items quantity, significance weightage, utility and user defined support. Our approach can be used to provide valuable recommendation to the enterprise to improve business utility.

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

References

  1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD, International Conference on Mobile Data Management, Washington, D.C., pp. 207–216, May 1993

    Google Scholar 

  2. Yao, H., Hamilton, et al.: A foundational approach to mining item set utilities from data bases. In. SIAM International Conference, pp. 428–486 (2004)

    Google Scholar 

  3. Shankar, Purusotham.: A novel utility sentient approach for mining interesting association rules. IJET, 454–460 (2009)

    Google Scholar 

  4. Podpecan, V., et al.: A fast algorithm for mining utility frequent item sets. http://citeseerx.ist.psu.edu

  5. Pillai, J., Vyas, O.P.: Overview of item set utility mining and its applications. Int. J. Comput. Appl. (0975–8887), 5(11), 9–13 (2010)

    Google Scholar 

  6. Hu, J., Mojsilovic, A.: High-utility pattern mining: a method for discovery of high-utility item sets. Pattern Recogn. 40, 3317–3324 (2007)

    Article  MATH  Google Scholar 

  7. Pillai, J.: User centric approach to item set utility mining in market basket analysis. IJCSE, 393–399 (2011)

    Google Scholar 

  8. Yeh, J.S., et al.: Two phase algorithms for a novel utility frequent mining model. In: PAKDD 2007, LNAI, pp. 433–444 (2007)

    Google Scholar 

  9. Kumar, P., et al.: Discovery of frequent item sets based on minimum quantity and support. IJCSS 3(3), 216–225(2011)

    Google Scholar 

  10. Chu, et al.: An efficient algorithm for mining temporal high utility item sets from data streams. JSS, 1105–1117 (2008)

    Google Scholar 

  11. Lan, G.C., et al.: A Novel Algorithm for Mining Rare—Utility Item Sets in Multi Data Base Environment (2013)

    Google Scholar 

  12. Girish, et al.: Association Rules Mining Using Heavy Item Sets, pp. 148–155. CSI (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. A. Jabbar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Jabbar, M.A., Deekshatulu, B.L., Chandra, P. (2016). A Novel Algorithm for Utility-Frequent Itemset Mining in Market Basket Analysis. In: Snášel, V., Abraham, A., Krömer, P., Pant, M., Muda, A. (eds) Innovations in Bio-Inspired Computing and Applications. Advances in Intelligent Systems and Computing, vol 424. Springer, Cham. https://doi.org/10.1007/978-3-319-28031-8_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28031-8_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28030-1

  • Online ISBN: 978-3-319-28031-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics