论文信息 - Density Level Detection is Classification

Density Level Detection is Classification

We show that anomaly detection can be interpreted as a binary classification problem. Using this interpretation we propose a support vector machine (SVM) for anomaly detection. We then present some theoretical results which include consistency and learning rates. Finally, we experimentally compare our SVM with the standard one-class SVM.

[1] A. Tsybakov,et al. Optimal aggregation of classifiers in statistical learning , 2003 .

[2] Don R. Hush,et al. A Classification Framework for Anomaly Detection , 2005, J. Mach. Learn. Res..

[3] Shai Ben-David,et al. Learning Distributions by Their Density Levels: A Paradigm for Learning without a Teacher , 1997, J. Comput. Syst. Sci..

[4] W. Polonik. Measuring Mass Concentrations and Estimating Density Contour Clusters-An Excess Mass Approach , 1995 .

[5] John A. Hartigan,et al. Clustering Algorithms , 1975 .

[6] J. Hartigan. Estimation of a Convex Density Contour in Two Dimensions , 1987 .

[7] A. Tsybakov. On nonparametric estimation of density level sets , 1997 .

[8] Bernhard Schölkopf,et al. Estimating the Support of a High-Dimensional Distribution , 2001, Neural Computation.

[9] E. Mammen,et al. Smooth Discrimination Analysis , 1999 .

[10] Ingo Steinwart,et al. Fast Rates for Support Vector Machines , 2005, COLT.

[11] Ingo Steinwart,et al. Consistency of support vector machines and other regularized kernel classifiers , 2005, IEEE Transactions on Information Theory.

[12] Yoshua Bengio,et al. Pattern Recognition and Neural Networks , 1995 .

[13] Alexander J. Smola,et al. Learning with kernels , 1998 .