{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:06:43Z","timestamp":1742940403005,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031425073"},{"type":"electronic","value":"9783031425080"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-42508-0_28","type":"book-chapter","created":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T06:02:34Z","timestamp":1694584954000},"page":"307-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining Correlated High-Utility Itemsets Using the Cosine Measure"],"prefix":"10.1007","author":[{"given":"Huynh Anh","family":"Duy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huynh Anh","family":"Khoa","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":[[2023,9,14]]},"reference":[{"key":"28_CR1","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":"28_CR2","doi-asserted-by":"crossref","unstructured":"Mengchi, L., Junfeng, Q.: Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management (CIKM 2012), pp. 55\u201364. Association for Computing Machinery, New York (2012)","DOI":"10.1145\/2396761.2396773"},{"issue":"8","key":"28_CR3","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)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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 two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 689\u2013695. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11430919_79"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (ICDM 1993), pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"issue":"12","key":"28_CR6","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed, C.F., Tanbeer, S.K., Jeong, B.-S., Lee, Y.-K.: Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans. Knowl. Data Eng. 21(12), 1708\u20131721 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Tseng, V.S., Wu, C.-W., Shie, B.-E., Yu, P.S.: UP-Growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2010), pp. 253\u2013262. Association for Computing Machinery, New York (2010)","DOI":"10.1145\/1835804.1835839"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-32034-2_5","volume-title":"Hybrid Artificial Intelligent Systems","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger, P., Lin, J.C.-W., Dinh, T., Le, H.B.: Mining correlated high-utility itemsets using the bond measure. In: Mart\u00ednez-\u00c1lvarez, F., Troncoso, A., Quinti\u00e1n, H., Corchado, E. (eds.) HAIS 2016. LNCS (LNAI), vol. 9648, pp. 53\u201365. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32034-2_5"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1093\/jigpal\/jzz068","volume":"28","author":"F-V Philippe","year":"2020","unstructured":"Philippe, F.-V., Lin, J.C.W., Dinh, T., Le, H.B.: Mining correlated high-utility itemsets using various measures. Logic J. IGPL 28(1), 19\u201332 (2020)","journal-title":"Logic J. IGPL"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Gan, W., Lin, J.C.W., Philippe, F.-V., Chao, H.C., Fujita, H.: Extracting non-redundant correlated purchase behaviors by utility measure. Knowl.- Based Syst. 143, 30\u201341 (2018)","DOI":"10.1016\/j.knosys.2017.12.003"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Gan, W., Lin, J.C.W., Chao, H.C., Fujita, H., Yu, P.S.: Correlated utility-based pattern mining. Inf. Sci. 504, 470\u2013486 (2019). ISSN 0020-0255","DOI":"10.1016\/j.ins.2019.07.005"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"90465","DOI":"10.1109\/ACCESS.2020.2994059","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo, B., et al.: Mining correlated high utility itemsets in one phase. IEEE Access 8, 90465\u201390477 (2020)","journal-title":"IEEE Access"},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1504\/IJKEDM.2010.032581","volume":"1","author":"S Bagui","year":"2010","unstructured":"Bagui, S., Just, J., Bagui, S.C., Hemashinha, R.: Using a cosine-type measure to derive strong association mining rules. Int. J. Knowl. Eng. Data Min. 1(1), 69\u201383 (2010)","journal-title":"Int. J. Knowl. Eng. Data Min."},{"key":"28_CR14","unstructured":"Han, J., Kamber, M., Pei, J.: Data Mining Concepts and Techniques, 3rd edn., The Morgan Kaufmann Series in Data Management Systems (2011)"},{"key":"28_CR15","unstructured":"Tianyi, W., Yuguo, C., Jiawei, H.: Association mining in large databases: a re-examination of its measures. In: Proceedings of the International Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2007) (2007)"},{"key":"28_CR16","first-page":"3389","volume":"15","author":"F-V Philippe","year":"2014","unstructured":"Philippe, F.-V., Gomariz, A., Gueniche, T., Soltani, A., Wu, C., 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":"28_CR17","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":"28_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-030-63007-2_20","volume-title":"Computational Collective Intelligence","author":"DH Phan","year":"2020","unstructured":"Phan, D.H., Do, Q.D.: Analysing effects of customer clustering for customer\u2019s account balance forecasting. In: Nguyen, N.T., Hoang, B.H., Huynh, C.P., Hwang, D., Trawi\u0144ski, B., Vossen, G. (eds.) ICCCI 2020. LNCS (LNAI), vol. 12496, pp. 255\u2013266. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63007-2_20"}],"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-42508-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:27:48Z","timestamp":1730075268000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42508-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031425073","9783031425080"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42508-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 September 2023","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2023","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"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Custom","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"175","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":"84","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":"48% - 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":"2","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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}