SortNet: Learning to rank by a neural preference function

IEEE Transactions on Neural Networks

Volumn 22, Issue 9, 2011, Pages 1368-1380

  Rigutini, Leonardo ^a   Papini, Tiziano ^a   Maggini, Marco ^a   Scarselli, Franco ^a  

^a UNIVERSITY OF SIENA   (Italy)

Author keywords

Learning to rank; neural networks; preference learning; selective learning

Indexed keywords

DATA SETS; FEATURE-BASED; GIVEN CRITERION; INFORMATIVE PATTERNS; LEARNING TO RANK; PERSONALIZED RETRIEVAL; PREFERENCE FUNCTIONS; PREFERENCE LEARNING; RANKING ALGORITHM; RANKING PERFORMANCE; RELEVANCE CRITERIA; RELEVANCE RANKING; RELEVANCE SCORE; SCORING FUNCTIONS; SELECTIVE LEARNING; SORTING ALGORITHM; STATE-OF-THE-ART ALGORITHMS; TRAINING SETS;

EVOLUTIONARY ALGORITHMS; FUNCTIONS;

NEURAL NETWORKS;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; AUTOMATED PATTERN RECOGNITION; CLUSTER ANALYSIS; FEEDBACK SYSTEM; HUMAN; INFORMATION RETRIEVAL; LEARNING; METHODOLOGY; PHYSIOLOGY;

ALGORITHMS; CLUSTER ANALYSIS; FEEDBACK; HUMANS; INFORMATION STORAGE AND RETRIEVAL; LEARNING; NEURAL NETWORKS (COMPUTER); PATTERN RECOGNITION, AUTOMATED;

EID: 80052421853     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2011.2160875     Document Type: Review

References (33)

1. T.-Y. Liu, "Learning to rank for information retrieval", Found. Trends Inform. Retrieval, vol. 3, no. 3, pp. 225-331, Mar. 2009.
2. D. A. Cohn, Z. Ghahramani, and M. I. Jordan, "Active learning with statistical models", J. Artif. Intell. Res., vol. 4, no. 1, pp. 129-145, Mar. 1996.
3. S. Tong and D. Koller, "Support vector machine active learning with applications to text classification", J. Mach. Learn. Res., vol. 2, no. 1, pp. 45-66, Mar. 2002.
4. J. R. Quinlan, "Learning efficient classification procedures and their application to chess end-games", in Machine Learning: An Artificial Intelligence Approach, R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, Eds. San Mateo, CA: Morgan Kaufmann, 1983, pp. 463-482.
5. D. A. Cohn, "Neural network exploration using optimal experiment design", Neural Netw., vol. 9, no. 6, pp. 1071-1083, Aug. 1996.
6. A. Engelbrecht and I. Cloete, "Incremental learning using sensitivity analysis", in Proc. Int. Joint Conf. Neural Netw., vol. 2. Washington D. C., Jul. 1999, pp. 1350-1355.
7. T. Qin, T.-Y. Liu, J. Xu, and H. Li, "LETOR: A benchmark collection for research on learning to rank for information retrieval", Inform. Retrieval, vol. 13, no. 4, pp. 346-374, Aug. 2010.
8. Y. Cao, J. Xu, T.-Y. Liu, H. Li, Y. Huang, and H.-W. Hon, "Adapting ranking SVM to document retrieval", in Proc. 29th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, Seattle, WA, Aug. 2006, pp. 186-193.
9. Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer, "An efficient boosting algorithm for combining preferences", J. Mach. Learn. Res., vol. 4, no. 6, pp. 933-969, Dec. 2003.
10. M.-F. Tsai, T.-Y. Liu, T. Qin, H.-H. Chen, and W.-Y. Ma, "FRank: A ranking method with fidelity loss", in Proc. 30th Int. ACM SIGIR Conf. Res. Develop. Inform. Retrieval, Amsterdam, The Netherlands, Jul. 2007, pp. 383-390.
11. Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, and H. Li, "Learning to rank: From pairwise approach to listwise approach", in Proc. 24th Int. Conf. Mach. Learn., Corvallis, OR, Jun. 2007, pp. 129-136.
12. J. Xu and H. Li, "AdaRank: A boosting algorithm for information retrieval", in Proc. 30th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, Amsterdam, The Netherlands, Jul. 2007, pp. 391-398.
13. C. Boutilier, "A POMDP formulation of preference elicitation problems", in Proc. 18th Nat. Conf. Artif. Intell., Edmonton, AB, Canada, Jul. 2002, pp. 239-246.
14. A. Blum, J. Jackson, T. Sandholm, and M. Zinkevich, "Preference elicitation and query learning", J. Mach. Learn. Res., vol. 5, pp. 649-667, Dec. 2004.
15. M. Morita and Y. Shinoda, "Information filtering based on user behavior analysis and best match text retrieval", in Proc. 17th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, Dublin, Ireland, Jul. 1994, pp. 272-281.
16. J. S. Breese, D. Heckerman, and C. Kadie, "Empirical analysis of predictive algorithms for collaborative filtering", in Proc. 14th Conf. Uncertain. Artif. Intell., Madison, WI, Jul. 1998, pp. 43-52.
17. B. M. Sarwar, J. A. Konstan, A. Borchers, J. Herlocker, B. Miller, and J. Riedl, "Using filtering agents to improve prediction quality in the GroupLens research collaborative filtering system", in Proc. ACM Conf. Comp. Supp. Cooperat. Work, Seattle, WA, Nov. 1998, pp. 345-354.
18. J. Fürnkranz and E. Hüllermeier, Preference Learning, 1st ed. Berlin, Germany: Springer-Verlag, 2011.
19. R. Herbrich, T. Graepel, P. Bollmann-Sdorra, and K. Obermayer, "Learning a preference relation for information retrieval", in Proc. 15th AAAI Conf. Workshop Learn. Text Categ., Madison, WI, Jul. 1998, pp. 83-86.
20. G. Tesauro, "Connectionist learning of expert preferences by comparison training", in Proc. Adv. Neural Inf. Process. Syst., Denver, CO, Dec. 1988, pp. 99-106.
21. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender, "Learning to rank using gradient descent", in Proc. 22nd Int. Conf. Mach. Learn., Bonn, Germany, Aug. 2005, pp. 89-96.
22. O. Chapelle and Y. Chang, "Yahoo! learning to rank challenge overview", in Proc. JMLR Workshop, vol. 14. Haifa, Israel, Jun. 2011, pp. 1-24.
23. A. R. Barron, "Universal approximation bounds for superpositions of a sigmoidal function", IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 930-945, May 1993.
24. K. Funahashi, "On the approximate realization of continuous mappings by neural networks", Neural Netw., vol. 2, no. 3, pp. 183-192, May 1989.
25. G. Cybenko, "Approximation by superpositions of a sigmoidal function", Math. Control. Sign. Syst., vol. 2, no. 4, pp. 303-314, Dec. 1989.
26. F. Scarselli and A. C. Tsoi, "Universal approximation using feedforward neural networks: A survey of some existing methods, and some new results", Neural Netw., vol. 11, no. 1, pp. 15-37, Jan. 1998.
27. Y. Freund and R. E. Schapire, "A decision-theoretic generalization of on-line learning and an application to boosting", J. Comput. Syst. Sci., vol. 55, no. 1, pp. 119-139, Aug. 1997.
28. R. E. Schapire, "The boosting approach to machine learning: An overview", in Nonlinear Estimation and Classification (Lecture Notes in Statistics), vol. 171, D. Denison, M. Hansen, C. Holmes, B. Mallick, and B. Yu, Eds. New York: Springer-Verlag, 2003, pp. 149-172.
29. S. Rosset, J. Zhu, and T. Hastie, "Boosting as a regularized path to a maximum margin classifier", J. Mach. Learn. Res., vol. 5, no. 5, pp. 941-973, Dec. 2004.
30. J. Fürnkranz, "Integrative windowing", J. Artif. Intell. Res., vol. 8, pp. 129-164, May 1998.
31. R. Herbrich, T. Graepel, and K. Obermayer, "Support vector learning for ordinal regression", in Proc. 9th Int. Conf. Artif. Neural Netw., vol. 1. Edinburgh, U. K., Sep. 1999, pp. 97-102.
32. W. Hersh, C. Buckley, T. J. Leone, and D. Hickam, "OHSUMED: An interactive retrieval evaluation and new large test collection for research", in Proc. 17th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, Dublin, Ireland, Jul. 1994, pp. 192-201.
33. L. Rigutini, T. Papini, M. Maggini, and M. Bianchini, "A neural network approach for learning object ranking", in Proc. 18th Int. Conf. Artif. Neural Netw., Prague, Czech Republic, Sep. 2008, pp. 899-908.