Discovering Frequent High Average Utility Itemset Without Transaction Insertion

Data mining is a technique through which we can find interesting data and sequence from the available wide range of data source. Incremental high-average utility pattern mining (IHAUPM) algorithm is represented to manage the incremental database with transaction insertion. IHAUPM algorithm basically follows the comparison to the original database and newly inserted database itemset if itemset has High Average Utility Upper Bound Itemset (HAUUBI) in the initial database as well as new transaction database then the item always frequent. Second situation itemset has non-High Average Utility Upper Bound Itemset (non-HAUUBI) in the initial database as well as new transaction database then the item always not frequent. Otherwise, the itemset is recurring or not is identified by the given information. This new algorithm is represented in this paper to generate expected high utility frequent item set to form a new transaction database; this algorithm is much faster than the existing algorithm.

[1]  Vipin Kumar,et al.  Efficient Parallel Algorithms for Mining Associations , 1999, Large-Scale Parallel Data Mining.

[2]  Sunil Prabhakar,et al.  Evaluating probabilistic queries over imprecise data , 2003, SIGMOD '03.

[3]  Philip S. Yu,et al.  UFIMT: an uncertain frequent itemset mining toolbox , 2012, KDD.

[4]  Reynold Cheng,et al.  Mining uncertain data with probabilistic guarantees , 2010, KDD.

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

[6]  David Wai-Lok Cheung,et al.  Effect of Data Distribution in Parallel Mining of Associations , 1999, Data Mining and Knowledge Discovery.

[7]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[8]  Feifei Li,et al.  Finding frequent items in probabilistic data , 2008, SIGMOD Conference.

[9]  Jiawei Han,et al.  Maintenance of discovered association rules in large databases: an incremental updating technique , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[10]  Philip S. Yu,et al.  Mining Frequent Itemsets over Uncertain Databases , 2012, Proc. VLDB Endow..

[11]  Hans-Peter Kriegel,et al.  Probabilistic frequent itemset mining in uncertain databases , 2009, KDD.

[12]  A. Choudhary,et al.  A fast high utility itemsets mining algorithm , 2005, UBDM '05.

[13]  Ben Kao,et al.  A Decremental Approach for Mining Frequent Itemsets from Uncertain Data , 2008, PAKDD.

[14]  Hans-Peter Kriegel,et al.  Model-based probabilistic frequent itemset mining , 2013, Knowledge and Information Systems.

[15]  Edward Hung,et al.  Mining Frequent Itemsets from Uncertain Data , 2007, PAKDD.

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

[17]  Reynold Cheng,et al.  Accelerating probabilistic frequent itemset mining: a model-based approach , 2010, CIKM.

[18]  Vipin Kumar,et al.  Scalable Parallel Data Mining for Association Rules , 2000, IEEE Trans. Knowl. Data Eng..

[19]  Tzung-Pei Hong,et al.  Incrementally fast updated frequent pattern trees , 2008, Expert Syst. Appl..

[20]  Tzung-Pei Hong,et al.  Efficiently Mining High Average-Utility Itemsets with an Improved Upper-Bound Strategy , 2012, Int. J. Inf. Technol. Decis. Mak..

[21]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[22]  Jiawei Han,et al.  A fast distributed algorithm for mining association rules , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[23]  Rakesh Agrawal,et al.  Parallel Mining of Association Rules , 1996, IEEE Trans. Knowl. Data Eng..

[24]  David Wai-Lok Cheung,et al.  Efficient Mining of Association Rules in Distributed Databases , 1996, IEEE Trans. Knowl. Data Eng..