{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:04:04Z","timestamp":1763809444000,"version":"3.37.3"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000163","name":"ARC","doi-asserted-by":"publisher","award":["DE130101002","DP130103405"],"award-info":[{"award-number":["DE130101002","DP130103405"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2016,1,1]]},"DOI":"10.1109\/tkde.2015.2460735","type":"journal-article","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T14:44:34Z","timestamp":1437749074000},"page":"68-81","source":"Crossref","is-referenced-by-count":41,"title":["<inline-formula><tex-math>$k$<\/tex-math><alternatives> <inline-graphic xlink:type=\"simple\" xlink:href=\"alharthi-ieq1-2460735.gif\"\/><\/alternatives><\/inline-formula>NNVWC: An Efficient <inline-formula><tex-math>$k$<\/tex-math><alternatives><inline-graphic xlink:type=\"simple\" xlink:href=\"alharthi-ieq2-2460735.gif\"\/> <\/alternatives><\/inline-formula>-Nearest Neighbors Approach Based on Various-Widths Clustering"],"prefix":"10.1109","volume":"28","author":[{"given":"Abdul Mohsen","family":"Almalawi","sequence":"first","affiliation":[]},{"given":"Adil","family":"Fahad","sequence":"additional","affiliation":[]},{"given":"Zahir","family":"Tari","sequence":"additional","affiliation":[]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[]},{"given":"Ibrahim","family":"Khalil","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"ref38","first-page":"220","article-title":"An analysis of the 1999 darpa\/lincoln laboratory evaluation data for network anomaly detection","author":"mahoney","year":"0","journal-title":"Proc 6th Int Symp Recent Adv Intrusion Detection"},{"journal-title":"Proc of the 21th International Conference on Very Large Data Bases","year":"0","author":"brin","key":"ref33"},{"key":"ref32","first-page":"364","article-title":"What is a good nearest neighbors algorithm for finding similar patches in images?","author":"kumar","year":"0","journal-title":"Proc 10th Eur Conf Comput Vis"},{"journal-title":"Five balltree construction algorithms","year":"1989","author":"omohundro","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24775-3_33"},{"key":"ref36","first-page":"5","article-title":"Intrusion detection with unlabeled data using clustering","author":"portnoy","year":"0","journal-title":"Proc ACM CSS Workshop on Data Mining Applied to Security"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253345"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/PL00010672"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.04.055"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320255"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"ref13","first-page":"950","article-title":"Multi-probe lsh: efficient indexing for high-dimensional similarity search","author":"lv","year":"0","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224297"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/34.615448"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759061"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224110"},{"article-title":"Unsupervised anomaly detection using an optimized k-nearest neighbors algorithm","year":"2000","author":"prerau","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0093-2"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-1-4615-0953-0_4","article-title":"A geometric framework for unsupervised anomaly detection","author":"eskin","year":"2002","journal-title":"Applications of Data Mining in Computer Security"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.29"},{"key":"ref6","first-page":"1","article-title":"k-nearest neighbour classifiers","author":"cunningham","year":"2007","journal-title":"Multiple Classifier Systems"},{"key":"ref29","first-page":"1293","article-title":"A fast exact k-nearest neighbors algorithm for high dimensional search using k-means clustering and triangle inequality","author":"xueyi","year":"0","journal-title":"Proc Int Joint Conf Neural Netw"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956758"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2008.2007253"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2014.07.005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1497577.1497581"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.rse.2008.04.018"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/TNN.2008.917504","article-title":"Nearest-neighbor methods in learning and vision","volume":"19","author":"shakhnarovich","year":"2008","journal-title":"IEEE Trans Neural Netw"},{"key":"ref46","first-page":"269","article-title":"Labelled data collection for anomaly detection in wireless sensor networks","author":"suthaharan","year":"0","journal-title":"Proc Int Conf Intell Sens Sensor Netw Inf Process"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1986.4767859"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2013.10.012"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"ref22","first-page":"426","article-title":"M-tree: An efficient access method for similarity search in metric spaces","author":"patella","year":"0","journal-title":"Proc 23rd Int Conf Very Large Data Bases"},{"key":"ref47","first-page":"1135","article-title":"New algorithms for efficient high-dimensional nonparametric classification","volume":"7","author":"liu","year":"2006","journal-title":"J Mach Learning Res"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"year":"0","author":"frank","key":"ref42"},{"key":"ref24","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","author":"yianilos","year":"0","journal-title":"Proc 4th Annu ACM-SIAM Sym Discr Algorithms"},{"key":"ref41","first-page":"1137","article-title":"A study of cross-validation and bootstrap for accuracy estimation and model selection","volume":"14","author":"kohavi","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253345"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.snb.2012.01.074"},{"journal-title":"Slim-Trees High performance metric trees minimizing overlap between nodes","year":"2000","author":"traina","key":"ref26"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2013.6761301"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7347496\/7166319.pdf?arnumber=7166319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:04Z","timestamp":1641987964000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7166319\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,1]]},"references-count":48,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2015.2460735","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2016,1,1]]}}}