Open Access   Article Go Back

Efficient Approach for Mining High Utility Itemsets From Transactional Databases

P.S. Prakash1 , S. Anandamurugan2

Section:Research Paper, Product Type: Journal Paper
Volume-2 , Issue-9 , Page no. 178-184, Sep-2014

Online published on Oct 04, 2014

Copyright © P.S. Prakash, S. Anandamurugan . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: P.S. Prakash, S. Anandamurugan, “Efficient Approach for Mining High Utility Itemsets From Transactional Databases,” International Journal of Computer Sciences and Engineering, Vol.2, Issue.9, pp.178-184, 2014.

MLA Style Citation: P.S. Prakash, S. Anandamurugan "Efficient Approach for Mining High Utility Itemsets From Transactional Databases." International Journal of Computer Sciences and Engineering 2.9 (2014): 178-184.

APA Style Citation: P.S. Prakash, S. Anandamurugan, (2014). Efficient Approach for Mining High Utility Itemsets From Transactional Databases. International Journal of Computer Sciences and Engineering, 2(9), 178-184.

BibTex Style Citation:
@article{Prakash_2014,
author = {P.S. Prakash, S. Anandamurugan},
title = {Efficient Approach for Mining High Utility Itemsets From Transactional Databases},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {9 2014},
volume = {2},
Issue = {9},
month = {9},
year = {2014},
issn = {2347-2693},
pages = {178-184},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=272},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=272
TI - Efficient Approach for Mining High Utility Itemsets From Transactional Databases
T2 - International Journal of Computer Sciences and Engineering
AU - P.S. Prakash, S. Anandamurugan
PY - 2014
DA - 2014/10/04
PB - IJCSE, Indore, INDIA
SP - 178-184
IS - 9
VL - 2
SN - 2347-2693
ER -

VIEWS PDF XML
3454 3424 downloads 3543 downloads
  
  
           

Abstract

Mining high utility item sets from transactional database refers to the discovery of item sets with high utility like profits. Although a number of relevant algorithms have been proposed in recent years, they incur the problem of producing a large number of candidate item sets for high utility item sets. Such a large number of candidate item sets degrades the mining performance in terms of execution time and space requirement. The situation may become worse when the database contains lots of long transactions or long high utility item sets. An algorithm, namely UP-Growth proposed [7] for mining high utility item sets with a set of effective strategies for pruning candidate item sets. The information of high utility item sets is maintained in a tree-based data structure named UP-Tree such that candidate item sets can be generated efficiently with only two scans of database. Experimental results show that the proposed algorithm, especially UP-Growth, not only reduce the number of candidates effectively but also outperform other algorithms substantially in terms of runtime, especially when databases contain more no of transactions.

Key-Words / Index Term

High Utility Itemsets, Datamining, Transactional Database

References

[1] Ahmed.C. F, Tanbeer.S. K,Jeong.B.S and Lee.Y.K �Efficient tree structures for high utility pattern mining in incremental databases�, IEEE Transactions onKnowledge and Data Engineering, Vol. 21, Issue 12, pp. 1708- 1721, 2009
[2] Chan.R, Yang.Q and Shen.Y �Mining high utility itemsets�, in Proc. of Third IEEE Int`l Conf. on Data Mining, pp. 19-26, 2003
[3] Cai.C. H, Fu.A. W. C, Cheng.C. H and Kwong.W. W �Mining Association Rules with Weighted Items�, in Proc. of the Int�l Database Engineering and Applications Symposium (IDEAS 1998), pp. 68-77, 1998
[4] Erwin.A, Gopalan.R. P and Achuthan.N. R �Efficient mining of high utility itemsets from large datasets�, in Proc. of PAKDD , LNA 5012, pp. 554- 561, 2008
[5] Han.J,Pei.J, Yin.Y �Mining frequent patterns without candidate generation�,inProc. of the ACM-SIGMOD Int`l Conf. on Management of Data, pp. 1-12, 2000
[6] Liu.Y, Liao.W and Choudhary.A �A fast high utility itemsets mining algorithm�, in Proc. of the Utility-Based Data Mining Workshop, 2005
[7] Vincent S. Tseng, Bai-En Shie, Cheng-Wei Wu, and Philip S. Yu �Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases�, IEEE Transactions on Knowledge and Data Engineering, 2012