{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:28:13Z","timestamp":1778693293478,"version":"3.51.4"},"reference-count":24,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2024,1,10]]},"abstract":"<jats:p>It is obvious that the problem of Frequent Itemset Mining (FIM) is very popular in data mining, which generates frequent itemsets from a transaction database. An extension of the frequent itemset mining is High Utility Itemset Mining (HUIM) which identifies itemsets with high utility from the transaction database. This gains popularity in data mining, because it identifies itemsets which have more value but the same was not identified as frequent by Frequent Itemset Mining. HUIM is generally referred to as Utility Mining. The utility of the items is measured based on parameters like cost, profit, quantity or any other measures preferred by the users. Compared to high utility itemsets (HUIs) mining, high average utility itemsets (HAUIs) mining is more precise by considering the number of items in the itemsets. In state-of-the-art algorithms that mines HUIS and HAUIs use a single fixed minimum utility threshold based on which HAUIs are identified. In this paper, the proposed algorithm mines HAUIs from transaction databases using Artificial Fish Swarm Algorithm (AFSA) with computed multiple minimum average utility thresholds. Computing the minimum average utility threshold for each item with the AFSA algorithm outperforms other state-of-the-art HAUI mining algorithms with multiple minimum utility thresholds and user-defined single minimum threshold in terms of number of HAUIs. It is observed that the proposed algorithm outperforms well in terms of execution time, number of candidates generated and memory consumption when compared to the state-of-the-art algorithms.<\/jats:p>","DOI":"10.3233\/jifs-231852","type":"journal-article","created":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T12:37:48Z","timestamp":1700829468000},"page":"1597-1613","source":"Crossref","is-referenced-by-count":4,"title":["Mining high average utility itemsets using artificial fish swarm algorithm with computed multiple minimum average utility thresholds"],"prefix":"10.1177","volume":"46","author":[{"given":"S.S.","family":"Nandhini","sequence":"first","affiliation":[{"name":"Bannari Amman Institute of Technology, Sathyamangalam, Tamil Nadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Kannimuthu","sequence":"additional","affiliation":[{"name":"Karpagam College of Engineering, Coimbatore, Tamil Nadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-231852_ref2","doi-asserted-by":"crossref","first-page":"3293","DOI":"10.1007\/s00500-021-06665-6","article-title":"Island-based Cuckoo Search with elite opposition-based learning and multiple mutation methods for solving optimization problems","volume":"26","author":"Abed-alguni","year":"2022","journal-title":"Soft Comput"},{"key":"10.3233\/JIFS-231852_ref3","doi-asserted-by":"crossref","first-page":"107113","DOI":"10.1016\/j.asoc.2021.107113","article-title":"Distributed Grey Wolf Optimizer for scheduling of workflow applications in cloud environments","volume":"102","author":"Bilal Abed-alguni","year":"2021","journal-title":"Applied Soft Computing"},{"issue":"4","key":"10.3233\/JIFS-231852_ref4","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1515\/jisys-2017-0268","article-title":"A hybrid cuckoo search and simulated annealing algorithm","volume":"28","author":"Faisal Alkhateeb","year":"2019","journal-title":"Journal of Intelligent Systems"},{"key":"10.3233\/JIFS-231852_ref6","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1214\/aoms\/1177731944","article-title":"A comparison of alternative tests of significance for the problem of m ranking,","volume":"11","author":"Friedman","year":"1940","journal-title":"Ann Math Stat"},{"issue":"1","key":"10.3233\/JIFS-231852_ref7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: a frequent-pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/JIFS-231852_ref8","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.engappai.2016.07.006","article-title":"Mining high-utility itemsets based on particle swarm optimization","volume":"55","author":"Jerry Chun-Wei Lin","year":"2016","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"17","key":"10.3233\/JIFS-231852_ref9","first-page":"5103","article-title":"A binary PSO approach to mine high-utility itemsets","volume":"21","author":"Jerry Chun-Wei Lin","year":"2017","journal-title":"Soft Computing \u2013A Fusion of Foundations, Methodologies and Applications"},{"key":"10.3233\/JIFS-231852_ref10","unstructured":"Jerry Chun-Wei Lin , Shifeng Ren , Philippe Fournier-Viger , MEMU: More Efficient Algorithm to Mine High Average-Utility Patterns with Multiple Minimum Average-Utility Thresholds, IEEE Access 14(8) (2017)."},{"issue":"2","key":"10.3233\/JIFS-231852_ref12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","article-title":"An efficient algorithm to mine high average-utility itemsets","volume":"30","author":"Jerry Chun-Wei Lin","year":"2016","journal-title":"Advanced Engineering Informatics"},{"issue":"4","key":"10.3233\/JIFS-231852_ref13","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1080\/08839514.2014.891839","article-title":"Discovery of high utility itemsets using genetic algorithm with ranked mutation","volume":"28","author":"Kannimuthu","year":"2014","journal-title":"Appl. Artif. Intell."},{"issue":"11","key":"10.3233\/JIFS-231852_ref15","first-page":"32","article-title":"An optimizing method based on autonomous animals: fish-swarm algorithm","volume":"22","author":"Li","year":"2002","journal-title":"Syst. Eng. Theor. Pract."},{"key":"10.3233\/JIFS-231852_ref16","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.engappai.2016.07.006","article-title":"Mining high-utility itemsets based on particle swarm optimization,","volume":"55","author":"Lin","year":"2016","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.3233\/JIFS-231852_ref17","doi-asserted-by":"crossref","unstructured":"Liqiang Geng , Howard J. Hamilton , Interestingness measures for Data Mining: A survey , ACM Computing Surveys 38(3) (2006), Article 9.","DOI":"10.1145\/1132960.1132963"},{"issue":"1","key":"10.3233\/JIFS-231852_ref18","first-page":"22","article-title":"Mining High Utility Itemsets with Hill Climbing and Simulated Annealing","volume":"13","author":"Saqib Nawaz","year":"2022","journal-title":"ACM Trans. Manage. Inf. Syst."},{"key":"10.3233\/JIFS-231852_ref19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ins.2021.12.017","article-title":"Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases","volume":"587","author":"Tung","year":"2022","journal-title":"Information Sciences"},{"key":"10.3233\/JIFS-231852_ref22","unstructured":"projects\/hdb\/resources.shtml. Accessed 6 April 2023."},{"issue":"5","key":"10.3233\/JIFS-231852_ref26","doi-asserted-by":"crossref","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","article-title":"Pruning strategies for mining high utility itemsets","volume":"42","author":"Krishnamoorthy","year":"2015","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"10.3233\/JIFS-231852_ref28","first-page":"19","article-title":"Mining high average-utility itemsets based on particle swarm optimization","volume":"4","author":"Song","year":"2020","journal-title":"Data Sci. Pattern Recogn"},{"key":"10.3233\/JIFS-231852_ref30","doi-asserted-by":"publisher","first-page":"19568","DOI":"10.1109\/ACCESS.2018.2819162","article-title":"Mining High Utility Itemsets Using Bio-Inspired Algorithms: A Diverse Optimal Value Framework","volume":"6","author":"Song Wei","year":"2018","journal-title":"IEEE Access"},{"key":"10.3233\/JIFS-231852_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-03122-7"},{"issue":"6+","key":"10.3233\/JIFS-231852_ref33","first-page":"1597","article-title":"A Novel Approach to Extract High Utility Itemsets from Distributed Databases","volume":"31","author":"Subramanian","year":"2013","journal-title":"COMPUTING AND INFORMATICS"},{"key":"10.3233\/JIFS-231852_ref34","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1504\/IJITM.2015.066056","article-title":"UP-GNIV: An expeditious high utility pattern mining algorithm for itemsets with negative utility values","volume":"14","author":"Subramanian Kannimuthu","year":"2015","journal-title":"International Journal of Information Technology and Management"},{"key":"10.3233\/JIFS-231852_ref35","first-page":"202","article-title":"More efficient algorithms for mining high-utility itemsets with multiple minimum utility thresholds","volume":"2016","author":"Gan","journal-title":"Database and Expert Systems Applications"},{"key":"10.3233\/JIFS-231852_ref38","doi-asserted-by":"crossref","first-page":"2947","DOI":"10.1007\/s10115-021-01614-z","article-title":"Generalized maximal utility for mining high average-utility itemsets,","volume":"63","author":"Wei Song","year":"2021","journal-title":"Knowledge and Information Systems"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-231852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:42:52Z","timestamp":1777455772000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-231852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,10]]},"references-count":24,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jifs-231852","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,10]]}}}