메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 420-424

Naive Bayes vs decision trees in intrusion detection systems

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITION; DECISION MAKING; INFORMATION ANALYSIS; LEARNING SYSTEMS; MATRIX ALGEBRA; PATTERN RECOGNITION; TREES (MATHEMATICS);

EID: 2442424268     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.967989     Document Type: Conference Paper
Times cited : (385)

References (16)
  • 1
    • 0003516333 scopus 로고    scopus 로고
    • Intrusion detection systems: A survey and taxonomy
    • March
    • Axelsson, S.: Intrusion detection systems: a survey and taxonomy. Technical report 99-15, March 2000.
    • (2000) Technical Report , vol.99 , Issue.15
    • Axelsson, S.1
  • 3
    • 0025401005 scopus 로고
    • Computational complexity of probabilistic inference using Bayes belief networks
    • Cooper, G. F.: Computational complexity of probabilistic inference using Bayes belief networks. Artificial Intelligence, Vol. 42, 393-405, 1990.
    • (1990) Artificial Intelligence , vol.42 , pp. 393-405
    • Cooper, G.F.1
  • 4
    • 0001815269 scopus 로고
    • Constructing optimal binary decision trees is NP-complete
    • Hyafil, L., Rivest, R. L: Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, 1976.
    • (1976) Information Processing Letters , vol.5 , Issue.1 , pp. 15-17
    • Hyafil, L.1    Rivest, R.L.2
  • 15
    • 2442613503 scopus 로고    scopus 로고
    • http://kdd.ccs.uci.edu/databases/kddcup99/task.html


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