{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:33:08Z","timestamp":1777509188113,"version":"3.51.4"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61976240, 52077056, and 91746209"],"award-info":[{"award-number":["61976240, 52077056, and 91746209"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Research and Development Program of China","award":["2016YFB1000901"],"award-info":[{"award-number":["2016YFB1000901"]}]},{"name":"Natural Science Foundation of Hebei Province, China","award":["F2020202013, E2020202033"],"award-info":[{"award-number":["F2020202013, E2020202033"]}]},{"name":"Graduate Student Innovation Program of Hebei Province","award":["CXZZSS2021026"],"award-info":[{"award-number":["CXZZSS2021026"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"<jats:p>As a novel deep learning model, gcForest has been widely used in various applications. However, current multi-grained scanning of gcForest produces many redundant feature vectors, and this increases the time cost of the model. To screen out redundant feature vectors, we introduce a hashing screening mechanism for multi-grained scanning and propose a model called HW-Forest which adopts two strategies: hashing screening and window screening. HW-Forest employs perceptual hashing algorithm to calculate the similarity between feature vectors in hashing screening strategy, which is used to remove the redundant feature vectors produced by multi-grained scanning and can significantly decrease the time cost and memory consumption. Furthermore, we adopt a self-adaptive instance screening strategy called window screening to improve the performance of our approach, which can achieve higher accuracy without hyperparameter tuning on different datasets. Our experimental results show that HW-Forest has higher accuracy than other models, and the time cost is also reduced.<\/jats:p>","DOI":"10.1145\/3532193","type":"journal-article","created":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T11:19:26Z","timestamp":1651663166000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["HW-Forest: Deep Forest with Hashing Screening and Window Screening"],"prefix":"10.1145","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9159-7409","authenticated-orcid":false,"given":"Pengfei","family":"Ma","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, Hebei University of Technology, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5314-3468","authenticated-orcid":false,"given":"Youxi","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Hebei University of Technology, Tianjin, China and Hebei Key Laboratory of Big Data Computing, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1126-9772","authenticated-orcid":false,"given":"Yan","family":"Li","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Hebei University of Technology, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3427-8222","authenticated-orcid":false,"given":"Lei","family":"Guo","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Reliability and Intelligence of Electrical Equipment, Hebei University of Technology, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8674-4948","authenticated-orcid":false,"given":"He","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Software, Dalian University of Technology, Dalian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4129-9611","authenticated-orcid":false,"given":"Xingquan","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Computer &amp; Electrical Engineering and Computer Science, Florida Atlantic University, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-1704","authenticated-orcid":false,"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China), Hefei University of Technology, Hefei, China and Mininglamp Academy of Sciences, Mininglamp Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.07.091"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3480245"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.08.003"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178115"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2992485"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.04.043"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-017-1746-7"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1093\/nsr\/nwy108"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ymeth.2019.02.009"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2018.2793960"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3038799"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.12.075"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2020.3019505"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-018-2095-4"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.3390\/app9173589"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.enbuild.2021.111043"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2020.2995767"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.3389\/fnbot.2020.617531"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.saa.2019.117973"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101801"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.06.005"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107499"},{"key":"e_1_3_1_25_2","first-page":"5530","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems","volume":"32","author":"Lyu Shenhuan","year":"2019","unstructured":"Shenhuan Lyu, Liang Yang, and Zhihua Zhou. 2019 A refined margin distribution analysis for forest representation learning. In Proceedings of the 33rd International Conference on Neural Information Processing Systems, Vol. 32. 5530\u20135540."},{"key":"e_1_3_1_26_2","first-page":"342","volume-title":"Proceedings of the 38th International Conference on Machine Learning","volume":"139","author":"Arnould Ludovic","year":"2021","unstructured":"Ludovic Arnould, Claire Boyer, and Erwan Scornet. 2021. Analyzing the tree-layer structure of Deep Forests. In Proceedings of the 38th International Conference on Machine Learning, Vol. 139. 342\u2013350."},{"key":"e_1_3_1_27_2","first-page":"1036","volume-title":"Proceedings of the 21th IEEE International Conference on Data Mining","author":"Cheng Yihe","year":"2021","unstructured":"Yihe Cheng, Shenhuan Lyu, and Yuan Jiang. 2021. Improving deep forest by exploiting high-order interactions. In Proceedings of the 21th IEEE International Conference on Data Mining. 1036\u20131041."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219622020500236"},{"key":"e_1_3_1_29_2","first-page":"1634","volume-title":"Proceedings of the European Conference on Artificial Intelligence","volume":"325","author":"Yang Liang","year":"2020","unstructured":"Liang Yang, Xizhu Wu, Yuan Jiang, and Zhihua Zhou. 2020. Multi-label learning with deep forest. In Proceedings of the European Conference on Artificial Intelligence, Vol. 325. 1634\u20131641."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/1145\/3442204"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3095399"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2020.2977459"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.07.019"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/1145\/3427585"},{"issue":"5","key":"e_1_3_1_36_2","first-page":"1083","article-title":"Fast cross-validation for kernel-based algorithms","volume":"42","author":"Liu Yong","year":"2020","unstructured":"Yong Liu, Shizhong Liao, Shali Jiang, Lizhong Ding, Hailun Lin, and Weiping Wang. 2020. Fast cross-validation for kernel-based algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence 42, 5 (2020), 1083\u20131096.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/1145\/3449360"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3082114"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107361"},{"key":"e_1_3_1_40_2","unstructured":"H. M. Dipu Kabir Moloud Abdar Seyed Mohammad Jafar Jalali Abbas Khosravi Amir F. Atiya Saeid Nahavandi and Dipti Srinivasan. 2020. SpinalNet: Deep neural network with gradual input. arXiv:2007.03347. Retrieved from https:\/\/arxiv.org\/abs\/2007.03347."},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532193","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3532193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:42Z","timestamp":1750183782000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,30]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12,31]]}},"alternative-id":["10.1145\/3532193"],"URL":"https:\/\/doi.org\/10.1145\/3532193","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,30]]},"assertion":[{"value":"2021-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}