{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T07:40:02Z","timestamp":1755848402326,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,12,23]]},"DOI":"10.1145\/3579654.3579766","type":"proceedings-article","created":{"date-parts":[[2023,3,14]],"date-time":"2023-03-14T16:09:40Z","timestamp":1678810180000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["IHUMN: an improved high-utility itemsets mining algorithm with negative utility items"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8174-608X","authenticated-orcid":false,"given":"Huijiao","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Information Security, Guilin University of Electronic Technology, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6861-3119","authenticated-orcid":false,"given":"Jinghai","family":"Wei","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Security, Guilin University of Electronic Technology, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2894-8031","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Security, Guilin University of Electronic Technology, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6446-6721","authenticated-orcid":false,"given":"Xing","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Security, Guilin University of Electronic Technology, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1101-622X","authenticated-orcid":false,"given":"Hua","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Security, Guilin University of Electronic Technology, China"}]}],"member":"320","published-online":{"date-parts":[[2023,3,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04921-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Ghafari SM Tjortjis C. A survey on association rules mining using heuristics. WIREs Data Mining Knowl Discov. 2019;9(4): e1307. https:\/\/doi.org\/10.1002\/widm.1307.","DOI":"10.1002\/widm.1307"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1108\/DTA-03-2019-0037"},{"key":"e_1_3_2_1_4_1","first-page":"641","volume":"202","author":"Valiullin T","unstructured":"Valiullin T, Huang ZX, Wei CH, Yin JF, Wu DM, Egorova I. A new approximate method for mining frequent itemsets from big data. Comput Sci Inf Syst. 2021;18(3):641\u2013656.","journal-title":"Comput Sci Inf Syst."},{"volume-title":"Srikant R. Fast Algorithms for Mining Association Rules in Large Databases. Proceedings of the 20th International Conference on Very Large Data Bases; 1994 Sep; Santiago de Chile.","author":"Agrawal R","key":"e_1_3_2_1_5_1","unstructured":"Agrawal R, Srikant R. Fast Algorithms for Mining Association Rules in Large Databases. Proceedings of the 20th International Conference on Very Large Data Bases; 1994 Sep; Santiago de Chile."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_79"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.11.001"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0986-0"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.12.029"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.01.060"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Sethi KK Ramesh D. High average-utility itemset mining with multiple minimum utility threshold: A generalized approach. Eng Appl Artif Intell. 2020;96:103933. https:\/\/doi.org\/10.1016\/j.engappai.2020.103933.","DOI":"10.1016\/j.engappai.2020.103933"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02611-z"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63007-2_24"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.08.028"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.05.066"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.10.049"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.08.022"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.12.035"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-201357"},{"key":"e_1_3_2_1_23_1","volume-title":"Tseng VS","author":"Fournier-Viger P","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu C-W, Tseng VS. SPMF: A Java Open-Source Data Mining Library. 2014. Retrieved May 6, 2020 from https:\/\/www.philippe-fournier-viger.com\/spmf."}],"event":{"name":"ACAI 2022: 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","acronym":"ACAI 2022","location":"Sanya China"},"container-title":["Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579654.3579766","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3579654.3579766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:59:36Z","timestamp":1755845976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579654.3579766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,23]]},"references-count":23,"alternative-id":["10.1145\/3579654.3579766","10.1145\/3579654"],"URL":"https:\/\/doi.org\/10.1145\/3579654.3579766","relation":{},"subject":[],"published":{"date-parts":[[2022,12,23]]},"assertion":[{"value":"2023-03-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}