{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:01:34Z","timestamp":1760598094054,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030880804"},{"type":"electronic","value":"9783030880811"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88081-1_35","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:07:08Z","timestamp":1632913628000},"page":"467-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cross-Level High-Utility Itemset Mining Using Multi-core Processing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3537-4726","authenticated-orcid":false,"given":"N. T.","family":"Tung","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6440-6462","authenticated-orcid":false,"given":"Loan T. T.","family":"Nguyen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2524-6416","authenticated-orcid":false,"given":"Trinh D. D.","family":"Nguyen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8445-3979","authenticated-orcid":false,"given":"Adrianna","family":"Kozierkiewicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal, R., et al.: Mining association rules between sets of items in large databases. ACM SIGMOD Rec. 22(2), 207\u2013216 (1993)","journal-title":"ACM SIGMOD Rec."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Alias, S., Norwawi, N.M.: pSPADE: mining sequential pattern using personalized support threshold value. In: Proceedings of the International Symposium on Information Technology 2008, ITSim, pp. 1\u20138 (2008)","DOI":"10.1109\/ITSIM.2008.4631672"},{"key":"35_CR3","first-page":"224","volume-title":"European Conference on Advances in Databases and Information Systems","author":"L Cagliero","year":"2017","unstructured":"Cagliero, L., et al.: Discovering high-utility itemsets at multiple abstraction levels. In: Kirikova, M., et al. (eds.) European Conference on Advances in Databases and Information Systems, pp. 224\u2013234. Springer International Publishing, Cham (2017)"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.bdr.2016.07.001","volume":"6","author":"Y Chen","year":"2016","unstructured":"Chen, Y., An, A.: Approximate parallel high utility itemset mining. Big Data Res. 6, 26\u201342 (2016)","journal-title":"Big Data Res."},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Cong, S., et al.: Parallel mining of closed sequential patterns. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 562\u2013567 (2005)","DOI":"10.1145\/1081870.1081937"},{"issue":"4","key":"35_CR6","first-page":"e1207","volume":"7","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger, P., et al.: A survey of itemset mining. Wiley Interdiscip. Rev.: Data Min. Knowl. Disc. 7(4), e1207 (2017)","journal-title":"Wiley Interdiscip. Rev.: Data Min. Knowl. Disc."},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-08326-1_9","volume-title":"Foundations of Intelligent Systems","author":"P Fournier-Viger","year":"2014","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: Andreasen, T., Christiansen, H., Cubero, J.-C., Ra\u015b, Z.W. (eds.) ISMIS 2014. LNCS (LNAI), vol. 8502, pp. 83\u201392. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08326-1_9"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1007\/978-3-030-55789-8_73","volume-title":"Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices","author":"P Fournier-Viger","year":"2020","unstructured":"Fournier-Viger, P., Wang, Y., Lin, J.-W., Luna, J.M., Ventura, S.: Mining Cross-Level High Utility Itemsets. In: Fujita, H., Fournier-Viger, P., Ali, M., Sasaki, J. (eds.) IEA\/AIE 2020. LNCS (LNAI), vol. 12144, pp. 858\u2013871. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55789-8_73"},{"issue":"1","key":"35_CR9","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., et al.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Disc. 8(1), 53\u201387 (2004)","journal-title":"Data Min. Knowl. Disc."},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/BFb0094807","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"J Hipp","year":"1998","unstructured":"Hipp, J., Myka, A., Wirth, R., G\u00fcntzer, U.: A new algorithm for faster mining of generalized association rules. In: \u017bytkow, J.M., Quafafou, M. (eds.) PKDD 1998. LNCS, vol. 1510, pp. 74\u201382. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0094807"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation categories and subject descriptors. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y Liu","year":"2005","unstructured":"Liu, Y., Liao, W., Choudhary, A.: A twohase algorithm for fast discovery of high utility itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 689\u2013695. Springer Berlin Heidelberg, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11430919_79"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","volume":"175","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen, L.T.T., et al.: Mining high-utility itemsets in dynamic profit databases. Knowl.-Based Syst. 175, 130\u2013144 (2019)","journal-title":"Knowl.-Based Syst."},{"issue":"1","key":"35_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0020-0255(02)00260-8","volume":"147","author":"NT Nguyen","year":"2002","unstructured":"Nguyen, N.T.: Consensus system for solving conflicts in distributed systems. Inf. Sci. 147(1), 91\u2013122 (2002)","journal-title":"Inf. Sci."},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/3-540-44411-4_30","volume-title":"SOFSEM 2000: Theory and Practice of Informatics","author":"NT Nguyen","year":"2000","unstructured":"Nguyen, N.T.: Using consensus methods for solving conflicts of data in distributed systems. In: Hlav\u00e1\u010d, V., Jeffery, K.G., Wiedermann, J. (eds.) SOFSEM 2000. LNCS, vol. 1963, pp. 411\u2013419. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44411-4_30"},{"key":"35_CR16","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-99996-8_26","volume-title":"Information Systems Architecture and Technology: Proceedings of 39th International Conference on Information Systems Architecture and Technology \u2013 ISAT 2018","author":"TDD Nguyen","year":"2019","unstructured":"Nguyen, T.D.D., Nguyen, L.T.T., Vo, B.: A parallel algorithm for mining high utility itemsets. In: \u015awi\u0105tek, J., Borzemski, L., Wilimowska, Z. (eds.) ISAT 2018. AISC, vol. 853, pp. 286\u2013295. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-99996-8_26"},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-73280-6_8","volume-title":"Intelligent Information and Database Systems","author":"TDD Nguyen","year":"2021","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.) ACIIDS 2021. LNCS (LNAI), vol. 12672, pp. 92\u2013103. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73280-6_8"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Nouioua, M., et al.: 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":"35_CR19","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.procs.2018.05.107","volume":"132","author":"KK Sethi","year":"2018","unstructured":"Sethi, K.K., Ramesh, D., Edla, D.R.: P-FHM+: parallel high utility itemset mining algorithm for big data processing. Procedia Comput. Sci. 132, 918\u2013927 (2018)","journal-title":"Procedia Comput. Sci."},{"issue":"2\u20133","key":"35_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0167-739X(97)00019-8","volume":"13","author":"R Srikant","year":"1997","unstructured":"Srikant, R., Agrawal, R.: Mining generalized association rules. Futur. Gener. Comput. Syst. 13(2\u20133), 161\u2013180 (1997)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"35_CR21","doi-asserted-by":"publisher","first-page":"85890","DOI":"10.1109\/ACCESS.2020.2992729","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo, B., et al.: A multi-core approach to efficiently mining high-utility itemsets in dynamic profit databases. IEEE Access. 8, 85890\u201385899 (2020)","journal-title":"IEEE Access."},{"issue":"3","key":"35_CR22","first-page":"19","volume":"2","author":"B Vo","year":"2009","unstructured":"Vo, B., Le, B.: Fast algorithm for mining generalized association rules. Int. J. Datab. Theor. Appl. 2(3), 19\u201321 (2009)","journal-title":"Int. J. Datab. Theor. Appl."},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Yao, H., et al.: A foundational approach to mining itemset utilities from databases. In: SIAM International Conference on Data Mining, pp. 482\u2013486 (2004)","DOI":"10.1137\/1.9781611972740.51"},{"key":"35_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, T., Bai, S.: A parallel mining algorithm for closed sequential patterns. In: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops\/Symposia, AINAW 2007, pp. 392\u2013395 (2007)","DOI":"10.1109\/AINAW.2007.40"},{"issue":"2","key":"35_CR25","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.-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)","journal-title":"Knowl. Inf. Syst."}],"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-030-88081-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:20:22Z","timestamp":1632914422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88081-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030880804","9783030880811"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88081-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 September 2021","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":"Rhodos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"231","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}