메뉴 건너뛰기




Volumn , Issue , 1999, Pages 398-401

Combining classifiers based on minimization of a Bayes error rate

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ERRORS; PROBABILITY DISTRIBUTIONS; TREES (MATHEMATICS);

EID: 37949009754     PISSN: 15205363     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDAR.1999.791808     Document Type: Conference Paper
Times cited : (23)

References (7)
  • 1
    • 84933530882 scopus 로고
    • Approximating discrete probability distributions with dependence trees
    • C. K. Chow and C. N. Liu. Approximating Discrete Probability Distributions with Dependence Trees. IEEE Trans. on Inf. Tech., 14(3):462-467, 1968.
    • (1968) IEEE Trans. on Inf. Tech. , vol.14 , Issue.3 , pp. 462-467
    • Chow, C.K.1    Liu, C.N.2
  • 2
    • 84915005479 scopus 로고
    • Probability of error, equivocation, and the chernoff bound
    • M. E. Hellman and J. Raviv. Probability of error, equivocation, and the Chernoff bound. IEEE Trans. on Information Theory, IT-16:368-372, 1970.
    • (1970) IEEE Trans. on Information Theory , vol.IT-16 , pp. 368-372
    • Hellman, M.E.1    Raviv, J.2
  • 3
    • 0029230267 scopus 로고
    • A method of combining multiple experts for the recognition of unconstrained handwritten numerals
    • Y. S. Huang and C. Y. Suen. A Method of Combining Multiple Experts for the Recognition of Unconstrained Handwritten Numerals. IEEE Trans. on Pattern Analysis and Machine Intelligence, 17(1):90-94, 1995.
    • (1995) IEEE Trans. on Pattern Analysis and Machine Intelligence , vol.17 , Issue.1 , pp. 90-94
    • Huang, Y.S.1    Suen, C.Y.2
  • 4
    • 0031169205 scopus 로고    scopus 로고
    • Optimal approximation of discrete probability distribution with kth-order dependency and its applications to combining multiple classifiers
    • H.-J. Kang, K. Kim, and J. H. Kim. Optimal Approximation of Discrete Probability Distribution with kth-order Dependency and Its Applications to Combining Multiple Classifiers. Pattern Recognition Letters, 18(6):515-523, 1997.
    • (1997) Pattern Recognition Letters , vol.18 , Issue.6 , pp. 515-523
    • Kang, H.-J.1    Kim, K.2    Kim, J.H.3
  • 5
    • 0000956655 scopus 로고
    • Approximating probability distributions to reduce storage requirement
    • Sep.
    • P. M. Lewis. Approximating Probability Distributions to Reduce Storage Requirement. Information and Control, 2:214-225, Sep. 1959.
    • (1959) Information and Control , vol.2 , pp. 214-225
    • Lewis, P.M.1
  • 6
    • 0018480519 scopus 로고
    • Classification of discrete data with feature space transform
    • D. C. C. Wang and A. K. C. Wong. Classification of Discrete Data with Feature Space Transform. IEEE Trans. on Automatic Control, AC-24(3):434-437, 1979.
    • (1979) IEEE Trans. on Automatic Control , vol.AC-24 , Issue.3 , pp. 434-437
    • Wang, D.C.C.1    Wong, A.K.C.2
  • 7
    • 0026860706 scopus 로고
    • Methods of combining multiple classifiers and their applications to handwriting recognition
    • L. Xu, A. Krzyzak, and C. Y. Suen. Methods of Combining Multiple Classifiers and Their Applications to Handwriting Recognition. IEEE Trans. on Systems, Man, and Cybernetics, 22(3):418-435, 1992.
    • (1992) IEEE Trans. on Systems, Man, and Cybernetics , vol.22 , Issue.3 , pp. 418-435
    • Xu, L.1    Krzyzak, A.2    Suen, C.Y.3


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