{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:34:15Z","timestamp":1781102055650,"version":"3.54.1"},"reference-count":17,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"abstract":"<jats:p>Outliers in the database are the objects that deviate from the rest of the dataset by some measure. The Nearest Neighbor Outlier Factor is considering to measure the degree of outlier-ness of the object in the dataset. Unlike the other methods like Local Outlier Factor, this approach shows the interest of a point from both neighbors and reverse neighbors, and after that, an object comes into consideration. We have observed that in GBBK algorithm that based on K-NN, used quick sort to find k nearest neighbors that take O (N log N) time. However, in proposed method, the time required for searching on K times which complete in O (KN) time to find k nearest neighbors (k &amp;lt; &amp;lt; log N). As a result, the proposed method improves the time complexity. The NSL-KDD and Fisher iris dataset is used, and experimental results compared with the GBBK method. The result is same in both the methods, but the proposed method takes less time for computation.<\/jats:p>","DOI":"10.4018\/ijkdb.2017010105","type":"journal-article","created":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T11:13:46Z","timestamp":1488971626000},"page":"58-70","source":"Crossref","is-referenced-by-count":4,"title":["K-NN Based Outlier Detection Technique on Intrusion Dataset"],"prefix":"10.4018","volume":"7","author":[{"given":"Santosh Kumar","family":"Sahu","sequence":"first","affiliation":[{"name":"National Institute of Technology, Department of Computer Science and Engineering, Rourkela, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjay Kumar","family":"Jena","sequence":"additional","affiliation":[{"name":"National Institute of Technology, Department of Computer Science and Engineering, Rourkela, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manish","family":"Verma","sequence":"additional","affiliation":[{"name":"National Institute of Technology, Department of Computer Science and Engineering, Rourkela, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJKDB.2017010105-0","doi-asserted-by":"crossref","unstructured":"Aggarwal, C., & Yu, S. (2005). An effective and efficient algorithm for high-dimensional outlier detection. The VLDB Journal, 14(2), 211-221.","DOI":"10.1007\/s00778-004-0125-5"},{"key":"IJKDB.2017010105-1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIS.2006.252287"},{"key":"IJKDB.2017010105-2","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335388"},{"key":"IJKDB.2017010105-3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20757-0_4"},{"key":"IJKDB.2017010105-4","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxt044"},{"key":"IJKDB.2017010105-5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21786-9_8"},{"key":"IJKDB.2017010105-6","doi-asserted-by":"publisher","DOI":"10.1007\/11731139_68"},{"key":"IJKDB.2017010105-7","first-page":"392","article-title":"Algorithms for mining distance-based outliers in large datasets.","author":"E. M.Knox","year":"1998","journal-title":"Proceedings of the International Conference on Very Large Data Bases"},{"key":"IJKDB.2017010105-8","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-016-2069-7"},{"key":"IJKDB.2017010105-9","doi-asserted-by":"publisher","DOI":"10.1007\/s10796-016-9683-5"},{"issue":"2","key":"IJKDB.2017010105-10","first-page":"13","article-title":"An uncertainty-based task scheduling for heterogeneous multi-cloud systems.","volume":"9","author":"S.Panda","year":"2015","journal-title":"International Journal of Information Processing"},{"key":"IJKDB.2017010105-11","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335437"},{"issue":"3","key":"IJKDB.2017010105-12","first-page":"207","article-title":"A study of K-Means and C-Means clustering algorithms for intrusion detection product development. International Journal of Innovation","volume":"5","author":"S. K.Sahu","year":"2014","journal-title":"Management and Technology"},{"key":"IJKDB.2017010105-13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28034-9_23"},{"key":"IJKDB.2017010105-14","doi-asserted-by":"publisher","DOI":"10.1109\/IAdCC.2014.6779523"},{"key":"IJKDB.2017010105-15","doi-asserted-by":"publisher","DOI":"10.1109\/CISDA.2009.5356528"},{"key":"IJKDB.2017010105-16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1184035"}],"container-title":["International Journal of Knowledge Discovery in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=178607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T10:09:56Z","timestamp":1651831796000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJKDB.2017010105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":17,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.4018\/ijkdb.2017010105","relation":{},"ISSN":["1947-9115","1947-9123"],"issn-type":[{"value":"1947-9115","type":"print"},{"value":"1947-9123","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}