Potential Mining of High-Utility Itemsets Using an Effective Algorithm
Abstract
High-utility itemset
mining (HUIM) or more generally utility mining. To give an overview explains
why it is interesting, and provide source code of Java implementations of the
state-of-the-art algorithms for this problem, and datasets. To address these
limitations, the problem of frequent itemset mining has been redefined as the
problem of high-utility itemset mining. In this problem, a transaction database
contains transactions where purchase quantities are taken into account as well
as the unit profit of each item. high-utility itemset mining is to find the
itemsets (group of items) that generate a high profit in a database when they
are sold together. It is considered to be a high-utility itemset. In general,
the utility of an itemset in a transaction is the quantity of each item from
the itemset multiplied by their unit profit.
Country : India
1 Naresh Katkuri
Associate Professor, Department of Computer Science and Engineering, Malla Reddy College of Engineering for Women, Hyderabad -500100, Telangana, India
R. Agrawal , T. Imielinski, A. Swami,
1993, mining association rules between sets of items in large databases, in:
proceedings of the ACM SIGMOD International Conference on Management of data,
pp. 207-216.
R. Agrawal, R Srikant, Fast
algorithms for mining association rules,in : Proceedings of 20th international
Conference on Very Large Databases ,Santiago, Chile, 1994, pp.487-499
K. Ali , S.Manganaris, R.Srikant ,
Partial classification using association rules, in:Proceeedings of the 3rd
International Conference on Knowledge Discovery and Data Mining , Newport
Beach, California, 1997, pp. 115-118.
C.F.Ahmed , S.K.Tanbeer, Jeong
Byeong-Soo, Lee Young-Koo, Efficient tree structures for high utility pattern
mining in incremental databases, in: IEEE Transactions on Knowledge and Data
Engineering 21(12) (2009).
R.J.Bayardo, Efficiently mining long
patterns from databases, in:Prodeedings of the 1998 ACM SIGMOD International
Conference on Management of Data, Seattle, 1998, pp.85-93.
J.Bayardo, R.Agarwal ,D.Gunopulos,
Constraint based rule mining in large databases , in:Proceedings of the 15th
International Conference on Data Engineering, Sydney, Australia, 1999,pp.188-
197.
B.Barber, H.J Hamilton , Extracting
share frequency itemsets with infrequent subsets, Data Mining and Knowledge
Discovery 7(2) (2003)153-185.
C.H. Cai , A.W.C Fu, C.H.Cheng , w.W.
Kwong, Mining association rules with weighted items,in:Proceedings of IEEE
International Database Engineering and Applications Symposium, Cardiff, United
kingdom, 1998, pp.68-77.
Chan , Q.Yang,Y.D Shen, Mining high
utility itemsets, in:Proceedings of the 3rd IEEE International Conference on
Data Mining , Melbourne , Florida, 2003, pp.19-26.
G.Dong , J.Li, Efficient mining of
emerging patterns :discovering trends and differences, in:Proceedings of the
5th international Conference on Knowledge Discovery and Data Mining ,San Diego,
199, pp.43-52.
A.Erwin, R.P.Gopalan,N.R.Achuthan,
Efficient mining of high utility itemsets from large datasets, in: Advances in
Knowledge Discovery , Springer Lecture Notes in Computer Science , volume
5012/2008, pp. 554-561.
J Han, J.Pei, Y.Yin ,R. Mao Mining
frequent Patterns without candidate generation:a frequent -pattern tree
approach , Data Mining and Knowledge Discovery 8(1)(2004) 53-87.
J.Hu, A. Mojsilovic, High-utility
pattern mining: A method for discovery of high-utility ietmsets,in :Pattern
Recognition 40(2007) 3317-3324.
