{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:41:50Z","timestamp":1777696910316,"version":"3.51.4"},"reference-count":34,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2025,2,2]],"date-time":"2025-02-02T00:00:00Z","timestamp":1738454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Intelligent Decision Technologies"],"published-print":{"date-parts":[[2025,5]]},"abstract":"<jats:p>Most datasets contain objects whose attributes differ significantly as compared to those of other objects in the same dataset. Although initially disregarded as noise such objects are now defined as outliers and detecting them can be beneficial for applications such as detecting fraudulent financial transactions, or intruders. A major challenge to detect these outliers is the dimensionality and vastness of data. Rough sets can be used to clearly define the objects that need not be considered as outliers. As a result, all objects do not need to be processed while applying the outlier detection algorithm. This paper exploits a new methodology for detecting outliers using rough sets. This methodology has high potential since outliers have a low probability of being in the boundary region defined by the intersection of the lower and upper approximation, as compared to the lower approximation. This use of rough sets can be used to significantly reduce the computation time of existing algorithms.<\/jats:p>","DOI":"10.1177\/18724981251313764","type":"journal-article","created":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T01:51:27Z","timestamp":1751593887000},"page":"1580-1596","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["A novel approach to identify anomalies using rough sets"],"prefix":"10.1177","volume":"19","author":[{"given":"Gaurav","family":"Agerwala","sequence":"first","affiliation":[{"name":"SCOPE, Vellore Institute of Technology, Vellore, Tamil Nadu, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3246-5243","authenticated-orcid":false,"given":"Geetha Mary","family":"Amalanathan","sequence":"additional","affiliation":[{"name":"SCOPE, Vellore Institute of Technology, Vellore, Tamil Nadu, India"}]},{"given":"T","family":"Sangeetha","sequence":"additional","affiliation":[{"name":"Department of CSE, Saveetha School of Engineering, SIMATS, Chennai, Tamil Nadu, India"}]}],"member":"179","published-online":{"date-parts":[[2025,2,2]]},"reference":[{"key":"e_1_3_4_2_2","unstructured":"Cadez I Smyth P. Probabilistic clustering using hierarchical models."},{"key":"e_1_3_4_3_2","first-page":"226","volume-title":"KDD","author":"Ester M","year":"1996","unstructured":"Ester M, Kriegel HP, Sander J, et al. A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD. San Francisco, CA: Morgan Kaufmann Publishers Inc, 1996, pp.226\u2013231."},{"key":"e_1_3_4_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-3994-4"},{"key":"e_1_3_4_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(03)00003-5"},{"key":"e_1_3_4_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/9781118029145"},{"key":"e_1_3_4_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0371-9"},{"key":"e_1_3_4_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.849822"},{"key":"e_1_3_4_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2016.2591592"},{"key":"e_1_3_4_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2007.01.005"},{"key":"e_1_3_4_11_2","first-page":"1035","article-title":"Credit card fraud detection using anti-k nearest neighbor algorithm","volume":"4","author":"Ganji VR","year":"2012","unstructured":"Ganji VR, Mannem SN. Credit card fraud detection using anti-k nearest neighbor algorithm. Int J Comput Sci Eng 2012; 4: 1035\u20131039.","journal-title":"Int J Comput Sci Eng"},{"key":"e_1_3_4_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2008.08.006"},{"key":"e_1_3_4_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974127"},{"key":"e_1_3_4_14_2","doi-asserted-by":"publisher","DOI":"10.1021\/ct700119m"},{"key":"e_1_3_4_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.109995"},{"key":"e_1_3_4_16_2","doi-asserted-by":"publisher","DOI":"10.3390\/app13095578"},{"key":"e_1_3_4_17_2","first-page":"392","volume-title":"Algorithms for mining distance-based outliers in large datasets","author":"Knox EM","year":"1998","unstructured":"Knox EM, Ng RT. Algorithms for mining distance-based outliers in large datasets. In: Proceedings of the international conference on very large data bases, 1998, pp.392\u2013403."},{"key":"e_1_3_4_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01001956"},{"key":"e_1_3_4_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335388"},{"key":"e_1_3_4_20_2","unstructured":"Mazarbhuiya FA. Detecting anomaly using neighborhood rough set based classification approach https:\/\/ssrn.com\/abstract=4124453."},{"key":"e_1_3_4_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.234"},{"key":"e_1_3_4_22_2","first-page":"1037","volume-title":"HiCS: high contrast subspaces for density-based outlier ranking","author":"Keller F","year":"2012","unstructured":"Keller F, Muller E, Bohm K. HiCS: high contrast subspaces for density-based outlier ranking. In: 2012 IEEE 28th international conference on data engineering, 2012, pp.1037\u20131048. IEEE."},{"key":"e_1_3_4_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/11548706_9"},{"key":"e_1_3_4_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.06.019"},{"key":"e_1_3_4_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04421-4"},{"key":"e_1_3_4_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.02.087"},{"key":"e_1_3_4_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/CoDIT58514.2023.10284184"},{"key":"e_1_3_4_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2015.05.002"},{"key":"e_1_3_4_29_2","unstructured":"Mazarbhuiya FA. Detecting anomaly using neighborhood rough set based classification approach https:\/\/ssrn.com\/abstract=4124453 (2022 May 31)."},{"key":"e_1_3_4_30_2","doi-asserted-by":"publisher","DOI":"10.1080\/03081070701251182"},{"key":"e_1_3_4_31_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2009-0363"},{"key":"e_1_3_4_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0591-4"},{"key":"e_1_3_4_33_2","volume-title":"Data mining concepts and techniques","author":"Han J","year":"2012","unstructured":"Han J, Kamber M, Pei J. Data mining concepts and techniques. 3rd ed. Amsterdam: Elsevier Science, 2012.","edition":"3"},{"key":"e_1_3_4_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"e_1_3_4_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/CoDIT58514.2023.10284184"}],"container-title":["Intelligent Decision Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18724981251313764","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/18724981251313764","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18724981251313764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:21:18Z","timestamp":1777454478000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/18724981251313764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,2]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["10.1177\/18724981251313764"],"URL":"https:\/\/doi.org\/10.1177\/18724981251313764","relation":{},"ISSN":["1872-4981","1875-8843"],"issn-type":[{"value":"1872-4981","type":"print"},{"value":"1875-8843","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,2]]}}}