{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:29:09Z","timestamp":1743143349307,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031708152"},{"type":"electronic","value":"9783031708169"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70816-9_30","type":"book-chapter","created":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:28Z","timestamp":1725552148000},"page":"382-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficiently Discover Multi-level Maximal High-Utility Patterns from Hierarchical Databases"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2524-6416","authenticated-orcid":false,"given":"Trinh D. D.","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3537-4726","authenticated-orcid":false,"given":"N. T.","family":"Tung","sequence":"additional","affiliation":[],"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":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2723-1138","authenticated-orcid":false,"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami A.: Mining asso-ciation rules between sets of items in large data-bases. ACM SIGMOD Rec.  22, 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., Butz, G.J.: A foundational ap-proach to mining itemset utilities from databases. In: SIAM International Conference on Data Mining, pp. 482\u2013486 (2004)","DOI":"10.1137\/1.9781611972740.51"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: ACM International Confer-ence Proceeding Series, pp. 55\u201364 (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Tung, N.T., Nguyen, L.T.T., Nguyen, T.D.D., Fourier-Viger, P., Nguyen, N.T., Vo, B.: Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases. Inf Sci (N Y) 587, 41\u201362 (2022)","DOI":"10.1016\/j.ins.2021.12.017"},{"key":"30_CR5","doi-asserted-by":"crossref","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: International Symposium on Methodologies for Intelligent Systems, pp. 83\u201392 (2014)","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"30_CR6","doi-asserted-by":"crossref","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, 595\u2013625 (2017)","DOI":"10.1007\/s10115-016-0986-0"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Wu, C.W., Fournier-Viger, P., Gu, J.Y., Tseng, V.S.: Mining closed+ high utility itemsets without candidate generation. In: TAAI 2015 - 2015 Conference on Technologies and Applications of Artificial Intelligence, pp. 187\u2013194. IEEE (2016)","DOI":"10.1109\/TAAI.2015.7407089"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Dam, T.L., Li, K., Fournier-Viger, P., Duong, Q.H.:  CLS-Miner: efficient and effective closed high-utility itemset mining. Front. Comput. Sci. 13, 357\u2013381 (2019)","DOI":"10.1007\/s11704-016-6245-4"},{"key":"30_CR9","doi-asserted-by":"publisher","unstructured":"Fournier-Viger, P., Zida, S., Lin, J.CW., Wu, CW., Tseng, V.S.: EFIM-Closed: fast and memory efficient discovery of closed high-utility itemsets. In: Perner, P. (eds.) Machine Learning and Data Mining in Pattern Recognition. MLDM 2016. LNCS, vol. 9729, pp 199\u2013213. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41920-6_15","DOI":"10.1007\/978-3-319-41920-6_15"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Nguyen, T.D.D., Nguyen, L.T.T., Vu, L., Vo, B., Pedrycz, W.:  Efficient algorithms for mining closed high utili-ty itemsets in dynamic profit databases. Expert Syst. Appl. 186, 115741 (2021)","DOI":"10.1016\/j.eswa.2021.115741"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Nguyen, L.T.T., Vu, D.B., Nguyen, T.D.D., Vo, B.: Min-ing maximal high utility itemsets on dynamic profit da-tabases. Cybern. Syst. 51, 140\u2013160 (2020)","DOI":"10.1080\/01969722.2019.1705549"},{"key":"30_CR12","doi-asserted-by":"publisher","unstructured":"Cagliero, L., Chiusano, S., Garza, P., Ricupero, G.: Discovering high-utility itemsets at multiple abstrac-tion levels.  In: Kirikova, M., et al. (eds.) New Trends in Databases and Information Systems. ADBIS 2017. CCIS, vol. 767, pp. 224\u2013234. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67162-8_22","DOI":"10.1007\/978-3-319-67162-8_22"},{"key":"30_CR13","doi-asserted-by":"publisher","unstructured":"Fournier-Viger, P., Wang, Y., Lin, J.CW., Luna, J.M., Ventura, S.:  Mining cross-level high utility itemsets. In: Fujita, H., Fournier-Viger, P., Ali, M., Sasaki, J. (eds) Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices. IEA\/AIE 2020. LNCS, vol. 12144, pp. 858\u2013871\n. Springer, Cham (2020).  https:\/\/doi.org\/10.1007\/978-3-030-55789-8_73","DOI":"10.1007\/978-3-030-55789-8_73"},{"key":"30_CR14","doi-asserted-by":"publisher","unstructured":"Nguyen, T.D.D., Nguyen, L.T.T., Kozierkiewicz, A., Pham, T., Vo, B.: An efficient approach for mining high-utility itemsets from multiple abstraction levels.  In: Nguyen, N.T., Chittayasothorn, S., Niyato, D., Trawi\u0144ski, B. (eds.) Intelligent Information and Database Systems. ACIIDS 2021. LNCS, vol. 12672. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73280-6_8","DOI":"10.1007\/978-3-030-73280-6_8"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Tung, N.T., Nguyen, L.T.T., Nguyen, T.D.D., Vo, B.:  An efficient method for mining multi-level high utility Item-sets. App. Intell. 52, 5475\u20135496 (2022)","DOI":"10.1007\/s10489-021-02681-z"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Nouioua, M., Wang, Y., Fournier-Viger, P., Lin, J.C.-W., Wu, J.M.-T.:  TKC: mining top-k cross-level high utility itemsets. In: 2020 International Conference on Data Mining Workshops (ICDMW), pp. 673\u2013682 (2020)","DOI":"10.1109\/ICDMW51313.2020.00095"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Tung, N.T., Nguyen, L.T.T., Nguyen, T.D.D., Fourier-Viger, P., Nguyen, N.T., Vo, B.: Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases. Inf. Sci. (N Y) 587, 41\u201362 (2022)","DOI":"10.1016\/j.ins.2021.12.017"},{"key":"30_CR18","doi-asserted-by":"publisher","unstructured":"Liu, Y., Liao, W.K., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) Advances in Knowledge Discovery and Data Mining. PAKDD 2005. LNCS, vol. 3518, pp. 689\u2013695. Springer, Berlin, Heidelberg (2005).   https:\/\/doi.org\/10.1007\/11430919_79","DOI":"10.1007\/11430919_79"},{"key":"30_CR19","doi-asserted-by":"publisher","unstructured":"Wu, C.W., Fournier-Viger, P., Gu, J.Y., Tseng, V.S.:   Mining compact high utility itemsets without candidate generation. In: Fournier-Viger, P., Lin, J.W., Nkambou, R., Vo, B., Tseng, V. (eds.) High-Utility Pattern Mining. Studies in Big Data, LNCS, vol. 51, pp. 41\u201362. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-04921-8_11","DOI":"10.1007\/978-3-030-04921-8_11"},{"key":"30_CR20","doi-asserted-by":"publisher","unstructured":"Fournier-Viger, P., et al.:  The SPMF open-source data mining library version 2. In: Berendt, B., et al. (eds.) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2016. LNCS, vol. 9853, pp. 36\u201340. Springer, Cham (2016).   https:\/\/doi.org\/10.1007\/978-3-319-46131-1_8","DOI":"10.1007\/978-3-319-46131-1_8"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70816-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:07:36Z","timestamp":1725552456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70816-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031708152","9783031708169"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70816-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leipzig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}