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

  • M. A. JabbarEmail author
  • B. L. Deekshatulu
  • Priti Chandra
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 424)


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.


Data mining Utility mining Significance weight age Frequent item sets 


  1. 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 1993Google Scholar
  2. 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. 3.
    Shankar, Purusotham.: A novel utility sentient approach for mining interesting association rules. IJET, 454–460 (2009)Google Scholar
  4. 4.
    Podpecan, V., et al.: A fast algorithm for mining utility frequent item sets.
  5. 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. 6.
    Hu, J., Mojsilovic, A.: High-utility pattern mining: a method for discovery of high-utility item sets. Pattern Recogn. 40, 3317–3324 (2007)CrossRefzbMATHGoogle Scholar
  7. 7.
    Pillai, J.: User centric approach to item set utility mining in market basket analysis. IJCSE, 393–399 (2011)Google Scholar
  8. 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. 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. 10.
    Chu, et al.: An efficient algorithm for mining temporal high utility item sets from data streams. JSS, 1105–1117 (2008)Google Scholar
  11. 11.
    Lan, G.C., et al.: A Novel Algorithm for Mining Rare—Utility Item Sets in Multi Data Base Environment (2013)Google Scholar
  12. 12.
    Girish, et al.: Association Rules Mining Using Heavy Item Sets, pp. 148–155. CSI (2005)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • M. A. Jabbar
    • 1
    Email author
  • B. L. Deekshatulu
    • 2
  • Priti Chandra
    • 3
  1. 1.Muffakham Jah College of Engineering and TechnologyHyderabadIndia
  2. 2.IDRBTRBIHyderabadIndia
  3. 3.ASLDRDOHyderabadIndia

Personalised recommendations