Please use this identifier to cite or link to this item: https://doi.org/10.1007/11731139_68
DC FieldValue
dc.titleRanking outliers using symmetric neighborhood relationship
dc.contributor.authorJin, W.
dc.contributor.authorTung, A.K.H.
dc.contributor.authorHan, J.
dc.contributor.authorWang, W.
dc.date.accessioned2013-07-04T08:09:47Z
dc.date.available2013-07-04T08:09:47Z
dc.date.issued2006
dc.identifier.citationJin, W.,Tung, A.K.H.,Han, J.,Wang, W. (2006). Ranking outliers using symmetric neighborhood relationship. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3918 LNAI : 577-593. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/11731139_68" target="_blank">https://doi.org/10.1007/11731139_68</a>
dc.identifier.isbn3540332065
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40675
dc.description.abstractMining outliers in database is to find exceptional objects that deviate from the rest of the data set. Besides classical outlier analysis algorithms, recent studies have focused on mining local outliers, i.e., the outliers that have density distribution significantly different from their neighborhood. The estimation of density distribution at the location of an object has so far been based on the density distribution of its k-nearest neighbors [2, 11]. However, when outliers are in the location where the density distributions in the neighborhood are significantly different, for example, in the case of objects from a sparse cluster close to a denser cluster, this may result in wrong estimation. To avoid this problem, here we propose a simple but effective measure on local outliers based on a symmetric neighborhood relationship. The proposed measure considers both neighbors and reverse neighbors of an object when estimating its density distribution. As a. result, outliers so discovered are more meaningful. To compute such local outliers efficiently, several mining algorithms are developed that detects top-n outliers based on our definition. A comprehensive performance evaluation and analysis shows that our methods are not only efficient in the computation but also more effective in ranking outliers. © Springer-Verlag Berlin Heidelberg 2006.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/11731139_68
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1007/11731139_68
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume3918 LNAI
dc.description.page577-593
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

164
checked on May 22, 2019

Page view(s)

135
checked on May 22, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.