메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Agnostic selective classification

Author keywords

[No Author keywords available]

Indexed keywords

AGNOSTIC SETTING; CLASSIFICATION ALGORITHM; CLASSIFICATION PERFORMANCE; COMPUTATIONAL BARRIERS; EMPIRICAL ERRORS; ERROR MINIMIZATION; EXCESS LOSS; LEARNING PROBLEM; PROBABILISTICS;

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

References (27)
  • 1
    • 77953500857 scopus 로고    scopus 로고
    • On the foundations of noise-free selective classification
    • R. El-Yaniv and Y. Wiener. On the foundations of noise-free selective classification. JMLR, 11:1605-1641, 2010.
    • (2010) JMLR , vol.11 , pp. 1605-1641
    • El-Yaniv, R.1    Wiener, Y.2
  • 2
    • 84937744538 scopus 로고
    • An optimum character recognition system using decision function
    • C.K. Chow. An optimum character recognition system using decision function. IEEE Trans. Computer, 6(4):247-254, 1957.
    • (1957) IEEE Trans. Computer , vol.6 , Issue.4 , pp. 247-254
    • Chow, C.K.1
  • 3
    • 0014710323 scopus 로고
    • On optimum recognition error and reject trade-off
    • C.K. Chow. On optimum recognition error and reject trade-off. IEEE Trans. on Information Theory, 16:41-36, 1970.
    • (1970) IEEE Trans. on Information Theory , vol.16 , pp. 41-36
    • Chow, C.K.1
  • 4
    • 34547983474 scopus 로고    scopus 로고
    • A bound on the label complexity of agnostic active learning
    • S. Hanneke. A bound on the label complexity of agnostic active learning. In ICML, pages 353-360, 2007.
    • (2007) ICML , pp. 353-360
    • Hanneke, S.1
  • 7
    • 33746194045 scopus 로고    scopus 로고
    • IMS medallion lecture: Local rademacher complexities and oracle inequalities in risk minimization
    • V. Koltchinskii. 2004 IMS medallion lecture: Local rademacher complexities and oracle inequalities in risk minimization. Annals of Statistics, 34:2593-2656, 2006.
    • (2004) Annals of Statistics , vol.34 , pp. 2593-2656
    • Koltchinskii, V.1
  • 8
    • 34547313726 scopus 로고    scopus 로고
    • Discussion of 2004 IMS medallion lecture: Local rademacher complex-ities and oracle inequalities in risk minimization
    • by V. koltchinskii
    • P.L. Bartlett and S. Mendelson. Discussion of "2004 IMS medallion lecture: Local rademacher complex-ities and oracle inequalities in risk minimization" by V. koltchinskii. Annals of Statistics, 34:2657-2663, 2006.
    • (2006) Annals of Statistics , vol.34 , pp. 2657-2663
    • Bartlett, P.L.1    Mendelson, S.2
  • 9
    • 3142725508 scopus 로고    scopus 로고
    • Optimal aggregation of classifiers in statistical learning
    • A.B. Tsybakov. Optimal aggregation of classifiers in statistical learning. Annals of Mathematical Statistics, 32:135-166, 2004.
    • (2004) Annals of Mathematical Statistics , vol.32 , pp. 135-166
    • Tsybakov, A.B.1
  • 11
    • 33846313242 scopus 로고    scopus 로고
    • Introduction to statistical learning theory
    • volume 3176 of Lecture Notes in Computer Science. Springer
    • O. Bousquet, S. Boucheron, and G. Lugosi. Introduction to statistical learning theory. In Advanced Lectures on Machine Learning, volume 3176 of Lecture Notes in Computer Science, pages 169-207. Springer, 2003.
    • (2003) Advanced Lectures on Machine Learning , pp. 169-207
    • Bousquet, O.1    Boucheron, S.2    Lugosi, G.3
  • 12
    • 80052202374 scopus 로고    scopus 로고
    • Smoothness disagreement coefficient, and the label complexity of agnostic active learning
    • L. Wang. Smoothness, disagreement coefficient, and the label complexity of agnostic active learning. JMLR, pages 2269-2292, 2011.
    • (2011) JMLR , pp. 2269-2292
    • Wang, L.1
  • 13
    • 56449123291 scopus 로고    scopus 로고
    • A general agnostic active learning algorithm
    • S. Dasgupta, D. Hsu, and C. Monteleoni. A general agnostic active learning algorithm. In NIPS, 2007.
    • (2007) NIPS
    • Dasgupta, S.1    Hsu, D.2    Monteleoni, C.3
  • 15
    • 79955702502 scopus 로고    scopus 로고
    • LIBSVM: A library for support vector machines
    • Software
    • C.C. Chang and C.J. Lin. LIBSVM: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology, 2:27:1-27:27, 2011. Software available at "http://www.csie.ntu.edu.tw/cjlin/libsvm".
    • (2011) ACM Transactions on Intelligent Systems and Technology , vol.2 , pp. 271-2727
    • Chang, C.C.1    Lin, C.J.2
  • 16
    • 70049110659 scopus 로고    scopus 로고
    • Support vector machines with a reject option
    • MIT Press
    • Y. Grandvalet, A. Rakotomamonjy, J. Keshet, and S. Canu. Support vector machines with a reject option. In NIPS, pages 537-544. MIT Press, 2008.
    • (2008) NIPS , pp. 537-544
    • Grandvalet, Y.1    Rakotomamonjy, A.2    Keshet, J.3    Canu, S.4
  • 17
    • 17644427902 scopus 로고    scopus 로고
    • American Cancer Society
    • American Cancer Society. Cancer facts and figures. 2010.
    • (2010) Cancer Facts and Figures
  • 18
    • 24344500472 scopus 로고    scopus 로고
    • Generalization bounds for averaged classifiers
    • Y. Freund, Y. Mansour, and R.E. Schapire. Generalization bounds for averaged classifiers. Annals of Statistics, 32(4):1698-1722, 2004.
    • (2004) Annals of Statistics , vol.32 , Issue.4 , pp. 1698-1722
    • Freund, Y.1    Mansour, Y.2    Schapire, R.E.3
  • 21
    • 66349111215 scopus 로고    scopus 로고
    • Lasso type classifiers with a reject option
    • M.H. Wegkap. Lasso type classifiers with a reject option. Electronic Journal of Statistics, 1:155-168, 2007.
    • (2007) Electronic Journal of Statistics , vol.1 , pp. 155-168
    • Wegkap, M.H.1
  • 23
    • 0036161259 scopus 로고    scopus 로고
    • Gene selection for cancer classification using support vector machines
    • I. Guyon, J. Weston, S. Barnhill, and V. Vapnik. Gene selection for cancer classification using support vector machines. Machine Learning, pages 389-422, 2002.
    • (2002) Machine Learning , pp. 389-422
    • Guyon, I.1    Weston, J.2    Barnhill, S.3    Vapnik, V.4
  • 26
    • 77950824603 scopus 로고    scopus 로고
    • An ordinal data method for the classification with reject option
    • IEEE Computer Society
    • R. Sousa, B. Mora, and J.S. Cardoso. An ordinal data method for the classification with reject option. In ICMLA, pages 746-750. IEEE Computer Society, 2009.
    • (2009) ICMLA , pp. 746-750
    • Sousa, R.1    Mora, B.2    Cardoso, J.S.3
  • 27
    • 85162337997 scopus 로고    scopus 로고
    • Active learning via perfect selective classification
    • Accepted to
    • R. El-Yaniv and Y. Wiener. Active learning via perfect selective classification. Accepted to JMLR, 2011.
    • (2011) JMLR
    • El-Yaniv, R.1    Wiener, Y.2


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