{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T06:51:30Z","timestamp":1767423090507,"version":"3.37.3"},"reference-count":44,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T00:00:00Z","timestamp":1585612800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20171458","61672290","61802002","19KJB520028"],"award-info":[{"award-number":["BK20171458","61672290","61802002","19KJB520028"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["BK20171458","61672290","61802002","19KJB520028"],"award-info":[{"award-number":["BK20171458","61672290","61802002","19KJB520028"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["BK20171458","61672290","61802002","19KJB520028"],"award-info":[{"award-number":["BK20171458","61672290","61802002","19KJB520028"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010023","name":"Natural Science Research of Jiangsu Higher Education Institutions of China","doi-asserted-by":"publisher","award":["BK20171458","61672290","61802002","19KJB520028"],"award-info":[{"award-number":["BK20171458","61672290","61802002","19KJB520028"]}],"id":[{"id":"10.13039\/501100010023","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012246","name":"Priority Academic Program Development of Jiangsu Higher Education Institutions","doi-asserted-by":"publisher","award":["BK20171458","61672290","61802002","19KJB520028"],"award-info":[{"award-number":["BK20171458","61672290","61802002","19KJB520028"]}],"id":[{"id":"10.13039\/501100012246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,3,31]]},"abstract":"<jats:p>The complex systems with edge computing require a huge amount of multifeature data to extract appropriate insights for their decision making, so it is important to find a feasible feature selection method to improve the computational efficiency and save the resource consumption. In this paper, a quantum-based feature selection algorithm for the multiclassification problem, namely, QReliefF, is proposed, which can effectively reduce the complexity of algorithm and improve its computational efficiency. First, all features of each sample are encoded into a quantum state by performing operations CMP and <jats:italic>R<\/jats:italic><jats:sub><jats:italic>y<\/jats:italic><\/jats:sub>, and then the amplitude estimation is applied to calculate the similarity between any two quantum states (i.e., two samples). According to the similarities, the Grover\u2013Long method is utilized to find the nearest <jats:italic>k<\/jats:italic> neighbor samples, and then the weight vector is updated. After a certain number of iterations through the above process, the desired features can be selected with regards to the final weight vector and the threshold <jats:italic>\u03c4<\/jats:italic>. Compared with the classical ReliefF algorithm, our algorithm reduces the complexity of similarity calculation from <jats:italic>O<\/jats:italic>(MN) to <jats:italic>O<\/jats:italic>(<jats:italic>M<\/jats:italic>), the complexity of finding the nearest neighbor from <jats:italic>O<\/jats:italic>(<jats:italic>M<\/jats:italic>) to <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mrow><mml:mi>O<\/mml:mi><mml:mfenced open=\"(\" close=\")\" separators=\"|\"><mml:mrow><mml:msqrt><mml:mi>M<\/mml:mi><\/mml:msqrt><\/mml:mrow><\/mml:mfenced><\/mml:mrow><\/mml:math>, and resource consumption from <jats:italic>O<\/jats:italic>(MN) to <jats:italic>O<\/jats:italic>(MlogN). Meanwhile, compared with the quantum Relief algorithm, our algorithm is superior in finding the nearest neighbor, reducing the complexity from <jats:italic>O<\/jats:italic>(<jats:italic>M<\/jats:italic>) to <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><mml:mrow><mml:mi>O<\/mml:mi><mml:mfenced open=\"(\" close=\")\" separators=\"|\"><mml:mrow><mml:msqrt><mml:mi>M<\/mml:mi><\/mml:msqrt><\/mml:mrow><\/mml:mfenced><\/mml:mrow><\/mml:math>. Finally, in order to verify the feasibility of our algorithm, a simulation experiment based on Rigetti with a simple example is performed.<\/jats:p>","DOI":"10.1155\/2020\/8216874","type":"journal-article","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T23:54:19Z","timestamp":1585698859000},"page":"1-12","source":"Crossref","is-referenced-by-count":6,"title":["Quantum-Based Feature Selection for Multiclassification Problem in Complex Systems with Edge Computing"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9317-2869","authenticated-orcid":true,"given":"Wenjie","family":"Liu","sequence":"first","affiliation":[{"name":"Engineering Research Center of Digital Forensics, Ministry of Education, School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing 210044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junxiu","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing 210044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxiang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing 210044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peipei","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing 210044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhibin","family":"Lei","sequence":"additional","affiliation":[{"name":"Hong Kong Applied Science and Technology Research Institute (ASTRI), Hong Kong 999077, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9708-5888","authenticated-orcid":true,"given":"Xu","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Software, Qufu Normal University, Shandong 273165, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"year":"2013","key":"1"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721672"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2015.2487344"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2018.09.006"},{"year":"2019","key":"5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/comst.2017.2745201"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2019.02.008"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.02.050"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2936869"},{"year":"2012","key":"10"},{"year":"2019","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.02.048"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.11.030"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.12.055"},{"issue":"5","key":"15","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1287\/mnsc.12.5.317","volume":"12","year":"1966","journal-title":"Management Science"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"year":"2012","key":"17"},{"volume-title":"Estimating attributes: analysis and extensions of Relief","year":"2005","key":"19"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2164-9-s2-s27"},{"key":"21","first-page":"2352","volume":"1","year":"2012","journal-title":"IEEE Conference on Computer Vision and Pattern Recognition"},{"first-page":"315","volume-title":"Epistasis analysis using ReliefF","year":"2015","key":"22"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/bf01011339"},{"issue":"6-7","key":"24","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","year":"1982","journal-title":"International Journal of Theoretical Physics"},{"issue":"2","key":"25","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","year":"1999","journal-title":"SIAM Review"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.79.325"},{"issue":"1","key":"27","first-page":"47","volume":"56","year":"2018","journal-title":"CMC-Computers, Materials & Continuation"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2896316"},{"key":"29","first-page":"14","volume":"2019","year":"2019","journal-title":"Security and Communication Networks"},{"key":"30","first-page":"7","volume":"2","year":"2019","journal-title":"Advanced Quantum Technologies"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2909906"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2894295"},{"issue":"10","key":"33","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/s11128-018-2048-x","volume":"17","year":"2018","journal-title":"Quantum Information Processing"},{"year":"2000","key":"34","first-page":"221"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.64.022307"},{"issue":"3","key":"36","volume":"16","year":"2017","journal-title":"Quantum Information Processing"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-017-1759-8"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2944007"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.03.008"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1109\/access.2018.2820162"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.01.012"},{"issue":"2","key":"45","first-page":"211","volume":"56","year":"2018","journal-title":"Cmc-Computers Materials & Continua"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2960592"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2019.03551"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2931073"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8216874.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8216874.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8216874.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T23:54:27Z","timestamp":1585698867000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/8216874\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,31]]},"references-count":44,"alternative-id":["8216874","8216874"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8216874","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2020,3,31]]}}}