{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T03:05:31Z","timestamp":1779159931040,"version":"3.51.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T00:00:00Z","timestamp":1573084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T00:00:00Z","timestamp":1573084800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00354-019-00078-8","type":"journal-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T09:04:32Z","timestamp":1573117472000},"page":"153-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Mining High-Average Utility Itemsets with Positive and Negative External Utilities"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5635-2991","authenticated-orcid":false,"given":"Irfan","family":"Yildirim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mete","family":"Celik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,7]]},"reference":[{"issue":"2","key":"78_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Rec. 22(2), 207\u2013216 (1993). \nhttps:\/\/doi.org\/10.1145\/170036.170072","journal-title":"ACM SIGMOD Rec."},{"issue":"2","key":"78_CR2","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.amc.2009.05.066","volume":"215","author":"CJ Chu","year":"2009","unstructured":"Chu, C.J., Tseng, V.S., Liang, T.: An efficient algorithm for mining high utility itemsets with negative item values in large databases. Appl. Math. Comput. 215(2), 767\u2013778 (2009). \nhttps:\/\/doi.org\/10.1016\/j.amc.2009.05.066","journal-title":"Appl. Math. Comput."},{"key":"78_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"ZH Deng","year":"2016","unstructured":"Deng, Z.H.: DiffNodesets: an efficient structure for fast mining frequent itemsets. Appl. Soft. Comput. 41, 214\u2013223 (2016). \nhttps:\/\/doi.org\/10.1016\/j.asoc.2016.01.010","journal-title":"Appl. Soft. Comput."},{"key":"78_CR4","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gomariz, A., Gueniche, T., Soltani, A., Wu, C.W., Tseng, V.S.: Spmf: a java open-source pattern mining library. J. Mach. Learn. Res. 15, 3389\u20133393 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"78_CR5","doi-asserted-by":"publisher","unstructured":"Fournier-Viger, P., Wu, C.W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Lect. Notes in Comput. Sci., pp. 83\u201392. Springer International Publishing (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-08326-1_9","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"2","key":"78_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Rec. 29(2), 1\u201312 (2000). \nhttps:\/\/doi.org\/10.1145\/335191.335372","journal-title":"ACM SIGMOD Rec."},{"issue":"7","key":"78_CR7","doi-asserted-by":"publisher","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"TP Hong","year":"2011","unstructured":"Hong, T.P., Lee, C.H., Wang, S.L.: Effective utility mining with the measure of average utility. Expert Syst. with Appl. 38(7), 8259\u20138265 (2011). \nhttps:\/\/doi.org\/10.1016\/j.eswa.2011.01.006","journal-title":"Expert Syst. with Appl."},{"issue":"4","key":"78_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/bf03037636","volume":"23","author":"H Huang","year":"2005","unstructured":"Huang, H., Wu, X., Relue, R.: Mining frequent patterns with the pattern tree. New Gener. Comput. 23(4), 315\u2013337 (2005). \nhttps:\/\/doi.org\/10.1007\/bf03037636","journal-title":"New Gener. Comput."},{"issue":"1","key":"78_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s10489-016-0890-z","volume":"47","author":"D Kim","year":"2017","unstructured":"Kim, D., Yun, U.: Efficient algorithm for mining high average-utility itemsets in incremental transaction databases. Appl. Intell. 47(1), 114\u2013131 (2017). \nhttps:\/\/doi.org\/10.1007\/s10489-016-0890-z","journal-title":"Appl. Intell."},{"issue":"5","key":"78_CR10","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","volume":"42","author":"S Krishnamoorthy","year":"2015","unstructured":"Krishnamoorthy, S.: Pruning strategies for mining high utility itemsets. Expert Syst. Appl. 42(5), 2371\u20132381 (2015). \nhttps:\/\/doi.org\/10.1016\/j.eswa.2014.11.001","journal-title":"Expert Syst. Appl."},{"key":"78_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2017.12.035","volume":"145","author":"S Krishnamoorthy","year":"2018","unstructured":"Krishnamoorthy, S.: Efficiently mining high utility itemsets with negative unit profits. Knowl. Based Syst. 145, 1\u201314 (2018). \nhttps:\/\/doi.org\/10.1016\/j.knosys.2017.12.035","journal-title":"Knowl. Based Syst."},{"issue":"05","key":"78_CR12","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1142\/s0219622012500307","volume":"11","author":"GC Lan","year":"2012","unstructured":"Lan, G.C., Hong, T.P., Tseng, V.S.: Efficiently mining of high average-utility itemsets with an improved upper-bound strategy. Int. J. Inf. Technol. Decis. Making 11(05), 1009\u20131030 (2012). \nhttps:\/\/doi.org\/10.1142\/s0219622012500307","journal-title":"Int. J. Inf. Technol. Decis. Making"},{"key":"78_CR13","first-page":"193","volume":"28","author":"GC Lan","year":"2012","unstructured":"Lan, G.C., Hong, T.P., Tseng, V.S.: A projection-based approach for discovering high average-utility itemsets. J. Inf. Sci. Eng. 28, 193\u2013209 (2012)","journal-title":"J. Inf. Sci. Eng."},{"key":"78_CR14","doi-asserted-by":"publisher","unstructured":"Lin, C.W., Hong, T.P., Lu, W.H.: Efficiently mining high average utility itemsets with a tree structure. In: Intell. Inf. Database Syst., pp. 131\u2013139. Springer, Berlin (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-12145-6_14","DOI":"10.1007\/978-3-642-12145-6_14"},{"issue":"1","key":"78_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00354-008-0072-6","volume":"28","author":"CW Lin","year":"2010","unstructured":"Lin, C.W., Hong, T.P., Lu, W.H.: Using the structure of prelarge trees to incrementally mine frequent itemsets. New Gener. Comput. 28(1), 5\u201320 (2010). \nhttps:\/\/doi.org\/10.1007\/s00354-008-0072-6","journal-title":"New Gener. Comput."},{"issue":"6","key":"78_CR16","doi-asserted-by":"publisher","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","volume":"38","author":"CW Lin","year":"2011","unstructured":"Lin, C.W., Hong, T.P., Lu, W.H.: An effective tree structure for mining high utility itemsets. Expert Syst. Appl. 38(6), 7419\u20137424 (2011). \nhttps:\/\/doi.org\/10.1016\/j.eswa.2010.12.082","journal-title":"Expert Syst. Appl."},{"key":"78_CR17","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.knosys.2016.08.022","volume":"111","author":"JCW Lin","year":"2016","unstructured":"Lin, J.C.W., Fournier-Viger, P., Gan, W.: FHN: an efficient algorithm for mining high-utility itemsets with negative unit profits. Knowl. Based Syst. 111, 283\u2013298 (2016). \nhttps:\/\/doi.org\/10.1016\/j.knosys.2016.08.022","journal-title":"Knowl. Based Syst."},{"issue":"2","key":"78_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JCW Lin","year":"2016","unstructured":"Lin, J.C.W., Li, T., Fournier-Viger, P., Hong, T.P., Zhan, J., Voznak, M.: An efficient algorithm to mine high average-utility itemsets. Adv. Eng. Inf. 30(2), 233\u2013243 (2016). \nhttps:\/\/doi.org\/10.1016\/j.aei.2016.04.002","journal-title":"Adv. Eng. Inf."},{"key":"78_CR19","doi-asserted-by":"publisher","first-page":"12927","DOI":"10.1109\/access.2017.2717438","volume":"5","author":"JCW Lin","year":"2017","unstructured":"Lin, J.C.W., Ren, S., Fournier-Viger, P., Hong, T.P.: EHAUPM: efficient high average-utility pattern mining with tighter upper bounds. IEEE Access 5, 12927\u201312940 (2017). \nhttps:\/\/doi.org\/10.1109\/access.2017.2717438","journal-title":"IEEE Access"},{"issue":"2","key":"78_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10489-017-0896-1","volume":"47","author":"JCW Lin","year":"2017","unstructured":"Lin, J.C.W., Ren, S., Fournier-Viger, P., Hong, T.P., Su, J.H., Vo, B.: A fast algorithm for mining high average-utility itemsets. Appl. Intell. 47(2), 331\u2013346 (2017). \nhttps:\/\/doi.org\/10.1007\/s10489-017-0896-1","journal-title":"Appl. Intell."},{"issue":"10","key":"78_CR21","doi-asserted-by":"publisher","first-page":"3691","DOI":"10.1007\/s10489-018-1180-8","volume":"48","author":"JCW Lin","year":"2018","unstructured":"Lin, J.C.W., Shao, Y., Fournier-Viger, P., Djenouri, Y., Guo, X.: Maintenance algorithm for high average-utility itemsets with transaction deletion. Appl. Intell. 48(10), 3691\u20133706 (2018). \nhttps:\/\/doi.org\/10.1007\/s10489-018-1180-8","journal-title":"Appl. Intell."},{"issue":"5","key":"78_CR22","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1109\/tkde.2015.2510012","volume":"28","author":"J Liu","year":"2016","unstructured":"Liu, J., Wang, K., Fung, B.C.: Mining high utility patterns in one phase without generating candidates. IEEE Trans. Knowl. Data Eng. 28(5), 1245\u20131257 (2016). \nhttps:\/\/doi.org\/10.1109\/tkde.2015.2510012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"78_CR23","doi-asserted-by":"publisher","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proc. of the 21st ACM Int. Conf. Inf. Knowl. Manag., CIKM (2012). \nhttps:\/\/doi.org\/10.1145\/2396761.2396773","DOI":"10.1145\/2396761.2396773"},{"key":"78_CR24","doi-asserted-by":"publisher","unstructured":"Liu, Y., Liao, W.K., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Adv. Knowl. Discov. Data Min., pp. 689\u2013695. Springer, Berlin (2005). \nhttps:\/\/doi.org\/10.1007\/11430919_79","DOI":"10.1007\/11430919_79"},{"key":"78_CR25","doi-asserted-by":"publisher","unstructured":"Lu, T., Vo, B., Nguyen, H.T., Hong, T.P.: A new method for mining high average utility itemsets. In: Comput. Inf. Syst. Ind. Manag., pp. 33\u201342. Springer, Berlin (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-45237-0_5","DOI":"10.1007\/978-3-662-45237-0_5"},{"key":"78_CR26","doi-asserted-by":"publisher","unstructured":"Peng, A.Y., Koh, Y.S., Riddle, P.: mHUIMiner: a fast high utility itemset mining algorithm for sparse datasets. In: Adv. in Knowl. Discov. Data Min., pp. 196\u2013207. Springer International Publishing (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-57529-2_16","DOI":"10.1007\/978-3-319-57529-2_16"},{"issue":"2","key":"78_CR27","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10115-016-0989-x","volume":"51","author":"H Ryang","year":"2016","unstructured":"Ryang, H., Yun, U.: Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques. Knowl. Inf. Syst. 51(2), 627\u2013659 (2016). \nhttps:\/\/doi.org\/10.1007\/s10115-016-0989-x","journal-title":"Knowl. Inf. Syst."},{"key":"78_CR28","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12296","author":"K Singh","year":"2018","unstructured":"Singh, K., Shakya, H.K., Singh, A., Biswas, B.: Mining of high-utility itemsets with negative utility. Expert Syst. (2018). \nhttps:\/\/doi.org\/10.1111\/exsy.12296","journal-title":"Expert Syst."},{"key":"78_CR29","doi-asserted-by":"publisher","unstructured":"Truong, T., Duong, H., Le, H.B., Viger, P.F.: Efficient vertical mining of high average-utility itemsets based on novel upper-bounds. IEEE Trans. Knowl. Data. Eng., pp. 301\u2013314 (2018). \nhttps:\/\/doi.org\/10.1109\/tkde.2018.2833478","DOI":"10.1109\/tkde.2018.2833478"},{"issue":"8","key":"78_CR30","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/tkde.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng, V.S., Shie, B.E., Wu, C.W., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772\u20131786 (2013). \nhttps:\/\/doi.org\/10.1109\/tkde.2012.59","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"78_CR31","doi-asserted-by":"publisher","unstructured":"Tseng, V.S., Wu, C.W., Shie, B.E., Yu, P.S.: UP-growth: an efficient algorithm for high utility itemset mining. In: Proc. 16th ACM SIGKDD Int. Conf. Knowl. Discov. Data Min. (2010). \nhttps:\/\/doi.org\/10.1145\/1835804.1835839","DOI":"10.1145\/1835804.1835839"},{"key":"78_CR32","doi-asserted-by":"publisher","first-page":"18655","DOI":"10.1109\/access.2018.2820740","volume":"6","author":"JMT Wu","year":"2018","unstructured":"Wu, J.M.T., Lin, J.C.W., Pirouz, M., Fournier-Viger, P.: TUB-HAUPM: tighter upper bound for mining high average-utility patterns. IEEE Access 6, 18655\u201318669 (2018). \nhttps:\/\/doi.org\/10.1109\/access.2018.2820740","journal-title":"IEEE Access"},{"key":"78_CR33","doi-asserted-by":"publisher","unstructured":"Wu, T.Y., Lin, J.C.W., Shao, Y., Fournier-Viger, P., Hong, T.P.: Updating the discovered high average-utility patterns with transaction insertion. In: Adv. Intell. Syst. Comput., pp. 66\u201373. Springer Singapore (2017). \nhttps:\/\/doi.org\/10.1007\/978-981-10-6487-6_9","DOI":"10.1007\/978-981-10-6487-6_9"},{"key":"78_CR34","doi-asserted-by":"publisher","unstructured":"Yildirim, I., Celik, M.: FIMHAUI: Fast incremental mining of high average-utility itemsets. In: 2018 Int. Conf. on Artif. Intell. and Data Process. (IDAP). IEEE (2018). \nhttps:\/\/doi.org\/10.1109\/idap.2018.8620819","DOI":"10.1109\/idap.2018.8620819"},{"key":"78_CR35","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.future.2016.10.027","volume":"68","author":"U Yun","year":"2017","unstructured":"Yun, U., Kim, D.: Mining of high average-utility itemsets using novel list structure and pruning strategy. Future Gener. Comput. Syst. 68, 346\u2013360 (2017). \nhttps:\/\/doi.org\/10.1016\/j.future.2016.10.027","journal-title":"Future Gener. Comput. Syst."},{"key":"78_CR36","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.12.029","volume":"144","author":"U Yun","year":"2018","unstructured":"Yun, U., Kim, D., Yoon, E., Fujita, H.: Damped window based high average utility pattern mining over data streams. Knowl. Based Syst. 144, 188\u2013205 (2018). \nhttps:\/\/doi.org\/10.1016\/j.knosys.2017.12.029","journal-title":"Knowl. Based Syst."},{"issue":"2","key":"78_CR37","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","volume":"51","author":"S Zida","year":"2016","unstructured":"Zida, S., Fournier-Viger, P., Lin, J.C.W., Wu, C.W., Tseng, V.S.: EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl. Inf. Syst. 51(2), 595\u2013625 (2016). \nhttps:\/\/doi.org\/10.1007\/s10115-016-0986-0","journal-title":"Knowl. Inf. Syst."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-019-00078-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-019-00078-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-019-00078-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T00:32:55Z","timestamp":1604622775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-019-00078-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,7]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["78"],"URL":"https:\/\/doi.org\/10.1007\/s00354-019-00078-8","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,7]]},"assertion":[{"value":"27 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}