메뉴 건너뛰기




Volumn 13, Issue , 2012, Pages 3681-3724

Security analysis of online centroid anomaly detection

Author keywords

Adversarial; Anomaly detection; Computer security; Network intrusion detection; Security analysis; Support vector data description

Indexed keywords

ADVERSARIAL; ANOMALY DETECTION; NETWORK INTRUSION DETECTION; SECURITY ANALYSIS; SUPPORT VECTOR DATA DESCRIPTION;

EID: 84873445143     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (80)

References (70)
  • 1
    • 0000492326 scopus 로고
    • Learning from noisy examples
    • D. Angluin and P. Laird. Learning from noisy examples. Machine Learning, 2(4):434-470, 1988.
    • (1988) Machine Learning , vol.2 , Issue.4 , pp. 434-470
    • Angluin, D.1    Laird, P.2
  • 2
    • 0346044653 scopus 로고    scopus 로고
    • Learning nested differences in the presence of malicious noise
    • PII S0304397597000194
    • P. Auer. Learning nested differences in the presence of malicious noise. Theoretical Computer Science, 185(1):159-175, 1997. (Pubitemid 127452836)
    • (1997) Theoretical Computer Science , vol.185 , Issue.1 , pp. 159-175
    • Auer, P.1
  • 14
    • 84873415283 scopus 로고    scopus 로고
    • Learning to classify with missing and corrupted features
    • O. Dekel, O. Shamir, and L. Xiao. Learning to classify with missing and corrupted features. Machine Learning, 2009.
    • (2009) Machine Learning
    • Dekel, O.1    Shamir, O.2    Xiao, L.3
  • 15
    • 34547359214 scopus 로고    scopus 로고
    • Evading network anomaly detection systems: Formal reasoning and practical techniques
    • DOI 10.1145/1180405.1180414, 1180414, CCS 2006: Proceedings of the 13th ACM Conference on Computer and Communications Security
    • P. Fogla and W. Lee. Evading network anomaly detection systems: formal reasoning and practical techniques. In ACM Conference on Computer and Communications Security, pages 59-68, 2006. (Pubitemid 47131356)
    • (2006) Proceedings of the ACM Conference on Computer and Communications Security , pp. 59-68
    • Fogla, P.1    Lee, W.2
  • 19
  • 20
    • 0027640858 scopus 로고
    • Learning in the presence of malicious errors
    • M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM Journal on Computing, 22(4):807-837, 1993. (Pubitemid 23677152)
    • (1993) SIAM Journal on Computing , vol.22 , Issue.4 , pp. 807-837
    • Kearns Michael1    Li Ming2
  • 21
    • 74049158178 scopus 로고    scopus 로고
    • A framework for quantitative security analysis of machine learning
    • D. Balfanz and J. Staddon, editors ISBN 978-1-60558-781-783
    • P. Laskov and M. Kloft. A framework for quantitative security analysis of machine learning. In D. Balfanz and J. Staddon, editors, AISec, pages 1-4. ACM, 2009. ISBN 978-1-60558-781-3.
    • (2009) AISec ACM , pp. 1-4
    • Laskov, P.1    Kloft, M.2
  • 24
    • 33745777639 scopus 로고    scopus 로고
    • Incremental support vector learning: Analysis, implementation and applications
    • P. Laskov, C. Gehl, S. Kr ̌uger, and K. R. M̌uller. Incremental support vector learning: Analysis, implementation and applications. Journal of Machine Learning Research, 7:1909-1936, Sept. 2006. (Pubitemid 44477117)
    • (2006) Journal of Machine Learning Research , vol.7 , pp. 1909-1936
    • Laskov, P.1    Gehl, C.2    Kruger, S.3    Muller, K.-R.4
  • 26
    • 0036358995 scopus 로고    scopus 로고
    • The spectrum kernel: A string kernel for svm protein classification
    • C. Leslie, E. Eskin, and W. Noble. The spectrum kernel: A string kernel for SVM protein classification. In Proc. Pacific Symp. Biocomputing, pages 564-575, 2002.
    • (2002) Proc. Pacific Symp. Biocomputing , pp. 564-575
    • Leslie, C.1    Eskin, E.2    Noble, W.3
  • 28
    • 34250091945 scopus 로고
    • Learning quickly when irrelevant attributes abound: A new linear threshold algorithm
    • N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear threshold algorithm. Machine Learning, 2:285-318, 1988.
    • (1988) Machine Learning , vol.2 , pp. 285-318
    • Littlestone, N.1
  • 31
    • 0142063407 scopus 로고    scopus 로고
    • Novelty detection: A review - Part 1: Statistical approaches
    • M. Markou and S. Singh. Novelty detection: a review - part 1: statistical approaches. Signal Processing, 83:2481-2497, 2003a.
    • (2003) Signal Processing , vol.83 , pp. 2481-2497
    • Markou, M.1    Singh, S.2
  • 32
    • 0142126712 scopus 로고    scopus 로고
    • Novelty detection: A review - Part 2: Neural network based approaches
    • M. Markou and S. Singh. Novelty detection: a review - part 2: neural network based approaches. Signal Processing, 83:2499-2521, 2003b.
    • (2003) Signal Processing , vol.83 , pp. 2499-2521
    • Markou, M.1    Singh, S.2
  • 33
    • 34250103140 scopus 로고    scopus 로고
    • On solving a linear program with one quadratic constraint
    • L. Martein and S. Schaible. On solving a linear program with one quadratic constraint. Decisions in Economics and Finance, 10:75-90, 2005.
    • (2005) Decisions in Economics and Finance , vol.10 , pp. 75-90
    • Martein, L.1    Schaible, S.2
  • 34
    • 84873431125 scopus 로고    scopus 로고
    • Microsoft. Microsoft security intelligence report: January to
    • June
    • Microsoft. Microsoft security intelligence report: January to June 2008. Microsoft Corporation, 2008.
    • (2008) Microsoft Corporation
  • 35
    • 77949498582 scopus 로고    scopus 로고
    • Stability bounds for stationary φ-mixing and β-mixing
    • March 2010 ISSN
    • M.Mohri and A. Rostamizadeh. Stability bounds for stationary φ-mixing and β-mixing processes. J. Mach. Learn. Res., 11:789-814, March 2010. ISSN 1532-4435. URL http: //portal.acm.org/citation. cfmid=1756006.1756032.
    • Processes. J. Mach. Learn. Res , vol.11 , pp. 1532-4435
    • Mohri, M.1    Rostamizadeh, A.2
  • 42
    • 0001473437 scopus 로고
    • On estimation of probability density function and mode
    • E. Parzen. On estimation of probability density function and mode. Annals of Mathematical Statistics, 33:1065-1076, 1962.
    • (1962) Annals of Mathematical Statistics , vol.33 , pp. 1065-1076
    • Parzen, E.1
  • 43
    • 33751051489 scopus 로고    scopus 로고
    • Misleading worm signature generators using deliberate noise injection
    • DOI 10.1109/SP.2006.26, 1623998, Proceedings - 2006 IEEE Symposium on Security and Privacy, S+P 2006
    • R. Perdisci, D. Dagon, W. Lee, P. Fogla, and M. Sharif. Misleading worm signature generators using deliberate noise injection. In Proc. of IEEE Symposium on Security and Privacy, pages 17-31, 2006. (Pubitemid 44753709)
    • (2006) Proceedings - IEEE Symposium on Security and Privacy , vol.2006 , pp. 17-31
    • Perdisci, R.1    Dagon, D.2    Lee, W.3    Foglat, P.4    Sharif, M.5
  • 44
    • 0001030653 scopus 로고
    • Measuring mass concentration and estimating density contour clusters - An excess mass approach
    • W. Polonik. Measuring mass concentration and estimating density contour clusters - an excess mass approach. Annals of Statistics, 23:855-881, 1995.
    • (1995) Annals of Statistics , vol.23 , pp. 855-881
    • Polonik, W.1
  • 45
    • 38549109147 scopus 로고    scopus 로고
    • Quarter sphere based distributed anomaly detection in wireless sensor networks
    • DOI 10.1109/ICC.2007.637, 4289308, 2007 IEEE International Conference on Communications, ICC'07
    • S. Rajasegarar, C. Leckie,M. Palaniswami, and J. Bezdek. Quarter sphere based distributed anomaly detection in wireless sensor networks. In IEEE International Conference on Communications (ICC), pages 3864-3869, 2007. (Pubitemid 351146132)
    • (2007) IEEE International Conference on Communications , pp. 3864-3869
    • Rajasegarar, S.1    Leckie, C.2    Palaniswami, M.3    Bezdek, J.C.4
  • 47
    • 33846910249 scopus 로고    scopus 로고
    • Language models for detection of unknown attacks in network traffic
    • K. Rieck and P. Laskov. Language models for detection of unknown attacks in network traffic. Journal in Computer Virology, 2(4):243-256, 2007.
    • (2007) Journal in Computer Virology , vol.2 , Issue.4 , pp. 243-256
    • Rieck, K.1    Laskov, P.2
  • 48
    • 38949156579 scopus 로고    scopus 로고
    • Linear-time computation of similarity measures for sequential data
    • Jan
    • K. Rieck and P. Laskov. Linear-time computation of similarity measures for sequential data. Journal of Machine Learning Research, 9(Jan):23-48, 2008.
    • (2008) Journal of Machine Learning Research , vol.9 , pp. 23-48
    • Rieck, K.1    Laskov, P.2
  • 51
    • 0347243182 scopus 로고    scopus 로고
    • Nonlinear Component Analysis as a Kernel Eigenvalue Problem
    • B. Scȟolkopf, A. Smola, and K.-R. M̌uller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10:1299-1319, 1998. (Pubitemid 128463674)
    • (1998) Neural Computation , vol.10 , Issue.5 , pp. 1299-1319
    • Scholkopf, B.1    Smola, A.2    Muller, K.-R.3
  • 52
  • 57
    • 55049121775 scopus 로고    scopus 로고
    • Learning from dependent observations
    • January . ISSN 0047-259X
    • I. Steinwart, D. Hush, and C. Scovel. Learning from dependent observations. J. Multivar. Anal., 100:175-194, January 2009. ISSN 0047-259X.
    • (2009) J. Multivar. Anal , vol.100 , pp. 175-194
    • Steinwart, I.1    Hush, D.2    Scovel, C.3
  • 59
    • 84873469848 scopus 로고    scopus 로고
    • Symantec. Symantex report on the underground economy: July 07 to June 08. Symantec Corporation
    • Symantec. Symantex report on the underground economy: July 07 to June 08. Symantec Corporation, 2008.
    • (2008)
  • 60
    • 0001986205 scopus 로고    scopus 로고
    • Data domain description by support vectors
    • M. Verleysen, editor Brussels, . D. Facto Press
    • D. Tax and R. Duin. Data domain description by support vectors. In M. Verleysen, editor, Proc. ESANN, pages 251-256, Brussels, 1999a. D. Facto Press.
    • (1999) Proc. ESANN , pp. 251-256
    • Tax, D.1    Duin, R.2
  • 61
    • 0033220728 scopus 로고    scopus 로고
    • Support vector domain description
    • DOI 10.1016/S0167-8655(99)00087-2
    • D. Tax and R. Duin. Support vector domain description. Pattern Recognition Letters, 20(11-13): 1191-1199, 1999b. (Pubitemid 32261897)
    • (1999) Pattern Recognition Letters , vol.20 , Issue.11-13 , pp. 1191-1199
    • Tax, D.M.J.1    Duin, R.P.W.2
  • 62
    • 0031478562 scopus 로고    scopus 로고
    • On nonparametric estimation of density level sets
    • A. Tsybakov. On nonparametric estimation of density level sets. Annals of Statistics, 25:948-969, 1997.
    • (1997) Annals of Statistics , vol.25 , pp. 948-969
    • Tsybakov, A.1
  • 63
    • 22044451539 scopus 로고
    • Programming with a quadratic constraint
    • C. van de Panne. Programming with a quadratic constraint. Management Science, 12:798-815, 1966.
    • (1966) Management Science , vol.12 , pp. 798-815
    • Van De Panne, C.1
  • 65
    • 33646554819 scopus 로고    scopus 로고
    • Consistency and convergence rates of one-class svms and related algorithms
    • December ISSN 1532-4435
    • R. Vert and J.-P. Vert. Consistency and convergence rates of one-class svms and related algorithms. J. Mach. Learn. Res., 7:789-814, December 2006. ISSN 1532-4435.
    • (2006) J. Mach. Learn. Res. , vol.7 , pp. 789-814
    • Vert, R.1    Vert, J.-P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.