{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:43:12Z","timestamp":1767339792202,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319210230"},{"type":"electronic","value":"9783319210247"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21024-7_26","type":"book-chapter","created":{"date-parts":[[2015,6,30]],"date-time":"2015-06-30T13:17:17Z","timestamp":1435670237000},"page":"382-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Bayesian Approach to Sparse Learning-to-Rank for Search Engine Optimization"],"prefix":"10.1007","author":[{"given":"Olga","family":"Krasotkina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vadim","family":"Mottl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,1]]},"reference":[{"key":"26_CR1","volume-title":"Learning to Rank for Information Retrieval","author":"TY Liu","year":"2009","unstructured":"Liu, T.Y.: Learning to Rank for Information Retrieval. Now Publishers, Breda (2009)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hulldender, G.: Learning to rank using gradient descent. In: Proceedings of International Conference on Machine Learning (2005)","DOI":"10.1145\/1102351.1102363"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD). ACM (2002)","DOI":"10.1145\/775047.775067"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Zha, H., Chen, K., Sun, G.: A regression framework for learning ranking functions using relative relevance judgments. In: Proceedings of Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2007)","DOI":"10.1145\/1277741.1277792"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: ICML 2007: Proceedings of the 24th International Conference on Machine Learning, pp. 129\u2013136. ACM, New York (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"26_CR6","volume-title":"Advances in Neural Information Processing Systems 20","author":"M Weimer","year":"2008","unstructured":"Weimer, M., Karatzoglou, A., Le, Q., Smola, A.: Cofi rank - maximum margin matrix factorization for collaborative ranking. In: Platt, J., Koller, D., Singer, Y., Roweis, S. (eds.) Advances in Neural Information Processing Systems 20. MIT Press, Cambridge (2008)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Taylor, M., Guiver, J., Robertson, S., Minka, T.: SoftRank: optimising non-smooth rank metrics. In: Proceedings of International ACM Conference on Web Search and Data Mining (2008)","DOI":"10.1145\/1341531.1341544"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Xia, F., Liu, T.Y., Wang, J., Zhang, W., Li, H.: Listwise approach to learning to rank - theory and algorithm. In: International Conference on Machine Learning (ICML) (2008)","DOI":"10.1145\/1390156.1390306"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Hua, G., Zhang, M., Liu, Y., Ma, S., Ru, L.: Hierarchical feature selection for ranking. In: Proceedings of 19th International Conference on World Wide Web, pp. 1113\u20131114 (2010)","DOI":"10.1145\/1772690.1772830"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Yu, H., Oh, J., Han, W.-S.: Efficient feature weighting methods for ranking. In: Proceedings of 18th ACM Conference on Information and Knowledge Management, pp. 1157\u20131166 (2009)","DOI":"10.1145\/1645953.1646100"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Pan, F., Converse, T., Ahn, D., Salvetti, F., Donato, G.: Feature selection for ranking using boosted trees. In: Proceedings of 18th ACM Conference on Information and Knowledge Management, pp. 2025\u20132028 (2009)","DOI":"10.1145\/1645953.1646292"},{"key":"26_CR12","unstructured":"Dang, V., Croft, B.: Feature selection for document ranking using best first search and coordinate ascent. In: SIGIR Workshop on Feature Generation and Selection for Information Retrieval (2010)"},{"key":"26_CR13","unstructured":"Pahikkala, T., Airola, A., Naula, P., Salakoski, T.: Greedy RankRLS: a linear time algorithm for learning sparse ranking models. In: SIGIR 2010 Workshop on Feature Generation and Selection for Information Retrieval, pp. 11\u201318 (2010)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Sun, Z., Qin, T., Tao, Q., Wang, J.: Robust sparse rank learning for non-smooth ranking measures. In: Proceedings of 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 259\u2013266 (2009)","DOI":"10.1145\/1571941.1571987"},{"issue":"PrePrints","key":"26_CR15","first-page":"1221","volume":"99","author":"H Lai","year":"2012","unstructured":"Lai, H., Pan, Y., Liu, C., Lin, L., Wu, J.: Sparse learning-to-rank via an efficient primal-dual algorithm. IEEE Trans. Comput. 99(PrePrints), 1221\u20131233 (2012)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"26_CR16","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1109\/TNNLS.2013.2247628","volume":"24","author":"H-J Lai","year":"2013","unstructured":"Lai, H.-J., Pan, Y., Tang, Y., Yu, R.: Fsmrank: feature selection algorithm for learning to rank. IEEE Trans. Neural Netw. Learn. Syst. 24(6), 940\u2013952 (2013)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"476","key":"26_CR17","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1198\/016214506000000735","volume":"101","author":"H Zou","year":"2006","unstructured":"Zou, H.: The adaptive lasso and its oracle properties. J. Amer. Stat. Assoc. 101(476), 1418\u20131429 (2006)","journal-title":"J. Amer. Stat. Assoc."},{"key":"26_CR18","unstructured":"Mothe, J.: Non-convex regularizations for feature selection in ranking with sparse SVM. X(X): 1"},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang, C.-H.: Nearly unbiaised variable selection under minimax con-cave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"1","key":"26_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.jeconom.2007.05.017","volume":"142","author":"H Leeb","year":"2008","unstructured":"Leeb, H., P\u00f6tscher, B.M.: Sparse estimators and the oracle property, or the return of Hodges\u2019 estimator. J. Econometrics 142(1), 201\u2013211 (2008)","journal-title":"J. Econometrics"},{"key":"26_CR21","volume-title":"Advances in Kernel Methods - Support Vector Learning","author":"J Platt","year":"1998","unstructured":"Platt, J.: Fast training of support vector machines using sequential minimal optimization. In: Scholkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel Methods - Support Vector Learning. MIT Press, Cambridge (1998)"},{"issue":"3","key":"26_CR22","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10791-009-9109-9","volume":"13","author":"O Chapelle","year":"2010","unstructured":"Chapelle, O., Keerthi, S.S.: Efficient algorithms for ranking with SVMs. Inf. Retrieval J. 13(3), 201\u2013215 (2010)","journal-title":"Inf. Retrieval J."},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Moon, T., Smola, A.J., Chang, Y., Zheng, Z.: IntervalRank: isotonic regression with listwise and pairwise constraints. In: WSDM 2010, pp. 151\u2013160","DOI":"10.1145\/1718487.1718507"},{"key":"26_CR24","unstructured":"http:\/\/research.microsoft.com\/en-us\/um\/beijing\/projects\/letor\/"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21024-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:30:01Z","timestamp":1674228601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21024-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319210230","9783319210247"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21024-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}