A fast algorithm for learning large scale preference relations

Journal of Machine Learning Research

Volumn 2, Issue , 2007, Pages 388-395

  Raykar, Vikas C ^a   Duraiswami, Ramani ^a   Krishnapuram, Balaji ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b Siemens Medical Solutions ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLLABORATIVE FILTERING; CONJUGATE GRADIENT ALGORITHMS; ERROR-FUNCTION; FAST ALGORITHMS; ORDERS OF MAGNITUDE; ORDINAL REGRESSION; PREFERENCE RELATION; RANKING FUNCTIONS; TRAINING DATA;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONJUGATE GRADIENT METHOD;

INFORMATION RETRIEVAL;

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

References (18)

1. N. C. Beauliu. A simple series for personal computer computation of the error function Q(:). IEEE Trans. Comm., 37(9):989-991, September 1989.
2. C. J. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In ICML, 2005.
3. K. Crammer and Y. Singer. Pranking with ranking. In NIPS 14, 2002.
4. O. Dekel, C. Manning, and Y. Singer. Log-linear models for label ranking. In NIPS 16, 2004.
5. Y. Freund, R. Iyer, and R. Schapire. An efficient boosting algorithm for combining preferences. JMLR, 4:933-969, 2003.
6. G. Fung, R. Rosales, and B. Krishnapuram. Learning rankings via convex hull separation. In NIPS 18, 2006.
7. A. G. Gray and A. W. Moore. Nonparametric density estimation: Toward computational tractability. In SIAM Intl. Conf. Data Mining, 2003.
8. L. Greengard. Fast algorithms for classical physics. Science, 265(5174):909-914, 1994.
9. R. Herbrich, T. Graepel, P. Bollmann-Sdorra, and K. Obermayer. Learning preference relations for information retrieval. ICML-98 Workshop: Text Categorization and Machine Learning, pp. 80-84, 1998.
10. A. Herschtal and B. Raskutti. Optimising area under the ROC curve using gradient descent. In ICML, 2004.
11. T. Joachims. Optimizing search engines using clickthrough data. Proc. ACM SIGKDD, pp. 133-142, 2002.
12. H. B. Mann and D. R. Whitney. On a Test of whether one of two random variables is stochastically larger than the other. Ann. Math. Stat., 18(1):50-60, 1947.
13. J. Nocedal and S. J. Wright. Numerical Optimization. Springer-Verlag, 1999.
14. V. C. Raykar, R. Duraiswami, and B. Krishnapuram. Fast weighted summation of erfc functions. CS-TR4848, Dept. of Comp. Science, Univ. of Maryland CollegePark, 2007.
15. C. Tellambura and A. Annamalai. Efficient computation of erfc(x) for large arguments. IEEE Trans Comm., 48(4):529-532, April 2000.
16. L. Yan, R. Dodier, M. Mozer, and R. Wolniewicz. Optimizing classifier performance via an approximation to the Wilcoxon-Mann-Whitney statistic. In ICML 2003.
17. R. Yan and A. Hauptmann. Efficient margin-based rank learning algorithms for information retrieval. In CIVR, 2006.
18. C. Yang, R. Duraiswami, and L. Davis. Efficient kernel machines using the improved fast Gauss transform. In NIPS 17, 2005.