Open Access Open Access  Restricted Access Subscription or Fee Access

A Study of Mining High Utility Itemset

Priyanka Rana, Jaspreet Singh, Shashi Bhushan

Abstract


Cost effective exploitation of a transactional database refers to the procedure of choosing the transaction sets with most cost effective features that will improve overall incomes of a company. A plethora of data mining algorithms have been recommended in the past few years to focus on mining item sets with high utility value. The word utility is about that feature of item-sets. Thus, mining algorithms tries to find out all of the item sets satisfying a user-defined limit called min_util. These algorithms cause problems linked to memory and execution time because lots of candidate item sets are generated and several scans of database are needed. This paper focus on review various existing formulas that effectively mine item sets with techniques for pruning candidates that tend to be generated alongside the candidate generation process.

Keywords: Data mining, utility mining, high utility itemset mining, frequent itemset mining

Cite this Article
Priyanka Rana, Jaspreet Singh, Shashi Bhushan. A Study of Mining High Utility Itemset. Journal of Software Engineering Tools & Technology Trends. 2015; 2(3): 21–25p.


Full Text:

PDF

References


Tseng VS, Bai-En Shie, Cheng-Wei Wu, Yu PS. Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases. IEEE Transactions on Knowledge and Data Engineering. 2013.

Liu Junqiang, Wang Ke, Fung BCM. Direct Discovery of High Utility Itemsets without Candidate Generation. IEEE 12th

International Conference on ICDM. 2012: 627–654p.

Shankar S, Purusothaman T, Jayanthi S, Babu N. A Fast Algorithm for Mining High Utility Itemsets. IEEE Advance Computing Conference. 2009.

Tzung-Pei Hong, Cho-Han Lee, Shyue-Liang Wang. An Incremental Mining Algorithm for High Average-Utility Itemsets. IEEE Pervasive Systems, Algorithms, and Networks (ISPAN). 2009.

Hua-Fu Li, Hsin-Yun Huang, Yi-Cheng Chen, Yu-Jiun Liu, Suh-Yin Lee. Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams. IEEE International Conference on ICDM. 2008.

Ramaraju C, Savarimuthu N. A Conditional Tree Based Novel Algorithm for High Utility Itemset Mining. IEEE International Conference on Recent Trends in Information Technology (ICRTIT). 2011.

Erwin A, Gopalan RP, Achuthan NR. CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach. IEEE 7th International Conference on Computer and Information Technology. 2007: 54–70p.

Tzung-Pei Hong, Cho-Han Lee, Shyue-Liang Wang. Mining High Average-Utility Itemsets. IEEE International Conference on Systems, Man and Cybernetics. 2009.

Guo-Cheng Lan, Tzung-Pei Hong, Tseng VS. Projection-Based Utility Mining with an Efficient Indexing Mechanism. IEEE International Conference on Technologies and Applications of Artificial Intelligence (TAAI). 2010.

Parmar DK, Rathod YA, Patel MM. Survey on High Utility Oriented Sequential Pattern Mining. IEEE, Computational Intelligence and Computing Research (ICCIC), 2013 IEEE International Conference. 2013.

Guo-Cheng Lan, Tzung-Pei Hong, Tseng VS. Mining High Transaction-Weighted Utility Itemsets. IEEE Second International Conference on Computer Engineering and Applications (ICCEA). 2010.

Song Wei, Liu Yu, Li Jinhong. Vertical Mining for High Utility Itemsets. IEEE International Conference on Granular Computing. 2012. 105–120p.

Shankar S, Purusothaman T, Jayanthi S. Novel Algorithm for Mining High Utility Item Sets. IEEE International Conference on Computing, Communication and Networking. 2008.

Guo-Cheng Lan, Tseng VS, Tzung-Pei Hong, Chun-Hao Chen. Using Pruning and Filtering Strategies to Speed-up Projection-Based Utility Mining. IEEE International Conference on System Science and Engineering (ICSSE). 2011.

Zhou Lin, Ying Liu, Jing Wang, Yong Shi. Utility-Based Web Path Traversal Pattern Mining. IEEE Seventh IEEE International Conference on Data Mining Workshops. 2007. 16. Fournier-Viger Philippe, Cheng-Wei Wu, Souleymane Zida, Vincent S. Tseng. Fhm: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning. In Foundations of intelligent systems. 2014: 83–92p.

Yu Guangzhu, Shihuang Shao, Xianhui Zeng. Mining Long High Utility Item Sets in Transaction Databases. WSEAS Transactions on Information Science & Applications. 2008; 5(2): 202–210p.


Refbacks

  • There are currently no refbacks.


This site has been shifted to https://stmcomputers.stmjournals.com/