{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:36:38Z","timestamp":1755794198374,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T00:00:00Z","timestamp":1631318400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T00:00:00Z","timestamp":1631318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100016999","name":"Western Norway University Of Applied Sciences","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100016999","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recently, revealing more valuable information except for quantity value for a database is an essential research field. High utility itemset mining (HAUIM) was suggested to reveal useful patterns by average-utility measure for pattern analytics and evaluations. HAUIM provides a more fair assessment than generic high utility itemset mining and ignores the influence of the length of itemsets. There are several high-performance HAUIM algorithms proposed to gain knowledge from a disorganized database. However, most existing works do not concern the uncertainty factor, which is one of the characteristics of data gathered from IoT equipment. In this work, an efficient algorithm for HAUIM to handle the uncertainty databases in IoTs is presented. Two upper-bound values are estimated to early diminish the search space for discovering meaningful patterns that greatly solve the limitations of pattern mining in IoTs. Experimental results showed several evaluations of the proposed approach compared to the existing algorithms, and the results are acceptable to state that the designed approach efficiently reveals high average utility itemsets from an uncertain situation.<\/jats:p>","DOI":"10.1007\/s10489-021-02751-2","type":"journal-article","created":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T01:31:31Z","timestamp":1631323891000},"page":"6450-6463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Analytics of high average-utility patterns in the industrial internet of things"],"prefix":"10.1007","volume":"52","author":[{"given":"Jimmy Ming-Tai","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongcui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8768-9709","authenticated-orcid":false,"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,11]]},"reference":[{"key":"2751_CR1","doi-asserted-by":"crossref","unstructured":"Maddikunta PKR, Gadekallu TR, Kaluri R, Srivastava G, Parizi RM, Khan MS (2020) Green communication in iot networks using a hybrid optimization algorithm. Comput Commun","DOI":"10.1016\/j.comcom.2020.05.020"},{"issue":"11","key":"2751_CR2","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1049\/iet-its.2020.0009","volume":"14","author":"PKR Maddikunta","year":"2020","unstructured":"Maddikunta PKR, Srivastava G, Gadekallu TR, Deepa ND, Boopathy P (2020) Predictive model for battery life in iot networks. IET Intell Transp Syst 14(11):1388\u20131395","journal-title":"IET Intell Transp Syst"},{"key":"2751_CR3","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: International conference on very large data bases, pp 619\u2013624"},{"key":"2751_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: IEEE international conference on data engineering, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"2751_CR5","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: The pacific-asia conference on knowledge discovery and data mining, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"2751_CR6","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: SIAM international conference on data mining, pp 211\u2013225","DOI":"10.1137\/1.9781611972740.51"},{"issue":"8","key":"2751_CR7","doi-asserted-by":"publisher","first-page":"431047","DOI":"10.1155\/2015\/431047","volume":"11","author":"F Chen","year":"2015","unstructured":"Chen F, Deng P, Wan J, Zhang D, Vasilakos AV, Rong X (2015) Data mining for the internet of things: literature review and challenges. Int J Distrib Sensor Netw 11(8):431047","journal-title":"Int J Distrib Sensor Netw"},{"key":"2751_CR8","unstructured":"Gan W, Lin JCWL, Fournier-Viger P, Chao HCC, Tseng V, Yu P (2019) A survey of utility-oriented pattern mining. IEEE Trans Knowl Data Eng"},{"key":"2751_CR9","first-page":"1","volume":"2014","author":"CW Lin","year":"2014","unstructured":"Lin CW, Hong TP, Hsu HC (2014) Reducing side effects of hiding sensitive itemsets in privacy preserving data mining. Sci World J 2014:1\u201312","journal-title":"Sci World J"},{"key":"2751_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10489-014-0590-5","volume":"42","author":"CW Lin","year":"2015","unstructured":"Lin CW, Hong TP, Yang KT, Wang SL (2015) The ga-based algorithms for optimizing hiding sensitive itemsets through transaction deletion. Appl Intell 42:210\u2013230","journal-title":"Appl Intell"},{"key":"2751_CR11","doi-asserted-by":"crossref","unstructured":"Lin JCW, Srivastava G, Zhang Y, Djenouri Y, Aloqaily M (2020) Privacy preserving multi-objective sanitization model in 6g iot environments. IEEE Internet of Things J","DOI":"10.1109\/JIOT.2020.3032896"},{"issue":"7","key":"2751_CR12","doi-asserted-by":"publisher","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"TP Hong","year":"2011","unstructured":"Hong TP, Lee CH, Wang SL (2011) Effective utility mining with the measure of average utility. Expert Syst Appl 38(7):8259\u2013 8265","journal-title":"Expert Syst Appl"},{"key":"2751_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-12145-6_14","volume":"5990","author":"CW Lin","year":"2010","unstructured":"Lin CW, Hong TP, Lu WH (2010) Efficiently mining high average utility itemsets with a tree structure. Lect Notes Comput Sci 5990:131\u2013139","journal-title":"Lect Notes Comput Sci"},{"issue":"2","key":"2751_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Li T, Fournier-Viger P, Hong TP, Zhan J, Voznak M (2016) An efficient algorithm to mine high average-utility itemsets. Adv Eng Inform 30(2):233\u2013243","journal-title":"Adv Eng Inform"},{"key":"2751_CR15","doi-asserted-by":"crossref","unstructured":"Lin JCW, Shao Y, Djenouri Y, Yun U (2020) Asrnn: A recurrent neural network with an attention model for sequence labeling. Knowl-Based Syst","DOI":"10.1016\/j.knosys.2020.106548"},{"issue":"4","key":"2751_CR16","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1109\/TII.2017.2670505","volume":"13","author":"J Wan","year":"2017","unstructured":"Wan J, Tang S, Li D, Wang S, Liu C, Abbas H, Vasilakos AV (2017) A manufacturing big data solution for active preventive maintenance. IEEE Trans Ind Inform 13(4):2039\u20132047","journal-title":"IEEE Trans Ind Inform"},{"issue":"5","key":"2751_CR17","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MCOM.2017.1600240","volume":"55","author":"Y Liu","year":"2017","unstructured":"Liu Y, Weng X, Wan J, Yue X, Song H, Vasilakos AV (2017) Exploring data validity in transportation systems for smart cities. IEEE Commun Mag 55(5):26\u201333","journal-title":"IEEE Commun Mag"},{"issue":"1","key":"2751_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min Knowl Disc 8(1):53\u201387","journal-title":"Data Min Knowl Disc"},{"issue":"5","key":"2751_CR19","first-page":"363","volume":"3","author":"TP Hong","year":"1999","unstructured":"Hong TP, Kuo CS, Chi SC (1999) Mining association rules from quantitative data. Intell Data Anal 3(5):363\u2013376","journal-title":"Intell Data Anal"},{"issue":"3","key":"2751_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1132960.1132963","volume":"38","author":"L Geng","year":"2006","unstructured":"Geng L, Hamilton HJ (2006) Interestingness measures for data mining: A survey. ACM Comput Surv 38(3):9","journal-title":"ACM Comput Surv"},{"key":"2751_CR21","doi-asserted-by":"crossref","unstructured":"Chui CK, Kao B, Hung E (2007) Mining frequent itemsets from uncertain data. In: Pacific-asia conference on knowledge discovery and data mining. Springer, pp 47\u201358","DOI":"10.1007\/978-3-540-71701-0_8"},{"key":"2751_CR22","doi-asserted-by":"crossref","unstructured":"Bernecker T, Kriegel HP, Renz M, Verhein F, Zuefle A (2009) Probabilistic frequent itemset mining in uncertain databases. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 119\u2013128","DOI":"10.1145\/1557019.1557039"},{"issue":"5","key":"2751_CR23","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TKDE.2008.190","volume":"21","author":"CC Aggarwal","year":"2009","unstructured":"Aggarwal CC, Yu PS (2009) A survey of uncertain data algorithms and applications. IEEE Trans Knowl Data Eng 21(5):609\u2013623","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2751_CR24","doi-asserted-by":"publisher","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Tseng VS, Yu PS (2019) A survey of utility-oriented pattern mining, IEEE Trans Knowl Data Eng :1\u201322. https:\/\/doi.org\/10.1109\/TKDE.2019.2942594","DOI":"10.1109\/TKDE.2019.2942594"},{"key":"2751_CR25","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM international conference on information and knowledge management. ACM, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"2751_CR26","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Proceedings of the SIAM international conference on data mining. SIAM, pp 482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"key":"2751_CR27","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Pacific-asia conference on knowledge discovery and data mining. Springer, pp 689\u2013 695","DOI":"10.1007\/11430919_79"},{"issue":"12","key":"2751_CR28","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"2751_CR29","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng VS, Shie BE, Wu CW, Yu PS (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2751_CR30","doi-asserted-by":"crossref","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Hong TP, Fujita H (2018) A survey of incremental high-utility itemset mining. Wiley Interdiscipl Rev Data Min Knowl Discov 8(2)","DOI":"10.1002\/widm.1242"},{"issue":"2","key":"2751_CR31","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Hong TP, Tseng VS (2016) Fast algorithms for mining high-utility itemsets with various discount strategies. Adv Eng Inform 30(2):109\u2013126","journal-title":"Adv Eng Inform"},{"key":"2751_CR32","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.knosys.2016.08.022","volume":"111","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Fournier-Viger P, Gan W (2016) FHN: An efficient algorithm for mining high-utility itemsets with negative unit profits. Knowl-Based Syst 111:283\u2013298","journal-title":"Knowl-Based Syst"},{"key":"2751_CR33","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1142\/S0219622012500307","volume":"11","author":"GC Lan","year":"2012","unstructured":"Lan GC, Hong TP, Tseng VS (2012) Efficiently mining high average-utility itemsets with an improved upper-bound strategy. Int J Inf Technol Decis Making 11:1009\u20131030","journal-title":"Int J Inf Technol Decis Making"},{"issue":"2","key":"2751_CR34","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10489-017-0896-1","volume":"47","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Ren S, Fournier-Viger P, Hong TP, Su JH, Vo B (2017) A fast algorithm for mining high average-utility itemsets. Appl Intell 47(2):331\u2013346","journal-title":"Appl Intell"},{"key":"2751_CR35","doi-asserted-by":"crossref","unstructured":"Leung CKS, Mateo MAF, Brajczuk DA (2008) A tree-based approach for frequent pattern mining from uncertain data. In: The pacific-asia conference on knowledge discovery and data mining, pp 653\u2013661","DOI":"10.1007\/978-3-540-68125-0_61"},{"key":"2751_CR36","doi-asserted-by":"crossref","unstructured":"Wang L, Cheng R, Lee SD, Cheung D (2010) Accelerating probabilistic frequent itemset mining: A model-based approach. In: ACM international conference on information and knowledge management, pp 429\u2013438","DOI":"10.1145\/1871437.1871494"},{"issue":"3","key":"2751_CR37","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/s10115-016-0977-1","volume":"53","author":"J Ge","year":"2017","unstructured":"Ge J, Xia Y, Wang J, Nadungodage CH, Prabhakar S (2017) Sequential pattern mining in databases with temporal uncertainty. Knowl Inf Syst 53(3):821\u2013850","journal-title":"Knowl Inf Syst"},{"issue":"11","key":"2751_CR38","doi-asserted-by":"publisher","first-page":"2801","DOI":"10.1007\/s00500-016-2159-1","volume":"21","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Hong TP (2017) Efficiently mining uncertain high-utility itemsets. Soft Comput 21(11):2801\u2013282","journal-title":"Soft Comput"},{"key":"2751_CR39","doi-asserted-by":"crossref","unstructured":"Ahmed U, Lin JCW, Srivastava G, Yasin R, Djenouri Y (2020) An evolutionary model to mine high expected utility patterns from uncertain databases. IEEE Trans Emerg Top Comput Intell","DOI":"10.1109\/TETCI.2020.3000224"},{"key":"2751_CR40","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The spmf open-source data mining library version 2. In: Joint european conference on machine learning and knowledge discovery in databases, pp 36\u201340","DOI":"10.1007\/978-3-319-46131-1_8"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02751-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02751-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02751-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T04:20:43Z","timestamp":1649823643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02751-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,11]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["2751"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02751-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2021,9,11]]},"assertion":[{"value":"5 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}