Systolic Tree Algorithms for Discovering High Utility Item sets from Transactional Database
Keywords:
utility pattern growth, systolic tree, high utility itemsetsAbstract
Utility mining emerges as an important topic in data mining field. Here high utility item sets mining refers to importance or profitability of an item to users. Efficient mining of high utility item sets plays an important role in many re al-life applications and is an important research issue in data mining area. Number of Algorithms utility pattern growth (UP-Growth) and UP-Growth+( A data structure having tree like structure named utility pattern tree (UP-Tree)) is used for storing the information about high utility item set such that by using only double scanning of database, candidate item sets can be efficiently generate. But that will lead to high requirement of space and time and so that performance will be less. So a new algorithm i s proposed in this paper, for efficient discovering of high utility item sets from transactional database.
References
. Vincent S.Tseng,Bai-En Shie,Cheng-wei Wu ,and Philip S,Yu,Fellow,IEEE “Efficient algorithm for Mining High Utility Itamset”, 2012
. Song Sun and Joseph Zambreno, Member of IEEE,” Design and Analysis of a Reconfigurable Platform for Frequent Pattern Mining,”, 2011
. Erwin, R.P. Gopalan, and N.R. Achuthan, “Efficient Mining of High Utility Itemsets from Large Data Sets,” Proc. 12th Pacific-Asia Conf. Advances in Knowledge Discovery and Data Mining (PAKDD), pp. 554-561, 2009
. C.F. Ahmed, S.K. Tanbeer, B.-S. Jeong and Y.-K. Lee, “Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases,” IEEE Trans. Knowledge and Data Eng., vol. 21, no. 12,pp. 1708-1721, Dec. 2008.
. C.H. Cai, A.W.C. Fu, C.H. Cheng, and W.W. Kwong, “Mining Association Rules with Weighted Items,” Proc. Int’l Database Eng. and Applications Symp. (IDEAS ’98), pp. 68-77, 1998.
. M.-S. Chen, J.-S. Park, and P.S. Yu, “Efficient Data Mining for Path Traversal Patterns,” IEEE Trans. Knowledge and Data Eng., vol. 10,
no. 2, pp. 209-221, Mar. 1998.
. R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 20th Int’l Conf. Very Large Data Bases (VLDB), pp. 487-499, 1994.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 COMPUSOFT: An International Journal of Advanced Computer Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
©2023. COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY by COMPUSOFT PUBLICATION is licensed under a Creative Commons Attribution 4.0 International License. Based on a work at COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY. Permissions beyond the scope of this license may be available at Creative Commons Attribution 4.0 International Public License.
