Mining high-utility itemset using weighted matrix-based Apriori algorithm

Muhammad Haris; Abdus Salam; Zia Ur Rahman

Author(s)

Muhammad Haris Department of Computing and Technology Abasyn University,Peshawar,Pakistan

Abdus Salam Department of Computing and Technology Abasyn University,Peshawar,Pakistan

Zia Ur Rahman Department of Computing and Technology Abasyn University,Peshawar,Pakistan

Abstract

Data mining is the process of discovering interesting and useful patterns and relationships in large sets of data. A recently published weighted matrix-based Apriori algorithm introduced new dimensions in the field of mining frequent patterns. The algorithm scans the transaction database and generates a 0-1 transaction matrix for getting the weighted support and confidence. The items and transactions are weighted to reflect the importance of the transaction database. The algorithm uses only minimum support as an interesting measure, often low utility items are taken as frequent itemsets, which is not beneficial for users. The field of mining high utility itemsets consider interesting utility factors like profit, cost, etc. while finding frequent patterns. This paper proposes a modified algorithm for mining high-utility itemset using a weighted matrixbased Apriori algorithm. Transaction database is transformed into a quantity transaction database. Transaction utility is calculated by multiplying each item's internal utility with its external utility available in that transaction. The weight support and utility of items are calculated to discover high-utility frequent itemsets. The exploratory outcomes show that the modified algorithm Mining high-utility itemset using a weighted matrix-based Apriori algorithm achieves good performance in the generation of high utility frequent itemsets.

Publication Details

Page(s) 55-69

DOI DOI not available

Published Journal: The Sciencetech, Volume: 2, Issue: 4, Year: 2021

Request the full text from PASTIC

Keywords

Weight matrix, Utility Mining, Data Mining, Frequent itemset

References

Badhon B.,Kabir M. M. J.,Xu S.,Kabir M. .2021 .A survey on association rule mining based on evolutionary algorithms. International Journal of Computers and Applications, 43(8) : 775-785.

Sharma A.,Tripathi K. .2021 .Hybrid Version of Apriori Using MapReduce. In Mobile Radio Communications and 5G Networks, : 585-592.

Shawkat M.,Badawi M.,El-ghamrawy M.,Arnous R.,A. R. .2021 .An optimized FP-growth algorithm for discovery of association rules. The Journal of Supercomputing, : 1-28.

Chan R.,Yang Q.,Shen Y. D. .2003 .November). Mining high utility itemsets. In Third IEEE international conference on data mining, : 19-19.

Yun U.,Nam H.,Kim J.,Kim H.,Baek Y.,Lee J.,Pedrycz W. .2020 .Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases. Future Generation Computer Systems, 103 : 58-78.

Vo B.,Nguyen L. T.,Bui N.,Nguyen N.,Huynh V. N.,Hong T. P. .2020 .An efficient method for mining closed potential high-utility itemsets. IEEE Access, 8 : 31813-31822.

Mai T.,Nguyen L. T.,Vo B.,Yun U.,Hong T. P. .2020 .Efficient algorithm for mining non-redundant high-utility association rules. Sensors, 20(4) : 1078.

Sun L. N. .2020 .An improved apriori algorithm based on support weight matrix for data mining in transaction database. Journal of Ambient Intelligence and Humanized Computing, 11(2) : 495-501.

Yu W.,Wang X.,Wang F.,Wang E.,Chen B. .2008 .Notice of Retraction: The research of improved apriori algorithm for mining association rules. In 2008 11th IEEE International Conference on Communication Technology, : 513-516.

Park J. S.,Chen M. S.,Yu P. S. .1995 .An effective hash-based algorithm for mining association rules. Acm sigmod record, 24(2) : 175-186.

Chang R.,Liu Z. .2011 .An improved apriori algorithm. In Proceedings of 2011 International Conference on Electronics and Optoelectronics, 1 : V1-476.

Yang Q.,Fu Q.,Wang C.,Yang J. .2018 .A matrix-based Apriori algorithm improvement. In 2018 IEEE Third International Conference on Data Science in Cyberspace (DSC), : 824-828.

Huang Y.,Lin Q.,Li Y. .2018 .Apriori-BM algorithm for mining association rules based on bit set matrix. In 2018 2nd IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC), : 2580-2584.

Yao H.,Hamilton H. J.,Butz C. J. .2004 .A foundational approach to mining itemset utilities from databases. Society for Industrial and Applied Mathematics., : 482-486.

Liu Y.,Li J.,Liao W. K.,Choudhary A.,Shi Y. .2010 .High utility itemsets mining. International Journal of Information Technology & Decision Making, 9(06) : 905-934.

Shankar S.,Babu N.,Purusothaman T.,Jayanthi S. .2009 .A fast algorithm for mining high utility itemsets. In 2009 IEEE International Advance Computing Conference, : 1459-1464.

Tseng V. S.,Wu C. W.,Shie B. E.,Yu P. S. .2010 .UPGrowth: an efficient algorithm for high utility itemset mining. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, : 253-262.

Tseng V. S.,Shie B. E.,Wu C. W.,Yu P. S. .2013 .Fellow,“. Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases”. IEEE Transaction on knowledge and data engineering, 25(8) : .

Liu M.,Qu J. .2012 .October). Mining high utility itemsets without candidate generation. In Proceedings of the 21st ACM international conference on Information and knowledge management, : 55-64.

Fournier-Viger P.,Wu C. W.,Zida S.,Tseng V. S. .2014 .FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In International symposium on methodologies for intelligent systems, : 83-92.

Duong Q. H.,Fournier-Viger P.,Ramampiaro H.,Nørvåg K.,Dam T. L. .2018 .Efficient high utility itemset mining using buffered utility-lists. Applied Intelligence, 48(7) : 1859-1877.

Nguyen L. T.,Nguyen P.,Nguyen P.,Vo B.,Fournier-Viger P.,Tseng V. S. .2019 .Mining high-utility itemsets in dynamic profit databases. Knowledge-Based Systems, 175 : 130-144.

Vo B.,Nguyen L. V.,Vu V. V.,Lam M. T.,Duong M. T.,Manh L. T.,Hong T. P. .2020 .Mining correlated high utility itemsets in one phase. IEEE Access, 8 : 90465-90477.

Vo B.,Nguyen L. T.,Nguyen L. T.,Fournier-Viger P.,Yun U. .2020 .A multi-core approach to efficiently mining high-utility itemsets in dynamic profit databases. IEEE Access, 8 : 85890-85899.