153 0

An Effective Approach to Outlier Detection Based on Centrality and Centre-Proximity

Title
An Effective Approach to Outlier Detection Based on Centrality and Centre-Proximity
Author
김상욱
Keywords
graph-based outlier detection; centrality; centre-proximity
Issue Date
2020-10
Publisher
INST MATHEMATICS & INFORMATICS
Citation
INFORMATICA, v. 31, no. 3, page. 435-458
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.
URI
https://informatica.vu.lt/journal/INFORMATICA/article/1177/infohttps://repository.hanyang.ac.kr/handle/20.500.11754/172011
ISSN
0868-4952; 1822-8844
DOI
10.15388/20-INFOR413
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE(컴퓨터소프트웨어학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

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

BROWSE