-
1
-
-
80053390629
-
A short introduction to learning to rank
-
L. Hang, "A short introduction to learning to rank," IEICE TRANSACTIONS on Information and Systems, vol. 94, no. 10, pp. 1854-1862, 2011.
-
(2011)
IEICE TRANSACTIONS on Information and Systems
, vol.94
, Issue.10
, pp. 1854-1862
-
-
Hang, L.1
-
2
-
-
85156208493
-
Ranking with large margin principle: Two approaches
-
A. Shashua and A. Levin, "Ranking with large margin principle: Two approaches," in NIPS, 2002, pp. 937-944.
-
(2002)
NIPS
, pp. 937-944
-
-
Shashua, A.1
Levin, A.2
-
3
-
-
1942515261
-
Pranking with ranking
-
K. Crammer and Y. Singer, "Pranking with ranking," in NIPS, 2001, pp. 641-647.
-
(2001)
NIPS
, pp. 641-647
-
-
Crammer, K.1
Singer, Y.2
-
4
-
-
33746084489
-
Subset ranking using regression
-
D. Cossock and T. Zhang, "Subset ranking using regression," in COLT, 2006, pp. 605-619.
-
(2006)
COLT
, pp. 605-619
-
-
Cossock, D.1
Zhang, T.2
-
5
-
-
36448953520
-
A regression framework for learning ranking functions using relative relevance judgments
-
ser. SIGIR '07. New York, NY, USA: ACM
-
Z. Zheng, K. Chen, G. Sun, and H. Zha, "A regression framework for learning ranking functions using relative relevance judgments," in Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, ser. SIGIR '07. New York, NY, USA: ACM, 2007, pp. 287-294.
-
(2007)
Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
, pp. 287-294
-
-
Zheng, Z.1
Chen, K.2
Sun, G.3
Zha, H.4
-
6
-
-
31844446958
-
Learning to rank using gradient descent
-
C. J. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. N. Hullender, "Learning to rank using gradient descent," in ICML, 2005, pp. 89-96.
-
(2005)
ICML
, pp. 89-96
-
-
Burges, C.J.C.1
Shaked, T.2
Renshaw, E.3
Lazier, A.4
Deeds, M.5
Hamilton, N.6
Hullender, G.N.7
-
7
-
-
84856670612
-
Relative attributes
-
D. Parikh and K. Grauman, "Relative attributes," in ICCV, 2011, pp. 503-510.
-
(2011)
ICCV
, pp. 503-510
-
-
Parikh, D.1
Grauman, K.2
-
8
-
-
34547987951
-
Learning to rank: From pairwise approach to listwise approach
-
ser. ICML '07. New York, NY, USA: ACM
-
Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, and H. Li, "Learning to rank: from pairwise approach to listwise approach," in Proceedings of the 24th international conference on Machine learning, ser. ICML '07. New York, NY, USA: ACM, 2007, pp. 129-136.
-
(2007)
Proceedings of the 24th International Conference on Machine Learning
, pp. 129-136
-
-
Cao, Z.1
Qin, T.2
Liu, T.-Y.3
Tsai, M.-F.4
Li, H.5
-
9
-
-
36448954244
-
Adarank: A boosting algorithm for information retrieval
-
New York, NY, USA: ACM
-
J. Xu and H. Li, "Adarank: a boosting algorithm for information retrieval," in SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval. New York, NY, USA: ACM, 2007, pp. 391-398.
-
(2007)
SIGIR '07: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
, pp. 391-398
-
-
Xu, J.1
Li, H.2
-
10
-
-
36448983903
-
A support vector method for optimizing average precision
-
Y. Yue, T. Finley, F. Radlinski, and T. Joachims, "A support vector method for optimizing average precision," in ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), 2007, pp. 271-278.
-
(2007)
ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR)
, pp. 271-278
-
-
Yue, Y.1
Finley, T.2
Radlinski, F.3
Joachims, T.4
-
11
-
-
0242456822
-
Optimizing search engines using clickthrough data
-
ser. KDD '02. New York, NY, USA: ACM, [Online]
-
T. Joachims, "Optimizing search engines using clickthrough data," in Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, ser. KDD '02. New York, NY, USA: ACM, 2002, pp. 133-142. [Online]. Available: http://doi.acm.org/10.1145/775047.775067
-
(2002)
Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, pp. 133-142
-
-
Joachims, T.1
-
12
-
-
77956039703
-
Active learning for ranking through expected loss optimization
-
ser. SIGIR '10. New York, NY, USA: ACM, [Online]
-
B. Long, O. Chapelle, Y. Zhang, Y. Chang, Z. Zheng, and B. Tseng, "Active learning for ranking through expected loss optimization," in Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval, ser. SIGIR '10. New York, NY, USA: ACM, 2010, pp. 267-274. [Online]. Available: http://doi.acm.org/10.1145/1835449. 1835495
-
(2010)
Proceedings of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval
, pp. 267-274
-
-
Long, B.1
Chapelle, O.2
Zhang, Y.3
Chang, Y.4
Zheng, Z.5
Tseng, B.6
-
13
-
-
68949137209
-
-
University of Wisconsin-Madison, Computer Sciences Technical Report 1648
-
B. Settles, "Active learning literature survey," University of Wisconsin-Madison, Computer Sciences Technical Report 1648, 2009.
-
(2009)
Active Learning Literature Survey
-
-
Settles, B.1
-
15
-
-
72449174792
-
Document selection methodologies for efficient and effective learning-to-rank
-
ser. SIGIR '09
-
J. A. Aslam, E. Kanoulas, V. Pavlu, S. Savev, and E. Yilmaz, "Document selection methodologies for efficient and effective learning-to-rank," in Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, ser. SIGIR '09, 2009, pp. 468-475.
-
(2009)
Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval
, pp. 468-475
-
-
Aslam, J.A.1
Kanoulas, E.2
Pavlu, V.3
Savev, S.4
Yilmaz, E.5
-
16
-
-
0031644241
-
Approximate nearest neighbors: Towards removing the curse of dimensionality
-
P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," in Proc. of 30th ACM Symposium on Theory of Computing, 1998, pp. 604-613.
-
(1998)
Proc. of 30th ACM Symposium on Theory of Computing
, pp. 604-613
-
-
Indyk, P.1
Motwani, R.2
-
17
-
-
4544259509
-
Locality-sensitive hashing scheme based on p-stable distributions
-
M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni, "Locality- sensitive hashing scheme based on p-stable distributions," in Proceedings of the twentieth annual Symposium on Computational Geometry, 2004, pp. 253-262.
-
(2004)
Proceedings of the Twentieth Annual Symposium on Computational Geometry
, pp. 253-262
-
-
Datar, M.1
Immorlica, N.2
Indyk, P.3
Mirrokni, V.4
-
18
-
-
80053456121
-
Hashing with graphs
-
W. Liu, J. Wang, S. Kumar, and S.-F. Chang, "Hashing with graphs," in Proceedings of the 28th International Conference on Machine Learning, 2011, pp. 1-8.
-
(2011)
Proceedings of the 28th International Conference on Machine Learning
, pp. 1-8
-
-
Liu, W.1
Wang, J.2
Kumar, S.3
Chang, S.-F.4
-
19
-
-
84858779327
-
Spectral hashing
-
D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, Eds
-
Y. Weiss, A. Torralba, and R. Fergus, "Spectral hashing," in Proc. of Advances in Neural Information Processing Systems, D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, Eds., 2008, vol. 21, pp. 1753-1760.
-
(2008)
Proc. of Advances in Neural Information Processing Systems
, vol.21
, pp. 1753-1760
-
-
Weiss, Y.1
Torralba, A.2
Fergus, R.3
-
20
-
-
80052874105
-
Iterative quantization: A procrustean approach to learning binary codes
-
Y. Gong and S. Lazebnik, "Iterative quantization: A procrustean approach to learning binary codes," in Proc. of IEEE CVPR, 2011, pp. 817-824.
-
(2011)
Proc. of IEEE CVPR
, pp. 817-824
-
-
Gong, Y.1
Lazebnik, S.2
-
21
-
-
84858740468
-
Learning to hash with binary reconstructive embeddings
-
Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, Eds
-
B. Kulis and T. Darrell, "Learning to Hash with Binary Reconstructive Embeddings," in Proc. of Advances in Neural Information Processing Systems, Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, Eds., 2009, vol. 20, pp. 1042-1050.
-
(2009)
Proc. of Advances in Neural Information Processing Systems
, vol.20
, pp. 1042-1050
-
-
Kulis, B.1
Darrell, T.2
-
22
-
-
84866726818
-
Supervised hashing with kernels
-
Providence, Rhode Island, USA
-
W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang, "Supervised hashing with kernels," in Proc. of IEEE CVPR, Providence, Rhode Island, USA, 2012.
-
(2012)
Proc. of IEEE CVPR
-
-
Liu, W.1
Wang, J.2
Ji, R.3
Jiang, Y.-G.4
Chang, S.-F.5
-
24
-
-
84865410773
-
Semi-supervised hashing for large-scale search
-
J. Wang, S. Kumar, and S.-F. Chang, "Semi-supervised hashing for large-scale search," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 12, pp. 2393-2406, 2012.
-
(2012)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.34
, Issue.12
, pp. 2393-2406
-
-
Wang, J.1
Kumar, S.2
Chang, S.-F.3
-
25
-
-
85161990053
-
Hashing hyperplane queries to near points with applications to large-scale active learning
-
P. Jain, S. Vijayanarasimhan, and K. Grauman, "Hashing hyperplane queries to near points with applications to large-scale active learning," in Advances in Neural Information Processing Systems 23, 2010, pp. 928-936.
-
(2010)
Advances in Neural Information Processing Systems
, vol.23
, pp. 928-936
-
-
Jain, P.1
Vijayanarasimhan, S.2
Grauman, K.3
-
26
-
-
84867126950
-
Compact hyperplane hashing with bilinear functions
-
Edinburgh, Scotland
-
W. Liu, J. Wang, Y. Mu, S. Kumar, and S.-F. Chang, "Compact hyperplane hashing with bilinear functions," in Proceedings of the 28th International Conference on Machine Learning, Edinburgh, Scotland, 2012.
-
(2012)
Proceedings of the 28th International Conference on Machine Learning
-
-
Liu, W.1
Wang, J.2
Mu, Y.3
Kumar, S.4
Chang, S.-F.5
-
27
-
-
84877776686
-
Angular quantizationbased binary codes for fast similarity search
-
Y. Gong, S. Kumar, V. Verma, and S. Lazebnik, "Angular quantizationbased binary codes for fast similarity search," in Advances in Neural Information Processing Systems 25, 2012, pp. 1205-1213.
-
(2012)
Advances in Neural Information Processing Systems
, vol.25
, pp. 1205-1213
-
-
Gong, Y.1
Kumar, S.2
Verma, V.3
Lazebnik, S.4
-
29
-
-
80053436853
-
Predicting risk from financial reports with regression
-
ser. NAACL '09
-
S. Kogan, D. Levin, B. R. Routledge, J. S. Sagi, and N. A. Smith, "Predicting risk from financial reports with regression," in Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, ser. NAACL '09, 2009, pp. 272-280.
-
(2009)
Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
, pp. 272-280
-
-
Kogan, S.1
Levin, D.2
Routledge, B.R.3
Sagi, J.S.4
Smith, N.A.5
|