{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:29:10Z","timestamp":1760232550972,"version":"build-2065373602"},"reference-count":31,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>High-utility itemset mining discovers a set of items that are sold together and have utility values higher than a given minimum utility threshold. The utilities of these itemsets are calculated by considering their internal and external utility values, which correspond, respectively, to the quantity sold of each item in each transaction and profit units. Therefore, internal and external utilities have symmetric effects on deciding whether an itemset is high-utility. The symmetric contributions of both utilities cause two major related challenges. First, itemsets with low external utility values can easily exceed the minimum utility threshold if they are sold extensively. In this case, such itemsets can be found more efficiently using frequent itemset mining. Second, a large number of high-utility itemsets are generated, which can result in interesting or important high-utility itemsets that are overlooked. This study presents an asymmetric approach in which the internal utility values are ignored when finding high-utility itemsets with high external utility values. The experimental results of two real datasets reveal that the external utility values have fundamental effects on the high-utility itemsets. The results of this study also show that this effect tends to increase for high values of the minimum utility threshold. Moreover, the proposed approach reduces the execution time.<\/jats:p>","DOI":"10.3390\/sym14112339","type":"journal-article","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T10:54:40Z","timestamp":1667904880000},"page":"2339","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ignoring Internal Utilities in High-Utility Itemset Mining"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6556-7444","authenticated-orcid":false,"given":"Damla","family":"Oguz","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Izmir Institute of Technology, Izmir 35430, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"unstructured":"Buneman, P., and Jajodia, S. (1993, January 26\u201328). Mining Association Rules between Sets of Items in Large Databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, DC, USA.","key":"ref_1"},{"unstructured":"Han, J., Kamber, M., and Pei, J. (2011). Data Mining: Concepts and Techniques, Morgan Kaufmann. [3rd ed.].","key":"ref_2"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"e1207","DOI":"10.1002\/widm.1207","article-title":"A survey of itemset mining","volume":"7","author":"Lin","year":"2017","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"e1329","DOI":"10.1002\/widm.1329","article-title":"Frequent itemset mining: A 25 years review","volume":"9","author":"Luna","year":"2019","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2603","DOI":"10.1007\/s10462-018-9629-z","article-title":"Algorithms for frequent itemset mining: A literature review","volume":"52","author":"Chee","year":"2019","journal-title":"Artif. Intell. Rev."},{"doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., and Butz, C.J. (2004, January 22\u201324). A foundational approach to mining itemset utilities from databases. Proceedings of the 2004 SIAM International Conference on Data Mining, Lake Buena Vista, FL, USA.","key":"ref_6","DOI":"10.1137\/1.9781611972740.51"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","article-title":"Mining itemset utilities from transaction databases","volume":"59","author":"Yao","year":"2006","journal-title":"Data Knowl. Eng."},{"doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Lin, J.C.-W., Chi, T.T., and Nkambou, R. (2019). A Survey of High Utility Itemset Mining. High-Utility Pattern Mining, Springer.","key":"ref_8","DOI":"10.1007\/978-3-030-04921-8"},{"doi-asserted-by":"crossref","unstructured":"Liu, Y., Liao, W.K., and Choudhary, A. (2005, January 18\u201320). A two-phase algorithm for fast discovery of high utility itemsets. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, Hanoi, Vietnam.","key":"ref_9","DOI":"10.1007\/11430919_79"},{"doi-asserted-by":"crossref","unstructured":"Tseng, V.S., Wu, C.W., Shie, B.E., and Yu, P.S. (2010, January 24\u201328). UP-Growth: An efficient algorithm for high utility itemset mining. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA.","key":"ref_10","DOI":"10.1145\/1835804.1835839"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","article-title":"An effective tree structure for mining high utility itemsets","volume":"38","author":"Lin","year":"2011","journal-title":"Expert Syst. Appl."},{"unstructured":"Liu, M., and Qu, J. (November, January 29). Mining high utility itemsets without candidate generation. Proceedings of the 21st ACM International Conference on Information and Knowledge Management, Maui, HI, USA.","key":"ref_12"},{"doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Wu, C.W., Zida, S., and Tseng, V.S. (2014, January 25\u201327). FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. Proceedings of the International Symposium on Methodologies for Intelligent Systems, Roskilde, Denmark.","key":"ref_13","DOI":"10.1007\/978-3-319-08326-1_9"},{"doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Lin, J.C.W., Duong, Q.H., and Dam, T.L. (2016, January 2\u20134). FHM+: Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction. Proceedings of the International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Morioka, Japan.","key":"ref_14","DOI":"10.1007\/978-3-319-42007-3_11"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","article-title":"EFIM: A fast and memory efficient algorithm for high-utility itemset mining","volume":"51","author":"Zida","year":"2017","journal-title":"Knowl. Inf. Syst."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3363571","article-title":"High-utility itemset mining with effective pruning strategies","volume":"13","author":"Wu","year":"2019","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"doi-asserted-by":"crossref","unstructured":"Cheng, Z., Fang, W., Shen, W., Lin, J.C.W., and Yuan, B. (2022). An efficient utility-list based high-utility itemset mining algorithm. Appl. Intell., 1\u201315.","key":"ref_17","DOI":"10.23919\/CSMS.2022.0023"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"10604","DOI":"10.1007\/s10489-021-03134-3","article-title":"Efficient evolutionary computation model of closed high-utility itemset mining","volume":"52","author":"Lin","year":"2022","journal-title":"Appl. Intell."},{"key":"ref_19","first-page":"487","article-title":"Fast algorithms for mining association rules","volume":"Volume 1215","author":"Agrawal","year":"1994","journal-title":"Proceedings of the 20th International Conference on Very Large Data Bases, VLDB"},{"doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., and Li, W. (1997, January 14\u201317). New algorithms for fast discovery of association rules. Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), Newport Beach, CA, USA.","key":"ref_20","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/335191.335372","article-title":"Mining frequent patterns without candidate generation","volume":"29","author":"Han","year":"2000","journal-title":"ACM SIGMOD Rec."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","article-title":"HMiner: Efficiently mining high utility itemsets","volume":"90","author":"Krishnamoorthy","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1859","DOI":"10.1007\/s10489-017-1057-2","article-title":"Efficient high utility itemset mining using buffered utility-lists","volume":"48","author":"Duong","year":"2018","journal-title":"Appl. Intell."},{"key":"ref_24","doi-asserted-by":"crossref","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","year":"2018","journal-title":"IEEE Access"},{"key":"ref_25","first-page":"1","article-title":"Mining high utility itemsets with Hill climbing and simulated annealing","volume":"13","author":"Nawaz","year":"2021","journal-title":"ACM Trans. Manag. Inf. Syst. (TMIS)"},{"doi-asserted-by":"crossref","unstructured":"Song, W., Li, J., and Huang, C. (2021, January 17\u201321). Artificial fish swarm algorithm for mining high utility itemsets. Proceedings of the International Conference on Swarm Intelligence, Qingdao, China.","key":"ref_26","DOI":"10.1007\/978-3-030-78811-7_38"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"109073","DOI":"10.1016\/j.asoc.2022.109073","article-title":"High-utility itemsets mining based on binary particle swarm optimization with multiple adjustment strategies","volume":"124","author":"Fang","year":"2022","journal-title":"Appl. Soft Comput."},{"unstructured":"Yao, H., Hamilton, H.J., and Geng, L. (2006, January 20). A unified framework for utility-based measures for mining itemsets. Proceedings of the ACM SIGKDD 2nd Workshop on Utility-Based Data Mining, Philadelphia, PA, USA.","key":"ref_28"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","article-title":"Effective utility mining with the measure of average utility","volume":"38","author":"Hong","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1109\/TKDE.2019.2942594","article-title":"A survey of utility-oriented pattern mining","volume":"33","author":"Gan","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_31","first-page":"3389","article-title":"Spmf: A java open-source pattern mining library","volume":"15","author":"Gomariz","year":"2014","journal-title":"J. Mach. Learn. Res."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/11\/2339\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:11:55Z","timestamp":1760145115000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/11\/2339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":31,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["sym14112339"],"URL":"https:\/\/doi.org\/10.3390\/sym14112339","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2022,11,7]]}}}