Principal Component-based Anomaly Detection Scheme

  • Shyu M
  • Chen S
  • Sarinnapakorn K
  • et al.
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, a novel anomaly detection scheme that uses a robust principal component classifier (PCC) to handle computer network security problems is proposed. An intrusion predictive model is constructed from the major and minor principal components of the normal instances, where the difference of an anomaly from the normal instance is the distance in the principal component space. The screening of outliers prior to the principal component analysis adds the resistance property to the classifier which makes the method applicable to both the supervised and unsupervised training data. Several experiments using the KDD Cup 1999 data were conducted and the experimental results demonstrated that our proposed PCC method is superior to the k-nearest neighbor (KNN) method, density-based local outliers (LOF) approach, and the outlier detection algorithm based on the Canberra metric. © 2006 Springer-Verlag Berlin/Heidelberg.

Cite

CITATION STYLE

APA

Shyu, M.-L., Chen, S.-C., Sarinnapakorn, K., & Chang, L. (2005). Principal Component-based Anomaly Detection Scheme. In Foundations and Novel Approaches in Data Mining (pp. 311–329). Springer-Verlag. https://doi.org/10.1007/11539827_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free