{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T23:51:59Z","timestamp":1773359519441,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031843525","type":"print"},{"value":"9783031843532","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-84353-2_25","type":"book-chapter","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T13:50:39Z","timestamp":1740491439000},"page":"289-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Effective High Utility Itemsets Mining Algorithm for Incremental Databases"],"prefix":"10.1007","author":[{"given":"Do Thanh","family":"Cong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Do Mai","family":"Phuong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pham Duc","family":"Duong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phan Duy","family":"Hung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,17]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liao, Wk., 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. Lecture Notes in Computer Science vol. 3518. Springer, Heidelberg (2005)","DOI":"10.1007\/11430919_79"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Wu, CW., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Andreasen, T., Christiansen, H., Cubero, JC., Ra\u015b, Z.W. (eds.) Foundations of Intelligent Systems. ISMIS 2014. Lecture Notes in Computer Science, vol. 8502. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Zida, S., Fournier-Viger, P., Lin, J.CW., Wu, CW., Tseng, V.S.: EFIM: a highly efficient algorithm for high-utility itemset mining. In: Sidorov, G., Galicia-Haro, S. (eds.) Advances in Artificial Intelligence and Soft Computing. MICAI 2015. Lecture Notes in Computer Science, vol. 9413. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-27060-9_44"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Liu, Y., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM \u201812), pp. 55\u201364. Association for Computing Machinery, New York (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","volume":"90","author":"S Krishnamoorthy","year":"2017","unstructured":"Krishnamoorthy, S.: HMiner: efficiently mining high utility itemsets. Expert Syst. Appl. 90, 168\u2013183 (2017)","journal-title":"Expert Syst. Appl."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Lin, J.C.W., Gueniche, T., Barhate, P.: Efficient incremental high utility itemset mining. In: Proceedings of the ASE BigData & SocialInformatics 2015 (ASE BD&SI \u201815), Article 53, pp. 1\u20136. Association for Computing Machinery, New York (2015)","DOI":"10.1145\/2818869.2818887"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1242","volume":"8","author":"W Gan","year":"2018","unstructured":"Gan, W., Lin, J.C.W., Fournier-Viger, P., Chao, H.C., Hong, T.P., Fujita, H.: A survey of incremental high-utility itemset mining. Wiley Interdisc. Rev. Data Mining Knowl. Disc. 8(2), e1242 (2018)","journal-title":"Wiley Interdisc. Rev. Data Mining Knowl. Disc."},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.aei.2014.08.003","volume":"29","author":"CW Lin","year":"2015","unstructured":"Lin, C.W., Hong, T.P., Lan, G.C., Wong, J.W., Lin, W.Y.: Efficient updating of discovered high utility itemsets for transaction deletion in dynamic databases. Adv. Eng. Inform. 29(1), 16\u201327 (2015)","journal-title":"Adv. Eng. Inform."},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10489-013-0467-z","volume":"40","author":"CW Lin","year":"2014","unstructured":"Lin, C.W., Hong, T.P., Lan, G.C., Wong, J.W., Lin, W.Y.: Incrementally mining high utility patterns based on pre-large concept. Appl. Intell. 40(2), 343\u2013357 (2014)","journal-title":"Appl. Intell."},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.3233\/IDA-2001-5203","volume":"5","author":"TP Hong","year":"2001","unstructured":"Hong, T.P., Wang, C.Y., Tao, Y.H.: A new incremental data mining algorithm using pre-large itemset. Intell. Data Anal. 5(2), 111\u2013129 (2001)","journal-title":"Intell. Data Anal."},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.aei.2015.05.003","volume":"29","author":"JCW Lin","year":"2015","unstructured":"Lin, J.C.W., Gan, W., Hong, T.P.: A fast updated algorithm to maintain the discovered high utility itemsets for transaction modification. Adv. Eng. Inform. 29(3), 562\u2013574 (2015)","journal-title":"Adv. Eng. Inform."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.engappai.2018.03.020","volume":"72","author":"J Lee","year":"2018","unstructured":"Lee, J., Yun, U., Lee, G., Yoon, E.: Efficient incremental high utility pattern mining based on pre-large concept. Eng. Appl. Artif. Intell. 72, 111\u2013123 (2018)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-14717-8_4","volume-title":"Advanced Data Mining and Applications","author":"JC-W Lin","year":"2014","unstructured":"Lin, J.C.-W., Gan, W., Hong, T.-P., Pan, J.-S.: Incrementally updating high-utility itemsets with transaction insertion. In: Luo, X., Yu, J.X., Li, Z. (eds.) ADMA 2014. LNCS (LNAI), vol. 8933, pp. 44\u201356. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14717-8_4"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.03.016","volume":"124","author":"U Yun","year":"2017","unstructured":"Yun, U., Ryang, H., Lee, G., Fujita, H.: An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl.-Based Syst. 124, 188\u2013206 (2017)","journal-title":"Knowl.-Based Syst."},{"key":"25_CR15","unstructured":"Fournier-Viger, P.: The SPMF Open-Source Data Mining Library [Online] (2022). https:\/\/www.philippe-fournier-viger.com\/spmf\/index.php."},{"key":"25_CR16","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-981-33-4367-2_53","volume-title":"Emerging Technologies in Data Mining and Information Security","author":"N Ngoc Tram","year":"2021","unstructured":"Ngoc Tram, N., Duy Hung, P.: Analysing hot facebook users posts\u2019 sentiment using deep learning. In: Hassanien, A.E., Bhattacharyya, S., Chakrabati, S., Bhattacharya, A., Dutta, S. (eds.) Emerging Technologies in Data Mining and Information Security. AISC, vol. 1300, pp. 561\u2013569. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-33-4367-2_53"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Truong, N.T., Tue, N.K., Chinh, N.D., Huynh, L.D., Diep, V.T., Hung, P.D.: Efficient mining of top-k cross-level high utility itemsets. In: Dang, T.K., K\u00fcng, J., Chung, T.M. (eds.) Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications. FDSE 2023. Communications in Computer and Information Science, vol. 1925. Springer, Singapore (2023)","DOI":"10.1007\/978-981-99-8296-7_9"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Duy, H.A., Khoa, H.A., Hung, P.D.: Mining Correlated high-utility itemsets using the cosine measure. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds.) Artificial Intelligence and Soft Computing. ICAISC 2023. Lecture Notes in Computer Science vol. 14126. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-42508-0_28"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-84353-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T13:50:42Z","timestamp":1740491442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-84353-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031843525","9783031843532"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-84353-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"16 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icaisc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}