Classifier cascade for minimizing feature evaluation cost

Journal of Machine Learning Research

Volumn 22, Issue , 2012, Pages 218-226

  Chen, Minmin ^a   Xu, Zhixiang Eddie ^a   Weinberger, Kilian Q ^a   Chapelle, Olivier ^b   Kedem, Dor ^a  

^a WASHINGTON UNIVERSITY   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COSTS; EXTRACTION; FEATURE EXTRACTION; LEARNING ALGORITHMS; LEARNING SYSTEMS; WORLD WIDE WEB;

AVERAGE RUNNING TIME; CASCADE OF CLASSIFIERS; COMPUTATION TIME; FEATURE EVALUATION; INDUSTRIAL SETTINGS; OVERALL COSTS; TEST TIME; WEB SEARCH RANKINGS;

CLASSIFICATION (OF INFORMATION);

EID: 84898796721     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (24)

1. J. Abernethy, O. Chapelle, and C. Castillo. Web spam identification through content and hyperlinks. In Proceedings of the 4th international workshop on Adversarial information retrieval on the web, pages 41-14. ACM, 2008.
2. J. Bennett and S. Lanning. The netflix prize. In Proceedings ofKDD Cup and Workshop, volume 2007, page 35, 2007.
3. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, Cambridge, England, 2004.
4. L. Breiman, J. Friedman, C.J. Stone, and R.A. Ol-shen. Classification and regression trees. Chapman & Hall/CRC, 1984.
5. A. Broder, E. Gabrilovich, V. Josifovski, G. Mavromatis, D. Metzler, and J. Wang. Exploiting site-level information to improve web search. In Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010.
6. B. B. Cambazoglu, H. Zaragoza, O. Chapelle, J. Chen, C. Liao, Z. Zheng, and J. Degenhardt. Early exit optimizations for additive machine learned ranking systems. In Proceedings of the third ACM international conference on Web search and data mining, pages 411-420. ACM, 2010.
7. O. Chapelle and Y. Chang. Yahoo! learning to rank challenge overview. In Journal ofMachine Learning Research, Workshop and Conference Proceedings, volume 14, pages 1-24, 2011.
8. O. Chapelle, D. Metlzer, Y. Zhang, and P. Grinspan. Expected reciprocal rank for graded relevance. In Proceeding of the 18th ACM conference on Information and knowledge management, pages 621-630, 2009.
9. O. Chapelle, P. Shivaswamy, S. Vadrevu, K.Q. Weinberger, Ya Zhang, and B. Tseng. Multi-task learning for boosting with application to web search ranking. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1189-1198, 2010.
10. M.M. Dundar and J. Bi. Joint optimization of cascaded classifiers for computer aided detection. In 2007 IEEE Conference on Computer Vision and Pattern Recognition, pages 1-8. IEEE, 2007.
11. M. Fleck, D. Forsyth, and C. Bregler. Finding naked people. Computer Vision-ECCV'96, pages 593-602, 1996.
12. J. Friedman. Greedy function approximation: a gradient boosting machine. Annals of Statistics, 29:1189-1232, 2001.
13. K. Jarvelin and J. Kekalainen. Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems (TOIS), 20(4):422-446, 2002.
14. M. Kowalski. Sparse regression using mixed norms. Applied and Computational Harmonic Analysis, 27(3): 303-324, 2009.
15. L. Lefakis and F. Fleuret. Joint Cascade Optimization Using a Product of Boosted Classifiers. Advances in neural information processing systems, 2010.
16. A. Mohan, Z. Chen, and K.Q. Weinberger. Web-search ranking with initialized gradient boosted regression trees. Journal of Machine Learning Research, Workshop and Conference Proceedings, 14:77-89, 2011.
17. V.C. Raykar, B. Krishnapuram, and S. Yu. Designing efficient cascaded classifiers: tradeoff between accuracy and cost. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 853-860, 2010.
18. M.J. Saberian and N. Vasconcelos. Boosting classifier cascades. In Neural Information Processing Systems (NIPS), 2010.
19. R.E. Schapire. A brief introduction to boosting. In International Joint Conference on Artificial Intelligence, volume 16, pages 1401-1406. Lawrence Erlbaum Associates ltd, 1999.
20. S. Tyree, K.Q. Weinberger, K. Agrawal, and J. Paykin. Parallel boosted regression trees for web search ranking. In Proceedings of the 20th international conference on World wide web, pages 387-396. ACM, 2011.
21. P. Viola and M. Jones. Robust real-time object detection. International Journal of Computer Vision, 57(2):137-154, 2002.
22. L. Wang, J. Lin, and D. Metzler. A cascade ranking model for efficient ranked retrieval. In Proceedings of the 34th Annual International ACM SIGIR conference on Research and development in information retrieval, 2011.
23. K.Q. Weinberger, A. Dasgupta, J. Langford, A. Smola, and J. Attenberg. Feature hashing for large scale multitask learning. In Proceedings of the 26th Annual International Conference on Machine Learning, pages 1113-1120. ACM, 2009.
24. Z. Zheng, H. Zha, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for web search. In Advances in Neural Information Processing Systems. Cambridge, MA, 2008.