{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:09:03Z","timestamp":1760710143498,"version":"build-2065373602"},"reference-count":40,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["102.05-2018.01"],"award-info":[{"award-number":["102.05-2018.01"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>In business, managers may use the association information among products to define promotion and competitive strategies. The mining of high-utility association rules (HARs) from high-utility itemsets enables users to select their own weights for rules, based either on the utility or confidence values. This approach also provides more information, which can help managers to make better decisions. Some efficient methods for mining HARs have been developed in recent years. However, in some decision-support systems, users only need to mine a smallest set of HARs for efficient use. Therefore, this paper proposes a method for the efficient mining of non-redundant high-utility association rules (NR-HARs). We first build a semi-lattice of mined high-utility itemsets, and then identify closed and generator itemsets within this. Following this, an efficient algorithm is developed for generating rules from the built lattice. This new approach was verified on different types of datasets to demonstrate that it has a faster runtime and does not require more memory than existing methods. The proposed algorithm can be integrated with a variety of applications and would combine well with external systems, such as the Internet of Things (IoT) and distributed computer systems. Many companies have been applying IoT and such computing systems into their business activities, monitoring data or decision-making. The data can be sent into the system continuously through the IoT or any other information system. Selecting an appropriate and fast approach helps management to visualize customer needs as well as make more timely decisions on business strategy.<\/jats:p>","DOI":"10.3390\/s20041078","type":"journal-article","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T03:20:03Z","timestamp":1582168803000},"page":"1078","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Efficient Algorithm for Mining Non-Redundant High-Utility Association Rules"],"prefix":"10.3390","volume":"20","author":[{"given":"Thang","family":"Mai","sequence":"first","affiliation":[{"name":"Institute of Research and Development, Duy Tan University, Da Nang 550000, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6440-6462","authenticated-orcid":false,"given":"Loan T.T.","family":"Nguyen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, International University, Ho Chi Minh City 700000, Vietnam"},{"name":"Vietnam National University, Ho Chi Minh City 700000, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2723-1138","authenticated-orcid":false,"given":"Bay","family":"Vo","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Ho Chi Minh City University of Technology (HUTECH), Ho Chi Minh City 700000, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sejong University, Seoul 05006, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7305-6492","authenticated-orcid":false,"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung 811, Taiwan"},{"name":"Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung 804, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,2,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/j.procs.2017.11.052","article-title":"What\u2019s the \u201cThing\u201d in Internet of Things in Grocery Shopping? A Customer Approach","volume":"121","author":"Eriksson","year":"2017","journal-title":"Procedia Comput. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Dogan, O., Bayo-Monton, J.L., Fernandez-Llatas, C., and Oztaysi, B. (2019). Analyzing of Gender Behaviors from Paths Using Process Mining: A Shopping Mall Application. Sensors, 19.","DOI":"10.3390\/s19030557"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bok, K., Jeong, J., Choi, D., and Yoo, J. (2018). Detecting Incremental Frequent Subgraph Patterns in IoT Environments. Sensors, 18.","DOI":"10.3390\/s18114020"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Ismail, W.N., and Hassan, M.M. (2017). Mining Productive-Associated Periodic-Frequent Patterns in Body Sensor Data for Smart Home Care. Sensors, 17.","DOI":"10.20944\/preprints201704.0117.v1"},{"key":"ref_5","first-page":"29","article-title":"An Efficient Incremental Mining Algorithm for Discovering Sequential Pattern in Wireless Sensor Network Environments","volume":"19","author":"Xin","year":"2019","journal-title":"Sensors"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","article-title":"Mining association rules between sets of items in large databases","volume":"22","author":"Agrawal","year":"1993","journal-title":"ACM SIGMOD Rec."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Vo, B., Nguyen, H., and Le, B. (2009, January 13\u201317). Mining High Utility Itemsets from Vertical Distributed Databases. Proceedings of the 2009 IEEE-RIVF International Conference on Computing and Communication Technologies, Da Nang, Vietnam.","DOI":"10.1109\/RIVF.2009.5174650"},{"key":"ref_8","first-page":"689","article-title":"A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets","volume":"3518","author":"Liu","year":"2005","journal-title":"Adv. Concepts Intell. Vis. Syst."},{"key":"ref_9","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_10","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_11","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","article-title":"Efficient Algorithms for Mining Top-K High-utility Itemsets","volume":"28","author":"Tseng","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_12","first-page":"71","article-title":"More Efficient Algorithms for Mining High-Utility Itemsets with Multiple Minimum Utility Thresholds","volume":"9827","author":"Gan","year":"2016","journal-title":"Comput. Vis."},{"key":"ref_13","first-page":"487","article-title":"Fast algorithms for mining association rules","volume":"1215","author":"Agrawal","year":"1994","journal-title":"VLDB"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","article-title":"Mining high-utility itemsets in dynamic profit databases","volume":"175","author":"Nguyen","year":"2019","journal-title":"Knowl.-Based Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"5754","DOI":"10.1016\/j.eswa.2015.02.051","article-title":"An efficient approach for mining association rules from high utility itemsets","volume":"42","author":"Sahoo","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ins.2017.02.058","article-title":"A lattice-based approach for mining high utility association rules","volume":"399","author":"Mai","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","article-title":"Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases","volume":"21","author":"Ahmed","year":"2009","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_18","first-page":"83","article-title":"FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning","volume":"8502","author":"Wu","year":"2014","journal-title":"Adv. Concepts Intell. Vis. Syst."},{"key":"ref_19","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_20","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_21","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.knosys.2017.12.029","article-title":"Damped window based high average utility pattern mining over data streams","volume":"144","author":"Yun","year":"2018","journal-title":"Knowl.-Based Syst."},{"key":"ref_22","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."},{"key":"ref_23","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_24","doi-asserted-by":"crossref","first-page":"5103","DOI":"10.1007\/s00500-016-2106-1","article-title":"A binary PSO approach to mine high-utility itemsets","volume":"21","author":"Lin","year":"2017","journal-title":"Soft Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s10489-017-0932-1","article-title":"A hybrid framework for mining high-utility itemsets in a sparse transaction database","volume":"47","author":"Dawar","year":"2017","journal-title":"Appl. Intell."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Qu, J.-F., Liu, M., Xin, C., and Wu, Z. (2018). Fast Identification of High Utility Itemsets from Candidates. Information, 9.","DOI":"10.3390\/info9050119"},{"key":"ref_27","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"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1109\/TCYB.2019.2896267","article-title":"HUOPM: High-utility Occupancy Pattern Mining","volume":"50","author":"Gan","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Gan, W., Lin, C.-W., Fournier-Viger, P., Chao, H.-C., Tseng, V., and Yu, P. (2019). A Survey of Utility-Oriented Pattern Mining. IEEE Trans. Knowl. Data Eng., 1.","DOI":"10.1145\/3314107"},{"key":"ref_30","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":"Lin","year":"2016","journal-title":"Adv. Eng. Inform."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"7593","DOI":"10.1109\/ACCESS.2018.2801261","article-title":"MEMU: More Efficient Algorithm to Mine High Average-Utility Patterns With Multiple Minimum Average-Utility Thresholds","volume":"6","author":"Lin","year":"2018","journal-title":"IEEE Access"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhang, B., Lin, J.C.-W., Shao, Y., Fournier-Viger, P., and Djenouri, Y. (2018). Maintenance of Discovered High Average-Utility Itemsets in Dynamic Databases. Appl. Sci., 8.","DOI":"10.3390\/app8050769"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2715","DOI":"10.1016\/j.eswa.2012.11.021","article-title":"Utility-based association rule mining: A marketing solution for cross-selling","volume":"40","author":"Lee","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"ref_34","unstructured":"Choi, V. (2006). Faster Algorithms for Constructing a Concept (Galois) Lattice. arXiv."},{"key":"ref_35","unstructured":"Davey, B.A., and Priestley, H.A. (1990). Introduction to Lattices and Order, Cambridge University Press."},{"key":"ref_36","first-page":"193","article-title":"An efficient approach for mining closed high utility itemsets and generators","volume":"1","author":"Mai","year":"2017","journal-title":"J. Inf. Telecommun."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.knosys.2013.02.003","article-title":"A lattice-based approach for mining most generalization association rules","volume":"45","author":"Vo","year":"2013","journal-title":"Knowl.-Based Syst."},{"key":"ref_38","first-page":"92","article-title":"Mining minimal non-redundant association rules using frequent itemsets lattice","volume":"10","author":"Vo","year":"2011","journal-title":"Int. J. Intell. Syst. Technol. Appl."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"11630","DOI":"10.1016\/j.eswa.2011.03.042","article-title":"Interestingness measures for association rules: Combination between lattice and hash tables","volume":"38","author":"Vo","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_40","first-page":"3389","article-title":"SPMF: Open-source data mining library. SPMF: A Java open-source pattern mining library","volume":"15","author":"Gomariz","year":"2014","journal-title":"J. Mach. Learn. Res."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/20\/4\/1078\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:58:23Z","timestamp":1760173103000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/20\/4\/1078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,17]]},"references-count":40,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,2]]}},"alternative-id":["s20041078"],"URL":"https:\/\/doi.org\/10.3390\/s20041078","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2020,2,17]]}}}