Analysis and comparison of HUPID and FHIM algorithm for dynamic databases

High utility itemset mining provides more useful and realistic results than frequent pattern mining because of its ability to consider statistical correlation and semantic significance among the items. The state of art algorithms designed for mining high utility itemsets always consider the database as static. If they are used for dynamic databases for the same purpose, database is rescanned from the beginning for each update in data. If there is a provision to add new data to the previous analysis results, existing and newly generated data can be efficiently handled and mining can be made more effective with reduced overhead of database scans for dynamic databases. This paper compares performance of HUPID-Tree algorithm over the state of art algorithm FHIM for mining high utility itemsets from dynamic databases and proves that HUPID-Tree algorithm performs better in terms of space and time because it uses incremental mining strategy and local itemset pruning technique.

[1]  Young-Koo Lee,et al.  Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases , 2009, IEEE Transactions on Knowledge and Data Engineering.

[2]  Chin-Chen Chang,et al.  Isolated items discarding strategy for discovering high utility itemsets , 2008, Data Knowl. Eng..

[3]  Ashok Kumar Das,et al.  An efficient approach for mining association rules from high utility itemsets , 2015, Expert Syst. Appl..

[4]  Philip S. Yu,et al.  UP-Growth: an efficient algorithm for high utility itemset mining , 2010, KDD.

[5]  J. Maxwell.  A Treatise on Electricity and Magnetism , 1873, Nature.

[6]  Cory J. Butz,et al.  A Foundational Approach to Mining Itemset Utilities from Databases , 2004, SDM.

[7]  Raj P. Gopalan,et al.  Efficient Mining of High Utility Itemsets from Large Datasets , 2008, PAKDD.

[8]  Heungmo Ryang,et al.  Incremental high utility pattern mining with static and dynamic databases , 2014, Applied Intelligence.

[9]  Yu Liu,et al.  Mining high utility itemsets by dynamically pruning the tree structure , 2013, Applied Intelligence.

[10]  Qiang Yang,et al.  Mining high utility itemsets , 2003, Third IEEE International Conference on Data Mining.

[11]  Ying Liu,et al.  A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets , 2005, PAKDD.

[12]  Vincent S. Tseng,et al.  Efficient algorithms for discovering high utility user behavior patterns in mobile commerce environments , 2013, Knowledge and Information Systems.

[13]  Philip S. Yu,et al.  Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases , 2013, IEEE Transactions on Knowledge and Data Engineering.

[14]  Keun Ho Ryu,et al.  High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates , 2014, Expert Syst. Appl..

[15]  Tzung-Pei Hong,et al.  An effective tree structure for mining high utility itemsets , 2011, Expert Syst. Appl..

[16]  Keun Ho Ryu,et al.  Discovering high utility itemsets with multiple minimum supports , 2014, Intell. Data Anal..

[17]  Chin-Chen Chang,et al.  Two-Phase Algorithms for a Novel Utility-Frequent Mining Model , 2007, PAKDD Workshops.

[18]  Tzung-Pei Hong,et al.  An incremental mining algorithm for high utility itemsets , 2012, Expert Syst. Appl..