메뉴 건너뛰기




Volumn , Issue , 2005, Pages 3119-3124

ROC analysis for predictions made by probabilistic classifiers

Author keywords

AUC; Probabilistic classifier; Ranker; ROC analysis

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBABILITY;

EID: 28444473876     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (39)

References (9)
  • 1
    • 0345438685 scopus 로고    scopus 로고
    • ROC graphs: Notes and practical considerations for data mining researchers
    • HP Laboratories
    • T. Fawcett, "ROC graphs: notes and practical considerations for data mining researchers", HP Technical Report HPL-2003-4, HP Laboratories, 2003.
    • (2003) HP Technical Report , vol.HPL-2003-4
    • Fawcett, T.1
  • 2
    • 1942421135 scopus 로고    scopus 로고
    • The geometry of ROC space: Understanding machine learning metrics through ROC isometrics
    • P. A. Flach, "The geometry of ROC space: understanding machine learning metrics through ROC isometrics", Proceedings of the ICML-04, 2004.
    • (2004) Proceedings of the ICML-04
    • Flach, P.A.1
  • 3
    • 14844342344 scopus 로고    scopus 로고
    • The many faces of ROC analysis in machine learning
    • P. A. Flach, "The many faces of ROC analysis in machine learning", ICML-2004 Tutorial, Notes available at:http://www.cs.bris.ac.uk/ flach/ICML04tutorial/index.html
    • ICML-2004 Tutorial
    • Flach, P.A.1
  • 4
    • 0003562954 scopus 로고    scopus 로고
    • A simple generalisation of the area under the ROC curve for multiple class classification problems
    • D. Hand and R. J. Till, "A simple generalisation of the area under the ROC curve for multiple class classification problems", Machine Learning, Vol. 45, 171-186, 2001.
    • (2001) Machine Learning , vol.45 , pp. 171-186
    • Hand, D.1    Till, R.J.2
  • 5
    • 84880794162 scopus 로고    scopus 로고
    • AUC: A statistically consistent and more discriminating measure than accuracy
    • C. X. Ling, J. Huang and H. Zhang, "AUC: a statistically consistent and more discriminating measure than accuracy", Proceedings of IJCAI-03, 2003.
    • (2003) Proceedings of IJCAI-03
    • Ling, C.X.1    Huang, J.2    Zhang, H.3
  • 6
    • 0002900357 scopus 로고    scopus 로고
    • The case against accuracy estimation for comparing induction algorithms
    • J. Shavlik, editor
    • F. Provost, T. Fawcett, and R. Kohavi, "The case against accuracy estimation for comparing induction algorithms," in J. Shavlik, editor, Proceedings of ICML-98, pp. 445-453, 1998.
    • (1998) Proceedings of ICML-98 , pp. 445-453
    • Provost, F.1    Fawcett, T.2    Kohavi, R.3
  • 7
    • 0035283313 scopus 로고    scopus 로고
    • Robust classification for imprecise environments
    • F. Provost and T. Fawcett, "Robust classification for imprecise environments", Machine Learning. Vol. 42, 203-231, 2001.
    • (2001) Machine Learning , vol.42 , pp. 203-231
    • Provost, F.1    Fawcett, T.2
  • 8
    • 0042346121 scopus 로고    scopus 로고
    • Tree induction for probability-based ranking
    • F. Provost and P. Domingos, "Tree induction for probability-based ranking",Machine Learning. 52, 199-215, 2003.
    • (2003) Machine Learning , vol.52 , pp. 199-215
    • Provost, F.1    Domingos, P.2
  • 9
    • 0003259364 scopus 로고    scopus 로고
    • Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers
    • [9] B. Zadrozny and C. Elkan, "Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers", Proceedings of ICML-01, 2001.
    • (2001) Proceedings of ICML-01
    • Zadrozny, B.1    Elkan, C.2


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