.png){kind=icon}
Return
Speedup Two-Class Supervised Outlier Detection
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2877701.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Outlier detection is an important topic in the community of data mining and machine learning. In two-class supervised outlier detection, it needs to solve a large quadratic programming whose size is twice the number of samples in the training set. Thus, training two-class supervised outlier detection model is time consuming. In this paper, we show that the result of the two-class supervised outlier detection is determined by minor critical samples which are with nonzero Lagrange multipliers and the critical samples must be located near the boundary of each class. It is much faster to train the two-class supervised outlier detection on the subset which consists of critical samples. We compare three methods which could find boundary samples. The experimental results show that the nearest neighbors distribution is more suitable for finding critical samples for the two-class supervised outlier detection. The two-class supervised novelty detection could become much faster and the performance does not degrade when only critical samples are retained by nearest neighbors' distribution information.
Keywords:
Supervised outlier detection
critical sample
nearest neighbors' distribution
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
View more organizations
Cited Papers
Boundary detection and sample reduction for one-class Support Vector Machines.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveShareSaveA K-Farthest-Neighbor-based approach for support vector data descriptionAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSaveShareSaveShareSaveShareSave View more