메뉴 건너뛰기




Volumn 2, Issue , 2012, Pages 1175-1182

The Greedy Miser: Learning under test-time budgets

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; EXTRACTION TIME; FEATURE SETS; INDUSTRIAL SETTINGS; MULTI-CLASS CLASSIFICATION; RUNNING TIME;

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

References (25)
  • 6
    • 84898796721 scopus 로고    scopus 로고
    • Classifier cascade for minimizing feature evaluation cost
    • Chen, Minmin, Xu, Zhixiang, Weinberger, Kilian Q., and Chapelle, Olivier. Classifier cascade for minimizing feature evaluation cost. In AISTATS 15, pp. 218-226, 2012.
    • (2012) AISTATS 15 , pp. 218-226
    • Chen, M.1    Xu, Z.2    Weinberger, K.Q.3    Chapelle, O.4
  • 9
    • 0035470889 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • Friedman, J.H. Greedy function approximation: a gradient boosting machine. Annals of Statistics, pp. 1189-1232, 2001.
    • (2001) Annals of Statistics , pp. 1189-1232
    • Friedman, J.H.1
  • 10
    • 85162423878 scopus 로고    scopus 로고
    • Active classification based on value of classifier
    • Shawe-Taylor, J., Zemel, R.S., Bartlett, P., Pereira, F.C.N., and Weinberger, K.Q. (eds.)
    • Gao, Tianshi and Koller, Daphne. Active classification based on value of classifier. In Shawe-Taylor, J., Zemel, R.S., Bartlett, P., Pereira, F.C.N., and Weinberger, K.Q. (eds.), NIPS 24, pp. 1062-1070. 2011.
    • (2011) NIPS 24 , pp. 1062-1070
    • Gao, T.1    Koller, D.2
  • 11
    • 84954211749 scopus 로고    scopus 로고
    • Speedboost: Anytime prediction with uniform near-optimality
    • Grubb, Alex and Bagnell, Drew. Speedboost: Anytime prediction with uniform near-optimality. In AISTATS 15, pp. 458-466, 2012.
    • (2012) AISTATS 15 , pp. 458-466
    • Grubb, A.1    Bagnell, D.2
  • 15
    • 85161991159 scopus 로고    scopus 로고
    • Joint cascade optimization using a product of boosted classifiers
    • Lafferty, J., Williams, C. K. I., Shawe-Taylor, J., Zemel, R.S., and Culotta, A. (eds.)
    • Lefakis, Leonidas and Fleuret, Francois. Joint cascade optimization using a product of boosted classifiers. In Lafferty, J., Williams, C. K. I., Shawe-Taylor, J., Zemel, R.S., and Culotta, A. (eds.), NIPS 23, pp. 1315-1323. 2010.
    • (2010) NIPS 23 , pp. 1315-1323
    • Lefakis, L.1    Fleuret, F.2
  • 16
    • 85162513516 scopus 로고    scopus 로고
    • Object bank: A high-level image representation for scene classification and semantic feature sparsification
    • Li, L.J., Su, H., Xing, E.P., and Fei-Fei, L. Object bank: A high-level image representation for scene classification and semantic feature sparsification. NIPS, 2010.
    • (2010) NIPS
    • Li, L.J.1    Su, H.2    Xing, E.P.3    Fei-Fei, L.4
  • 17
    • 84867121714 scopus 로고    scopus 로고
    • Using classifier cascades for scalable e-mail classification
    • Pujara, J., Daumé III, H., and Getoor, L. Using classifier cascades for scalable e-mail classification. In CEAS 2011, 2011.
    • (2011) CEAS 2011
    • Pujara, J.1    Daumé III, H.2    Getoor, L.3
  • 18
    • 77956199907 scopus 로고    scopus 로고
    • Designing efficient cascaded classifiers: Tradeoff between accuracy and cost
    • Raykar, V.C., Krishnapuram, B., and Yu, S. Designing efficient cascaded classifiers: tradeoff between accuracy and cost. In SIGKDD 16, pp. 853-860, 2010.
    • (2010) SIGKDD 16 , pp. 853-860
    • Raykar, V.C.1    Krishnapuram, B.2    Yu, S.3
  • 20
    • 85162018114 scopus 로고    scopus 로고
    • Boosting Classifier Cascades
    • Lafferty, J., Williams, C. K. I., Shawe-Taylor, J., Zemel, R.S., and Culotta, A. (eds.)
    • Saberian, Mohammad and Vasconcelos, Nuno. Boosting Classifier Cascades. In Lafferty, J., Williams, C. K. I., Shawe-Taylor, J., Zemel, R.S., and Culotta, A. (eds.), NIPS 23, pp. 2047-2055. 2010.
    • (2010) NIPS 23 , pp. 2047-2055
    • Saberian, M.1    Vasconcelos, N.2
  • 22
    • 84898990165 scopus 로고    scopus 로고
    • The kernel trick for distances
    • Schölkopf, B. The kernel trick for distances. NIPS, pp. 301-307, 2001.
    • (2001) NIPS , pp. 301-307
    • Schölkopf, B.1
  • 25
    • 85161963897 scopus 로고    scopus 로고
    • A general boosting method and its application to learning ranking functions for web search
    • Platt, J.C., Koller, D., Singer, Y., and Roweis, S. (eds.), MIT Press, Cambridge, MA
    • Zheng, Z., Zha, H., Zhang, T., Chapelle, O., Chen, K., and Sun, G. A general boosting method and its application to learning ranking functions for web search. In Platt, J.C., Koller, D., Singer, Y., and Roweis, S. (eds.), NIPS 20, pp. 1697-1704. MIT Press, Cambridge, MA, 2008.
    • (2008) NIPS 20 , pp. 1697-1704
    • Zheng, Z.1    Zha, H.2    Zhang, T.3    Chapelle, O.4    Chen, K.5    Sun, G.6


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