Name
Abstract | ||
|---|---|---|
In data mining research, outliers usually represent extreme values that deviate from other observations on data. The significant issue of existing outlier detection methods is that they only consider the object itself not taking its neighbouring objects into account to extract location features. In this paper, we propose an innovative approach to this issue. First, we propose the notions of centrality and centre-proximity for determining the degree of outlierness considering the distribution of all objects. We also propose a novel graph-based algorithm for outlier detection based on the notions. The algorithm solves the problems of existing methods, i.e. the problems of local density, micro-cluster, and fringe objects. We performed extensive experiments in order to confirm the effectiveness and efficiency of our proposed method. The obtained experimental results showed that the proposed method uncovers outliers successfully, and outperforms previous outlier detection methods. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.15388/20-INFOR413 | INFORMATICA |
Keywords | DocType | Volume |
graph-based outlier detection, centrality, centre-proximity | Journal | 31 |
Issue | ISSN | Citations |
3 | 0868-4952 | 0 |
PageRank | References | Authors |
0.34 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Duck-Ho Bae | 1 | 79 | 9.31 |
| Seo Jeong | 2 | 3 | 0.79 |
| Jiwon Hong | 3 | 5 | 3.48 |
| Minsoo Lee | 4 | 315 | 31.33 |
| Mirjana Ivanovic | 5 | 540 | 83.40 |
| Miloš Savić | 6 | 27 | 5.83 |
| Sang-Wook Kim | 7 | 792 | 152.77 |