{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:16:57Z","timestamp":1740122217561,"version":"3.37.3"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T00:00:00Z","timestamp":1525219200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T00:00:00Z","timestamp":1525219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100005222","name":"Jyv\u00e4skyl\u00e4n Yliopisto","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005222","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval J"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10791-018-9330-5","type":"journal-article","created":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T15:42:17Z","timestamp":1525275737000},"page":"481-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Linear feature extraction for ranking"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4450-1766","authenticated-orcid":false,"given":"Gaurav","family":"Pandey","sequence":"first","affiliation":[]},{"given":"Zhaochun","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Shuaiqiang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jari","family":"Veijalainen","sequence":"additional","affiliation":[]},{"given":"Maarten","family":"de Rijke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,2]]},"reference":[{"key":"9330_CR1","volume-title":"Mathematical methods for physicists","author":"GB Arfken","year":"2013","unstructured":"Arfken, G. B. (2013). Mathematical methods for physicists. Cambridge: Academic Press."},{"key":"9330_CR2","unstructured":"Bach, F. R., & Jordan, M.I. (2005). A probabilistic interpretation of canonical correlation analysis. Technical report 688, Department of Statistics, University of California, Berkeley."},{"key":"9330_CR3","volume-title":"Modern information retrieval","author":"R Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., & Ribeiro-Neto, B. (1999). Modern information retrieval. Boston: Addison Wesley."},{"key":"9330_CR4","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D. P. (1999). Nonlinear programming. Belmont: Athena Scientific."},{"issue":"1","key":"9330_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","volume":"97","author":"AL Blum","year":"1997","unstructured":"Blum, A. L., & Langley, P. (1997). Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1), 245\u2013271.","journal-title":"Artificial Intelligence"},{"key":"9330_CR6","doi-asserted-by":"crossref","unstructured":"Burges, C. J., Ragno, R., & Le, Q. V. (2007) Learning to rank with nonsmooth cost functions. In NIPS, pp. 193\u2013200.","DOI":"10.7551\/mitpress\/7503.003.0029"},{"key":"9330_CR7","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005). Learning to rank using gradient descent. In ICML, pp. 89\u201396.","DOI":"10.1145\/1102351.1102363"},{"issue":"2\u20133","key":"9330_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10994-013-5360-9","volume":"93","author":"R Busa-Fekete","year":"2013","unstructured":"Busa-Fekete, R., K\u00e9gl, B., \u00c9ltet\u00f6, T., & Szarvas, G. (2013). Tune and mix: Learning to rank using ensembles of calibrated multi-class classifiers. Machine Learning, 93(2\u20133), 261\u2013292.","journal-title":"Machine Learning"},{"key":"9330_CR9","doi-asserted-by":"crossref","unstructured":"Cao, Y., Xu, J., Liu, T.Y., Li, H., Huang, Y., & Hon, H. W. (2006). Adapting ranking SVM to document retrieval. In SIGIR, pp. 186\u2013193.","DOI":"10.1145\/1148170.1148205"},{"key":"9330_CR10","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T. Y., Tsai, M.F., & Li, H. (2007). Learning to rank: From pairwise approach to listwise approach. In ICML, pp. 129\u2013136.","DOI":"10.1145\/1273496.1273513"},{"key":"9330_CR11","first-page":"91","volume":"14","author":"O Chapelle","year":"2011","unstructured":"Chapelle, O., Chang, Y., & Liu, T. Y. (2011). Future directions in learning to rank. Journal of Machine Learning Research, 14, 91\u2013100.","journal-title":"Journal of Machine Learning Research"},{"key":"9330_CR12","unstructured":"Chen, W., Liu, T. Y., Lan, Y., Ma, Z. M., & Li, H. (2009). Ranking measures and loss functions in learning to rank. In NIPS, pp. 315\u2013323."},{"issue":"11","key":"9330_CR13","doi-asserted-by":"publisher","first-page":"5140","DOI":"10.1109\/TIT.2008.929939","volume":"54","author":"D Cossock","year":"2008","unstructured":"Cossock, D., & Zhang, T. (2008). Statistical analysis of Bayes optimal subset ranking. IEEE Transactions on Information Theory, 54(11), 5140\u20135154.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9330_CR14","doi-asserted-by":"crossref","unstructured":"Crammer, K., & Singer, Y. (2001). Pranking with ranking. In NIPS, pp. 641\u2013647.","DOI":"10.7551\/mitpress\/1120.003.0087"},{"issue":"1","key":"9330_CR15","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4(1), 933\u2013969.","journal-title":"Journal of Machine Learning Research"},{"key":"9330_CR16","doi-asserted-by":"crossref","unstructured":"Geng, X., Liu, T., Qin, T., & Li, H. (2007). Feature selection for ranking. In SIGIR, pp. 407\u2013414.","DOI":"10.1145\/1277741.1277811"},{"key":"9330_CR17","unstructured":"Gupta, P., & Rosso, P. (2012). Expected divergence based feature selection for learning to rank. In COLING, pp. 431\u2013440."},{"issue":"12","key":"9330_CR18","doi-asserted-by":"publisher","first-page":"2639","DOI":"10.1162\/0899766042321814","volume":"16","author":"DR Hardoon","year":"2004","unstructured":"Hardoon, D. R., Szedmak, S., & Shawe-Taylor, J. (2004). Canonical correlation analysis: An overview with application to learning methods. Neural Computation, 16(12), 2639\u20132664.","journal-title":"Neural Computation"},{"issue":"4","key":"9330_CR19","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., & Kek\u00e4l\u00e4inen, J. (2002). Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems, 20(4), 422\u2013446.","journal-title":"ACM Transactions on Information Systems"},{"issue":"1","key":"9330_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10994-009-5108-8","volume":"77","author":"T Joachims","year":"2009","unstructured":"Joachims, T., Finley, T., & Yu, C. N. J. (2009). Cutting-plane training of structural SVMs. Machine Learning, 77(1), 27\u201359.","journal-title":"Machine Learning"},{"issue":"2","key":"9330_CR21","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/1328964.1328974","volume":"41","author":"T Joachims","year":"2007","unstructured":"Joachims, T., Li, H., Liu, T. Y., & Zhai, C. (2007). Learning to rank for information retrieval (LR4IR 2007). SIGIR Forum, 41(2), 58\u201362.","journal-title":"SIGIR Forum"},{"key":"9330_CR22","volume-title":"Principal component analysis","author":"I Jolliffe","year":"2002","unstructured":"Jolliffe, I. (2002). Principal component analysis. Berlin: Springer."},{"key":"9330_CR500","unstructured":"Joachims, T., Swaminathan, A., & de Rijke, M. (2018). Deep learning with logged bandit feedback. In ICLR 2018."},{"key":"9330_CR23","volume-title":"Rank correlation methods","author":"MG Kendall","year":"1948","unstructured":"Kendall, M. G. (1948). Rank correlation methods. London: C. Griffin."},{"issue":"8","key":"9330_CR24","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R., & Volinsky, C. (2009). Matrix factorization techniques for recommender systems. Computer, 42(8), 30\u201337.","journal-title":"Computer"},{"issue":"6","key":"9330_CR25","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1109\/TNNLS.2013.2247628","volume":"24","author":"H Lai","year":"2013","unstructured":"Lai, H., Pan, Y., Tang, Y., & Yu, R. (2013). FSMRank: Feature selection algorithm for learning to rank. IEEE Transactions on Neural Networks and Learning Systems, 24(6), 940\u2013952.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"9330_CR26","unstructured":"Lan, Y., Guo, J., Cheng, X., & Liu, T. Y. (2012). Statistical consistency of ranking methods in a rank-differentiable probability space. In NIPS, pp. 1232\u20131240."},{"key":"9330_CR27","doi-asserted-by":"crossref","unstructured":"Lange, K. (2010). Singular value decomposition. In Numerical analysis for statisticians (pp. 129\u2013142). Springer.","DOI":"10.1007\/978-1-4419-5945-4_9"},{"issue":"6","key":"9330_CR28","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1109\/TNNLS.2013.2286696","volume":"25","author":"L Laporte","year":"2014","unstructured":"Laporte, L., Flamary, R., Canu, S., D\u00e9jean, S., & Mothe, J. (2014). Nonconvex regularizations for feature selection in ranking with sparse SVM. IEEE Transactions on Neural Networks and Learning Systems, 25(6), 1118\u20131130.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"9330_CR29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971217","volume-title":"Solving least square problems, classics in applied mathematics","author":"C Lawson","year":"1995","unstructured":"Lawson, C., & Hanson, R. (1995). Solving least square problems, classics in applied mathematics (Vol. 15). Philadelphia: SIAM."},{"key":"9330_CR30","unstructured":"Li, P., Wu, Q., & Burges, C.J. (2007). McRank: Learning to rank using multiple classification and gradient boosting. In NIPS, pp. 897\u2013904."},{"issue":"3","key":"9330_CR31","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"TY Liu","year":"2009","unstructured":"Liu, T. Y. (2009). Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3(3), 225\u2013331.","journal-title":"Foundations and Trends in Information Retrieval"},{"key":"9330_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14267-3","volume-title":"Learning to rank for information retrieval","author":"TY Liu","year":"2011","unstructured":"Liu, T. Y. (2011). Learning to rank for information retrieval. Berlin: Springer."},{"key":"9330_CR33","doi-asserted-by":"crossref","unstructured":"Metzler, D.A. (2007). Automatic feature selection in the markov random field model for information retrieval. In CIKM, ACM, pp. 253\u2013262.","DOI":"10.1145\/1321440.1321478"},{"key":"9330_CR34","first-page":"67","volume":"5","author":"H Motoda","year":"2002","unstructured":"Motoda, H., & Liu, H. (2002). Feature selection, extraction and construction. Communication of IICM (Institute of Information and Computing Machinery, Taiwan), 5, 67\u201372.","journal-title":"Communication of IICM (Institute of Information and Computing Machinery, Taiwan)"},{"key":"9330_CR35","unstructured":"Mukuta, Y., & Harada, T. (2014). Probabilistic partial canonical correlation analysis. In ICML, pp. 1449\u20131457."},{"key":"9330_CR36","doi-asserted-by":"crossref","unstructured":"Naini, K. D., & Alting\u00f6vde, I. S. (2014). Exploiting result diversification methods for feature selection in learning to rank. In ECIR, Springer, pp. 455\u2013461.","DOI":"10.1007\/978-3-319-06028-6_41"},{"key":"9330_CR37","doi-asserted-by":"crossref","unstructured":"Ng, A. Y. (2004). Feature selection, L1 vs. L2 regularization, and rotational invariance. In ICML, pp. 78\u201382.","DOI":"10.1145\/1015330.1015435"},{"key":"9330_CR38","doi-asserted-by":"crossref","unstructured":"Niu, S., Guo, J., Lan, Y., & Cheng, X. (2012). Top-K learning to rank: Labeling, ranking and evaluation. In SIGIR, pp. 751\u2013760.","DOI":"10.1145\/2348283.2348384"},{"key":"9330_CR39","doi-asserted-by":"crossref","unstructured":"Pan, F., Converse, T., Ahn, D., Salvetti, F., & Donato, G. (2009). Feature selection for ranking using boosted trees. In CIKM (pp. 2025\u20132028). ACM.","DOI":"10.1145\/1645953.1646292"},{"key":"9330_CR40","unstructured":"Platt, J. C., & Barr, A. H. (1988). Constrained differential optimization for neural networks. Technical report TR-88-17, Department of Computer Science, California Institute of Technology."},{"key":"9330_CR41","unstructured":"Qin, T., & Liu, T. Y. (2013). Introducing LETOR 4.0 datasets. arXiv:1306.2597."},{"issue":"4","key":"9330_CR42","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/s10791-009-9123-y","volume":"13","author":"T Qin","year":"2010","unstructured":"Qin, T., Liu, T. Y., Xu, J., & Li, H. (2010). LETOR: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval, 13(4), 346\u2013374.","journal-title":"Information Retrieval"},{"key":"9330_CR43","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"ST Roweis","year":"2000","unstructured":"Roweis, S. T., & Saul, L. K. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290, 2323\u20132326.","journal-title":"Science"},{"issue":"5","key":"9330_CR44","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B Sch\u00f6lkopf","year":"1998","unstructured":"Sch\u00f6lkopf, B., Smola, A., & M\u00fcller, K. R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5), 1299\u20131319.","journal-title":"Neural Computation"},{"key":"9330_CR45","doi-asserted-by":"crossref","unstructured":"Schuth, A., Oosterhuis, H., Whiteson, S., & de\u00a0Rijke, M. (2016). Multileave gradient descent for fast online learning to rank. In WSDM 2016: The 9th international conference on web search and data mining (pp. 457\u2013466). ACM.","DOI":"10.1145\/2835776.2835804"},{"key":"9330_CR46","doi-asserted-by":"crossref","unstructured":"Severyn, A., & Moschitti, A. (2015). Learning to rank short text pairs with convolutional deep neural networks. In SIGIR (pp 373\u2013382). ACM.","DOI":"10.1145\/2766462.2767738"},{"key":"9330_CR47","unstructured":"Shalit, U., & Chechik, G. (2014). Coordinate-descent for learning orthogonal matrices through Givens rotations. In ICML, pp. 548\u2013556."},{"key":"9330_CR48","unstructured":"Shivanna, R., & Bhattacharyya, C. (2014). Learning on graphs using orthonormal representation is statistically consistent. In NIPS, pp. 3635\u20133643."},{"issue":"5500","key":"9330_CR49","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum, J. B., de Silva, V., & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2319\u20132323.","journal-title":"Science"},{"issue":"3","key":"9330_CR50","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1111\/1467-9868.00196","volume":"61","author":"ME Tipping","year":"1999","unstructured":"Tipping, M. E., & Bishop, C. M. (1999). Probabilistic principal component analysis. Journal of the Royal Statistical Society, Series B, 61(3), 611\u2013622.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"9330_CR51","doi-asserted-by":"crossref","unstructured":"Tsai, M. F., Liu, T. Y., Qin, T., Chen, H. H., & Ma, W. Y. (2007). FRank: A ranking method with fidelity loss. In SIGIR (pp. 383\u2013390). ACM.","DOI":"10.1145\/1277741.1277808"},{"key":"9330_CR52","unstructured":"Valizadegan, H., Jin, R., Zhang, R., & Mao, J. (2009). Learning to rank by optimizing NDCG measure. In NIPS, pp. 1883\u20131891."},{"key":"9330_CR53","doi-asserted-by":"crossref","unstructured":"Volkovs, M., & Zemel, R. S. (2009). Boltzrank: Learning to maximize expected ranking gain. In ICML, pp. 1089\u20131096.","DOI":"10.1145\/1553374.1553513"},{"issue":"12","key":"9330_CR54","doi-asserted-by":"publisher","first-page":"3152","DOI":"10.1109\/TKDE.2015.2453952","volume":"27","author":"S Wang","year":"2015","unstructured":"Wang, S., Wu, Y., Gao, B. J., Wang, K., Lauw, H. W., & Ma, J. (2015). A cooperative coevolution framework for parallel learning to rank. IEEE Transactions on Knowledge and Data Engineering, 27(12), 3152\u20133165.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9330_CR55","unstructured":"Weston, J., Mukherjee, S., Chapelle, O., Pontil, M., Poggio, T., & Vapnik, V. (2000). Feature selection for SVMs. In NIPS, pp. 668\u2013674."},{"key":"9330_CR56","doi-asserted-by":"crossref","unstructured":"Wolf, L., & Bileschi, S. (2005). Combining variable selection with dimensionality reduction. In CVPR, pp. 801\u2013806.","DOI":"10.21236\/ADA454990"},{"key":"9330_CR57","unstructured":"Wyse, N., Dubes, R., & Jain, A. (1980). A critical evaluation of intrinsic dimensionality algorithms. In Gelsema, E., & Kanal, L. (Eds.) Pattern recognition in practice. Proceedings of workshop Amsterdam, May 1980, North-Holland, pp. 415\u2013425."},{"key":"9330_CR58","doi-asserted-by":"crossref","unstructured":"Xu, J., & Li, H. (2007). AdaRank: A boosting algorithm for information retrieval. In SIGIR (pp. 391\u2013398). ACM.","DOI":"10.1145\/1277741.1277809"},{"key":"9330_CR59","doi-asserted-by":"crossref","unstructured":"Yu, H., Oh, J., & Han, W. (2009). Efficient feature weighting methods for ranking. In CIKM (pp 1157\u20131166). ACM.","DOI":"10.1145\/1645953.1646100"},{"key":"9330_CR60","doi-asserted-by":"crossref","unstructured":"Yue, Y., Finley, T., Radlinski, F., & Joachims, T. (2007). A support vector method for optimizing average precision. In SIGIR (pp. 271\u2013278). ACM.","DOI":"10.1145\/1277741.1277790"}],"container-title":["Information Retrieval Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-018-9330-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-018-9330-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-018-9330-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:41:17Z","timestamp":1704206477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-018-9330-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,2]]},"references-count":61,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["9330"],"URL":"https:\/\/doi.org\/10.1007\/s10791-018-9330-5","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"type":"print","value":"1386-4564"},{"type":"electronic","value":"1573-7659"}],"subject":[],"published":{"date-parts":[[2018,5,2]]},"assertion":[{"value":"6 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}