The infinite push: A new support vector ranking algorithm that directly optimizes accuracy at the absolute top of the list

Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011

Volumn , Issue , 2011, Pages 839-850

  Agarwal, Shivani ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Area under ROC curve (AUC); Ranking; Support vector machines (SVMs)

Indexed keywords

QUADRATIC PROGRAMMING; RECOMMENDER SYSTEMS; SEARCH ENGINES; SUPPORT VECTOR MACHINES; VECTORS;

AREA UNDER ROC CURVE (AUC); COMPUTATIONAL BIOLOGY; DUAL OPTIMIZATION PROBLEMS; PROJECTION METHOD; QUADRATIC PROGRAMMING PROBLEMS; RANKING; RANKING ALGORITHM; SUPPORT VECTOR MACHINE (SVMS);

DATA MINING;

EID: 84880083510     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972818.72     Document Type: Conference Paper

References (34)

1. S. Agarwal and M. Collins. Maximum margin ranking algorithms for information retrieval. In Proceedings of the 32nd European Conference on Information Retrieval, 2010.
2. S. Agarwal, D. Dugar, and S. Sengupta. Ranking chemical structures for drug discovery: A new machine learning approach. Journal of Chemical Information and Modeling, 50(5):716-731, 2010.
3. S. Agarwal, T. Graepel, R. Herbrich, S. Har-Peled, and D. Roth. Generalization bounds for the area under the ROC curve. Journal of Machine Learning Research, 6:393-425, 2005.
4. S. Agarwal and P. Niyogi. Generalization bounds for ranking algorithms via algorithmic stability. Journal of Machine Learning Research, 10:441-474, 2009.
5. M. Anthony and P. L. Bartlett. Learning in Neural Networks: Theoretical Foundations. Cambridge University Press, 1999.
6. D. Bertsekas. Nonlinear Programming. Athena Scientific, 2nd edition, 1999.
7. O. Bousquet and A. Elisseeff. Stability and generalization. Journal of Machine Learning Research, 2:499-526, 2002.
8. C. J. C. Burges, R. Ragno, and Q. V. Le. Learning to rank with non-smooth cost functions. In Advances in Neural Information Processing Systems 19. MIT Press, 2007.
9. C. J. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In Proceedings of the 22nd International Conference on Machine Learning, 2005.
10. S. Chakrabarti, R. Khanna, U. Sawant, and C. Bhattacharyya. Structured learning for non-smooth ranking losses. In Proceedings of the 14th ACM Conference on Knowledge Discovery and Data Mining, 2008.
11. O. Chapelle and S. S. Keerthi. Efficient algorithms for ranking with SVMs. Information Retrieval Journal, 13(3):201-215, 2010.
12. O. Chapelle, Q. Le, and A. Smola. Large margin optimization of ranking measures. In Proceedings of the NIPS-2007 Workshop on Machine Learning for Web Search, 2007.
13. O. Chapelle and M. Wu. Gradient descent optimization of smoothed information retrieval metrics. Information Retrieval Journal, 13(3):216-235, 2010.
14. S. Clemencon and N. Vayatis. Ranking the best instances. Journal of Machine Learning Research, 8:2671-2699, 2007.
15. C. Cortes and M. Mohri. AUC optimization vs. error rate minimization. In Advances in Neural Information Processing Systems 16. MIT Press, 2004.
16. D. Cossock and T. Zhang. Statistical analysis of bayes optimal subset ranking. IEEE Transactions on Information Theory, 54(11):5140-5154, 2008.
17. J. Duchi, L. Mackey, and M. I. Jordan. On the consistency of ranking algorithms. In Proceedings of the 27th International Conference on Machine Learning, 2010.
18. A. Frank and A. Asuncion. UCI Machine Learning Repository, 2010. http://archive.ics.uci.edu/ml.
19. Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933-969, 2003.
20. H. Geppert, T. Horvath, T. Gärtner, S. Wrobel, and J. Bajorath. Support vector machine-based ranking significantly improves the effectiveness of similarity searching using 2D fingerprints and multiple reference compounds. Journal of Chemical Information and Modeling, 48:742-746, 2008.
21. H. Geppert, J. Humrich, D. Stumpfe, T. Gärtner, and J. Bajorath. Ligand prediction from protein sequence and small molecule information using support vector machines and fingerprint descriptors. Journal of Chemical Information and Modeling, 49:767-779, 2009.
22. R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. Advances in Large Margin Classifiers, pages 115-132, 2000.
23. T. Joachims. Optimizing search engines using click-through data. In Proceedings of the 8th ACM Conference on Knowledge Discovery and Data Mining, 2002.
24. R. N. Jorissen and M. K. Gilson. Virtual screening of molecular databases using a support vector machine. Journal of Chemical Information and Modeling, 45:549-561, 2005.
25. T.-Y. Liu. Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3(3):225-331, 2009.
26. OpenBabel. http://openbabel.org.
27. 1,∞ regularization. In Proceedings of the 26th International Conference on Machine Learning, 2009.
28. A. Rakotomamonjy. Optimizing area under ROC curves with SVMs. In Proceedings of the ECAI-2004 Workshop on ROC Analysis in AI, 2004.
29. C. Rudin. The P-norm push: A simple convex ranking algorithm that concentrates at the top of the list. Journal of Machine Learning Research, 10:2233-2271, 2009.
30. M. Taylor, J. Guiver, S. Robertson, and T. Minka. Softrank: optimizing non-smooth rank metrics. In Proceedings of the 1st ACM International Conference on Web Search and Data Mining, 2008.
31. A. M. Wassermann, H. Geppert, and J. Bajorath. Searching for target-selective compounds using different combinations of multi-class support vector machine ranking methods, kernel functions, and fingerprint descriptors. Journal of Chemical Information and Modeling, 49:582-592, 2009.
32. D. Wilton and P. Willett. Comparison of ranking methods for virtual screening in lead-discovery programs. Journal of Chemical Information and Computer Science, 43:469-474, 2003.
33. J. Xu and H. Li. AdaRank: A boosting algorithm for information retrieval. In Proceedings of the 30th ACM SIGIR Conference on Research and Development in Information Retrieval, 2007.
34. Y. Yue, T. Finley, F. Radlinski, and T. Joachims. A support vector method for optimizing average precision. In Proceedings of the 30th ACM SIGIR Conference on Research and Development in Information Retrieval, 2007.