CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

Efficient High Utility Itemset Mining using Utility Information Record

by Prashant V. Barhate, S. R. Chaudhari, P. C. Gill
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 120 - Number 4
Year of Publication: 2015
Authors: Prashant V. Barhate, S. R. Chaudhari, P. C. Gill
10.5120/21219-3940

Prashant V. Barhate, S. R. Chaudhari, P. C. Gill . Efficient High Utility Itemset Mining using Utility Information Record. International Journal of Computer Applications. 120, 4 ( June 2015), 34-39. DOI=10.5120/21219-3940

@article{ 10.5120/21219-3940,
author = { Prashant V. Barhate, S. R. Chaudhari, P. C. Gill },
title = { Efficient High Utility Itemset Mining using Utility Information Record },
journal = { International Journal of Computer Applications },
issue_date = { June 2015 },
volume = { 120 },
number = { 4 },
month = { June },
year = { 2015 },
issn = { 0975-8887 },
pages = { 34-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume120/number4/21219-3940/ },
doi = { 10.5120/21219-3940 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:05:24.331026+05:30
%A Prashant V. Barhate
%A S. R. Chaudhari
%A P. C. Gill
%T Efficient High Utility Itemset Mining using Utility Information Record
%J International Journal of Computer Applications
%@ 0975-8887
%V 120
%N 4
%P 34-39
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

High utility itemsets refer to the sets of items with high utility like profit in a database, and efficient mining of high utility itemsets plays an important role in many real life applications and is an important research issue in data mining area. In recent years, the problems of high utility pattern mining become one of the most important research areas in data mining. The existing high utility mining algorithm generates large number of candidate itemsets, which takes much time to find utility value of all candidate itemsets. In this paper we are implementing a data structure that stores the utility related to the item and using this data structure we are reducing time and space complexity of UP Growth and UP Growth+ Algorithms. Various Standard and synthetic datasets are used with Educational real data set. An algorithm is proposed to find set of high utility itemset which avoids the candidate itemsets generation.

References
  1. Jyothi Pillai, O. P. Vyas "Overview of Itemset Utility Mining and its Applications" IJCA(0975 – 8887) Volume 5– No. 11, August 2010.
  2. J. Han, H. Cheng, D. Xin, and X. Yan. Frequent pattern mining: Current status and future directions. Data Mining and Knowledge Discovery, 15(1):55–86, 2007.
  3. C. F. Ahmed, S. K. Tanbeer, B. -S. Jeong, and Y. -K. Lee. Efficient tree structures for high utility patternmining in incremental databases. IEEE Transactions onKnowledge and Data Engineering, 21(12):1708–1721,2009.
  4. Frequent Itemset Mining Implementations Repository, http://fimi. cs. helsinki. fi/, 2013.
  5. Vincent S. Tseng, Bai-En Shie, Cheng Wei Wu, and Philip S. Yu, Fellow, "Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases" IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 25, NO. 8, AUGUST 2013.
  6. Y. Liu, W. Liao, and A. Choudhary. A fast high utility itemsets mining algorithm. In Proc. of the Utility-Based Data Mining Workshop, 2005.
  7. C. F. Ahmed, S. K. Tanbeer, B. -S. Jeong, and Y. -K. Lee. Efficient tree structures for high utility pattern mining in incremental databases. In IEEE Transactions on Knowledge and Data Engineering, Vol. 21, Issue 12, pp. 1708-1721, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Utility Utility Information Record Effective High Utility Itemset Mining