메뉴 건너뛰기




Volumn 3177, Issue , 2004, Pages 708-713

Boosting the tree augmented Naïve Bayes classifier

Author keywords

[No Author keywords available]

Indexed keywords


EID: 35048889592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28651-6_105     Document Type: Article
Times cited : (5)

References (6)
  • 1
    • 0025401005 scopus 로고
    • The Computational-Complexity of Probabilistic Inference Using Bayesian Belief Networks
    • Cooper, G.F.: The Computational-Complexity of Probabilistic Inference Using Bayesian Belief Networks. Artificial Intelligence 42, 393-405, 1990.
    • (1990) Artificial Intelligence , vol.42 , pp. 393-405
    • Cooper, G.F.1
  • 3
    • 0003642109 scopus 로고    scopus 로고
    • Dept. of Computer Science and Engineering, University of California San Diego
    • Elkan, C.: Boosting and Naive Bayesian Learning, Dept. of Computer Science and Engineering, University of California San Diego, 1997.
    • (1997) Boosting and Naive Bayesian Learning
    • Elkan, C.1
  • 4
    • 0031211090 scopus 로고    scopus 로고
    • A decision-theoretic generalization of on-line learning and an application to boosting
    • Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55, 119-139, 1997.
    • (1997) Journal of Computer and System Sciences , vol.55 , pp. 119-139
    • Freund, Y.1    Schapire, R.E.2
  • 5
    • 84933530882 scopus 로고
    • Approximating Discrete Probability Distributions with Dependence Trees
    • Chow, C.K., Liu, C.N.: Approximating Discrete Probability Distributions with Dependence Trees, IEEE Transactions on Information Theory, IT-14, 462-467, 1968.
    • (1968) IEEE Transactions on Information Theory , vol.IT-14 , pp. 462-467
    • Chow, C.K.1    Liu, C.N.2


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