乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:45:20Z","timestamp":1742391920920,"version":"3.37.3"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2017M3C4A7069440"],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2883537","type":"journal-article","created":{"date-parts":[[2018,11,27]],"date-time":"2018-11-27T19:50:15Z","timestamp":1543348215000},"page":"76036-76048","source":"Crossref","is-referenced-by-count":18,"title":["Feature Selection for High Dimensional Data Using Monte Carlo Tree Search"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7287-2372","authenticated-orcid":false,"given":"Muhammad Umar","family":"Chaudhry","sequence":"first","affiliation":[]},{"given":"Jee-Hyong","family":"Lee","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.10.002"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.07.026"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.06.005"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.05.029"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.02.020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.09.027"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2010.12.016"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00043-X"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2009.2028585"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2005.09.024"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.02.013"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.12.010"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.11.006"},{"key":"ref28","article-title":"Correlation-based feature selection for machine learning","author":"hall","year":"1999","journal-title":"Methods"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.01.026"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.09.002"},{"key":"ref1","first-page":"1205","article-title":"Efficient feature selection via analysis of relevance and redundancy","volume":"5","author":"yu","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.09.023"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2015.03.020"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.073"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2012.2227469"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.07.007"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-160840"},{"journal-title":"Machine Learning Repository","year":"2017","key":"ref50"},{"journal-title":"Retrieved from LIBSVM—A Library for Support Vector Machines","year":"2001","author":"chang","key":"ref51"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.01.044"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.12.045"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2011.2181852"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/34.990133"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-3"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001411008804"},{"journal-title":"Gems-system","year":"2018","key":"ref53"},{"journal-title":"Random Forest for Gene Selection and Microarray Data Classification","year":"2018","key":"ref52"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183893"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347169"},{"key":"ref40","first-page":"359","article-title":"Feature selection as a one-player game","author":"gaudel","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref12","first-page":"1157","article-title":"An introduction to variable and feature selection","volume":"3","author":"guyon","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2010.08.020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.07.009"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.05.037"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2012.09.049"},{"key":"ref17","first-page":"27","article-title":"Single feature ranking and binary particle swarm optimisation based feature subset ranking for feature selection","volume":"122","author":"xue","year":"2012","journal-title":"Proc 35th Australas Comput Sci Conf"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.09.018"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SIBGRAPI.2012.47"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2552478"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.06.009"},{"key":"ref6","first-page":"1","article-title":"Theoretical and empirical analysis of ReliefF and RReliefF","volume":"53 nos","author":"robnik-\u0161ikonja","year":"2003","journal-title":"Mach Learn"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2576598"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2724555"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2647238"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.03.049"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2013.10.009"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/BF00153759"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176325633"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.2298\/YJOR1101119N"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-247-2.50037-1"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.02.001"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2013.06.031"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.10.044"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.3390\/e20050385"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08548538.pdf?arnumber=8548538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:08:48Z","timestamp":1642003728000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8548538\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2883537","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}