Call for Paper - August 2019 Edition
IJCA solicits original research papers for the August 2019 Edition. Last date of manuscript submission is July 20, 2019. Read More

iFUM - Improved Fast Utility Mining

International Journal of Computer Applications
© 2011 by IJCA Journal
Number 11 - Article 6
Year of Publication: 2011
S. Kannimuthu
Dr. K. Premalatha
S. Shankar

S Kannimuthu, Dr. K Premalatha and S Shankar. Article: iFUM - Improved Fast Utility Mining. International Journal of Computer Applications 27(11):32-36, August 2011. Full text available. BibTeX

	author = {S. Kannimuthu and Dr. K. Premalatha and S. Shankar},
	title = {Article: iFUM - Improved Fast Utility Mining},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {27},
	number = {11},
	pages = {32-36},
	month = {August},
	note = {Full text available}


The main goals of Association Rule Mining (ARM) are to find all frequent itemsets and to build rules based of frequent itemsets. But a frequent itemset only reproduces the statistical correlation between items, and it does not reflect the semantic importance of the items. To overcome this limitation we go for a utility based itemset mining approach. Utility-based data mining is a broad topic that covers all aspects of economic utility in data mining. It takes in predictive and descriptive methods for data mining. High utility itemset mining is a research area of utility based descriptive data mining, aimed at finding itemsets that contribute most to the total utility. The well known faster and simpler algorithm for mining high utility itemsets from large transaction databases is Fast Utility Mining (FUM). In this proposed system we made a significant improvement in FUM algorithm to make the system faster than FUM. The algorithm is evaluated by applying it to IBM synthetic database. Experimental results show that the proposed algorithm is effective on the databases tested.


  • Agrawal R, Srikant R, “Fast algorithms for mining association rules”, Proceedings of 20th International Conference on Very Large Databases, Santiago, Chile, pp. 487-499, 1994.
  • Carter C, Hamilton H J, Cercone N, “Share based measures for itemsets”, Proceedings of First European Conference on the Principles of Data Mining and Knowledge Discovery, pp. 14-24, 1997.
  • Hilderman R J Carter C L Hamilton H J Cercone N, “Mining market basket data using share measures and characterized itemsets”, Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 159-170, 1998.
  • Kenneth H. Rosen, "Discrete Mathematics and Its applications", Mc Graw Hill., 4th edition, 298-300.
  • S.Shankar, Dr.T.Purusothaman, S.Jayanthi “A Fast Algorithm for Mining High Utility Itemsets”, IEEE International Advance Computing Conference (IACC 2009) Patiala, India, 6-7 March 2009
  • Shankar.S and T.Purusothaman, “A Novel Utility Sentient Approach for Mining Interesting Association Rules”, IACSIT International Journal of Engineering and Technology Vol.1, No.5, December, 2009, ISSN: 1793-8236
  • S Shankar, T Purusothaman, “Discovering imperceptible associations based on Interestingness: a utility-oriented data mining approach”, Data Science journal, volume 9, 24 February 2010
  • Shankar.S and T.Purusothaman, “Utility Sentient Frequent Itemset Mining and Association Rule Mining: A Literature Survey and Comparative Study”, International Journal of Soft Computing Applications ISSN: 1453-2277 Issue 4 (2009), pp.81-95
  • Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang “Isolated items discarding strategy for discovering high utility itemsets”, Elsevier Journal, Data & Knowledge Engineering 64 (2008) 198–217.
  • Yao H and Hamilton J, “Mining itemset utilities from transaction databases”, Data & KnowledgeEngineering, pp. 59: 603-626, 2006.
  • Yao H, Hamilton H J, Butz C J, “A foundational approach to mining itemset utilities from databases”, Proceedings of the Third SIAM International Conference on Data Mining, Orlando, Florida, pp. 482-486, 2004.