TY - JOUR
T1 - Ordinal outlier detection based on recursive uniform partitioning
AU - Liu, Lianqing
AU - Iwata, Hiroyasu
AU - Chen, Gang
AU - Shi, Juan
AU - Cai, Yuan li
N1 - Copyright:
Copyright 2016 Elsevier B.V., All rights reserved.
PY - 2013/10
Y1 - 2013/10
N2 - Outlier detection plays an important role in intelligent cyber systems, especially for fault-tolerant and adaptive ones. Traditional algorithms always need to evaluate distances or densities, which are very time-consuming. Considering the increasingly urgent demand for real-time application, during the past few years, various novel algorithms have been proposed. They are much faster, but less stable and less accurate. To cope with these problems, based on the core idea of ordinal optimization and the ‘few and different’ characteristics of outliers, by introducing the concept of outlier probability, we propose this ordinal outlier detection algorithm (OOD), which extracts outliers in terms of the order of being isolated in a recursive uniform data space partitioning process. It does not need any distance or density evaluation, and the complexity is reduced to O(n). Experiments show that the CPU time of OOD increases linearly with linearly growing data sets. Furthermore, compared with the recent iForest algorithm, OOD is about 30 times faster, with a 20–30% improvement in accuracy and in particular is much more stable. OOD also has good scalability, so it works well in high-dimensional data sets, which have a huge number of instances and irrelevant attributes.
AB - Outlier detection plays an important role in intelligent cyber systems, especially for fault-tolerant and adaptive ones. Traditional algorithms always need to evaluate distances or densities, which are very time-consuming. Considering the increasingly urgent demand for real-time application, during the past few years, various novel algorithms have been proposed. They are much faster, but less stable and less accurate. To cope with these problems, based on the core idea of ordinal optimization and the ‘few and different’ characteristics of outliers, by introducing the concept of outlier probability, we propose this ordinal outlier detection algorithm (OOD), which extracts outliers in terms of the order of being isolated in a recursive uniform data space partitioning process. It does not need any distance or density evaluation, and the complexity is reduced to O(n). Experiments show that the CPU time of OOD increases linearly with linearly growing data sets. Furthermore, compared with the recent iForest algorithm, OOD is about 30 times faster, with a 20–30% improvement in accuracy and in particular is much more stable. OOD also has good scalability, so it works well in high-dimensional data sets, which have a huge number of instances and irrelevant attributes.
KW - Outlier detection
KW - k-probable outlier list
KW - ordinal outlier detection
KW - uniform partitioning
UR - http://www.scopus.com/inward/record.url?scp=84884180233&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84884180233&partnerID=8YFLogxK
U2 - 10.1177/0142331211431272
DO - 10.1177/0142331211431272
M3 - Article
AN - SCOPUS:84884180233
VL - 35
SP - 940
EP - 948
JO - Transactions of the Institute of Measurement and Control
JF - Transactions of the Institute of Measurement and Control
SN - 0142-3312
IS - 7
ER -