메뉴 건너뛰기




Volumn , Issue , 2010, Pages 1047-1054

Negative selection algorithms without generating detectors

Author keywords

Artificial immune systems; Consistent learning; Negative selection

Indexed keywords

ARTIFICIAL IMMUNE SYSTEM; CONSISTENT LEARNING; DECISION PROBLEMS; EXPONENTIAL TIME; NEGATIVE EXAMPLES; NEGATIVE SELECTION; NEGATIVE SELECTION ALGORITHM; PERFORMANCE BOTTLENECKS; POLYNOMIAL-TIME ALGORITHMS; WORST CASE;

EID: 77955886649     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830673     Document Type: Conference Paper
Times cited : (15)

References (11)
  • 1
    • 70350342307 scopus 로고    scopus 로고
    • Efficient algorithms for string-based negative selection
    • volume 5666 of LNCS, Springer
    • M. Elberfeld andJ. Textor. Efficient algorithms for string-based negative selection. In Proc. of ICARIS 2009, volume 5666 of LNCS, pages 109-121. Springer, 2009.
    • (2009) Proc. of ICARIS 2009 , pp. 109-121
    • Elberfeld, M.1    Textor, J.2
  • 5
    • 34447506481 scopus 로고    scopus 로고
    • Revisiting negative selection algorithms
    • Z. Ji andD. Dasgupta. Revisiting negative selection algorithms. Evolutionary Computation, 15(2): 223-251, 2007.
    • (2007) Evolutionary Computation , vol.15 , Issue.2 , pp. 223-251
    • Ji, Z.1    Dasgupta, D.2
  • 7
    • 0024092215 scopus 로고
    • Computational limitations on learning from examples
    • L. Pitt andL. G. Valiant. Computational limitations on learning from examples. Journal of the ACM, 35: 965-984, 1988.
    • (1988) Journal of the ACM , vol.35 , pp. 965-984
    • Pitt, L.1    Valiant, L.G.2
  • 8
    • 70349143226 scopus 로고    scopus 로고
    • Foundations of r-contiguous matching in negative selection for anomaly detection
    • T. Stibor. Foundations of r-contiguous matching in negative selection for anomaly detection. Natural Computing, 8: 613-641, 2009.
    • (2009) Natural Computing , vol.8 , pp. 613-641
    • Stibor, T.1
  • 9
    • 34547258581 scopus 로고    scopus 로고
    • The link between r-contiguous detectors and k-cnf satisfiability
    • ACM
    • T. Stibor, J. Timmis, andC. Eckert. The link between r-contiguous detectors and k-cnf satisfiability. In Proc. of GECCO 2006, pages 491-498. ACM, 2006.
    • (2006) Proc. of GECCO 2006 , pp. 491-498
    • Stibor, T.1    Timmis, J.2    Eckert, C.3
  • 11
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal of Computing, 8: 410-421, 1979.
    • (1979) SIAM Journal of Computing , vol.8 , pp. 410-421
    • Valiant, L.G.1


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