{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T10:09:00Z","timestamp":1771236540306,"version":"3.50.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572343"],"award-info":[{"award-number":["61572343"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004480","name":"Natural Science Foundation of Shanxi Province of China","doi-asserted-by":"publisher","award":["201901D111257"],"award-info":[{"award-number":["201901D111257"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004480","name":"Natural Science Foundation of Shanxi Province of China","doi-asserted-by":"publisher","award":["201901D211303"],"award-info":[{"award-number":["201901D211303"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Taiyuan University of Science and Technology Scientific Research Initial Funding","award":["20192013"],"award-info":[{"award-number":["20192013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3085605","type":"journal-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T22:09:50Z","timestamp":1622758190000},"page":"81765-81777","source":"Crossref","is-referenced-by-count":13,"title":["<i>POD<\/i>: A Parallel Outlier Detection Algorithm Using Weighted kNN"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0721-6544","authenticated-orcid":false,"given":"Yang","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4246-4383","authenticated-orcid":false,"given":"Xujun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"37","article-title":"Evaluation: From precision, recall and F-measure to ROC, informedness, markedness and correlation","volume":"2","author":"powers","year":"2011","journal-title":"J Mach Learn Technol"},{"key":"ref32","first-page":"1086","article-title":"Parallel extraction and analysis of abnormal features of QSO spectra based on sparse subspace","volume":"41","author":"ma","year":"2021","journal-title":"Spectrosc Spectral Anal"},{"key":"ref31","first-page":"55","article-title":"A outlier mining algorithm based on p weights","volume":"35","author":"lou","year":"2014","journal-title":"J Chin Comput Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502554"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.stamet.2008.12.005"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISCID.2017.202"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2921320"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2016.150642"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2496252"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref14","first-page":"174","article-title":"The ANN-tree: An index for efficient approximate nearest neighbor search","author":"lin","year":"2001","journal-title":"Proc 7th Int Conf Database Syst Adv Appl (DASFAA)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2017.09.036"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3319532"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.01.016"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-1921-1_47"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.02.020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.02.013"},{"key":"ref4","first-page":"174","article-title":"K nearest neighbor query based on Voronoi diagram for obstructed spaces","volume":"43","author":"zhang","year":"2016","journal-title":"Comput Sci"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.07.045"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.aci.2014.10.001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2972299"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2991\/iske.2007.33"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2992903"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.09.012"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223794"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112846"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2520473"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2718592"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.31"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335437"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2905606"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.11.026"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-019-02932-2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.01.002"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09446117.pdf?arnumber=9446117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T19:51:59Z","timestamp":1643831519000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9446117\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3085605","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}