메뉴 건너뛰기




Volumn , Issue PART 2, 2013, Pages 1146-1154

Efficient ranking from pairwise comparisons

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS;

EID: 84897495774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (83)

References (26)
  • 2
    • 84880083510 scopus 로고    scopus 로고
    • The infinite push: A new support vector ranking algorithm that directly optimizes accuracy at the absolute top of the list
    • Agarwal, S. The infinite push: A new support vector ranking algorithm that directly optimizes accuracy at the absolute top of the list. In Proceedings of the SIAM International Conference on Data Mining, 2011.
    • Proceedings of the SIAM International Conference on Data Mining, 2011
    • Agarwal, S.1
  • 3
    • 84857615668 scopus 로고    scopus 로고
    • An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity
    • Ailon, N. An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity. Journal of Machine Learning Research, 13:137-164, 2012.
    • (2012) Journal of Machine Learning Research , vol.13 , pp. 137-164
    • Ailon, N.1
  • 4
    • 84897544221 scopus 로고    scopus 로고
    • A new active learning scheme with applications to learning to rank from pairwise preferences
    • arXiv abs/1110.2136
    • Ailon, N., Begleiter, R., and Ezra, E. A new active learning scheme with applications to learning to rank from pairwise preferences. arXiv CoRR, abs/1110.2136, 2011.
    • (2011) CoRR
    • Ailon, N.1    Begleiter, R.2    Ezra, E.3
  • 7
    • 84897505764 scopus 로고    scopus 로고
    • Sorting from noisy information
    • arXiv abs/0910.1191
    • Braverman, M. and Mossel, E. Sorting from noisy information. arXiv CoRR, abs/0910.1191, 2009.
    • (2009) CoRR
    • Braverman, M.1    Mossel, E.2
  • 8
    • 80052866161 scopus 로고    scopus 로고
    • Incremental and decremental support vector machine learning
    • Leen, T.K., Dietterich, T.G., and Tresp, V. (eds.), MIT Press
    • Cauwenberghs, G. and Poggio, T. Incremental and decremental support vector machine learning. In Leen, T.K., Dietterich, T.G., and Tresp, V. (eds.), Advances in Neural Information Processing Systems 13 (NIPS), pp. 409-415. MIT Press, 2000.
    • (2000) Advances in Neural Information Processing Systems 13 (NIPS) , pp. 409-415
    • Cauwenberghs, G.1    Poggio, T.2
  • 9
    • 77954412721 scopus 로고    scopus 로고
    • Ordering by weighted number of wins gives a good ranking for weighted tournaments
    • Coppersmith, D., Fleischer, L., and Rudra, A. Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Transactions on Algorithms, 6(3):55:1-55:13, 2010.
    • (2010) ACM Transactions on Algorithms , vol.6 , Issue.3
    • Coppersmith, D.1    Fleischer, L.2    Rudra, A.3
  • 14
    • 9144230885 scopus 로고    scopus 로고
    • Stein's method, Jack measure, and the Metropolis algorithm
    • DOI 10.1016/j.jcta.2004.07.003, PII S0097316504001104
    • Fulman, J. Stein's method, Jack measure, and the Metropolis algorithm. Journal of Combinatorial Theory. Senes A, 108(2):275-296, 2004. (Pubitemid 39546532)
    • (2004) Journal of Combinatorial Theory. Series A , vol.108 , Issue.2 , pp. 275-296
    • Fulman, J.1
  • 20
    • 85162426723 scopus 로고    scopus 로고
    • Active ranking using pairwise comparisons
    • Shawe-Taylor, J., Zemel, R.S., Bartlett, P., Pereira, F.C.N., and Weinberger, K.Q. (eds.), MIT Press
    • Jamieson, K. G. and Nowak, R. Active ranking using pairwise comparisons. In Shawe-Taylor, J., Zemel, R.S., Bartlett, P., Pereira, F.C.N., and Weinberger, K.Q. (eds.), Advances in Neural Information Processing Systems 24 (NIPS), pp. 2240-2248. MIT Press, 2011.
    • (2011) Advances in Neural Information Processing Systems 24 (NIPS) , pp. 2240-2248
    • Jamieson, K.G.1    Nowak, R.2
  • 21
    • 1842637192 scopus 로고    scopus 로고
    • Cumulated gain-based evaluation of IR techniques
    • DOI 10.1145/582415.582418
    • Järvelin, K. and Kekäläinen, J. Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems, 20(4):422-446, 2002. (Pubitemid 44642296)
    • (2002) ACM Transactions on Information Systems , vol.20 , Issue.4 , pp. 422-446
    • Jarvelin, K.1    Kekalainen, J.2
  • 24
    • 84877777099 scopus 로고    scopus 로고
    • Iterative ranking from pair-wise comparisons
    • Bartlett, P., Pereira, F., Burges, C., Bottou, L., and Weinberger, K. Q. (eds.), MIT Press
    • Negahban, S., Oh, S., and Shah, D. Iterative ranking from pair-wise comparisons. In Bartlett, P., Pereira, F., Burges, C., Bottou, L., and Weinberger, K. Q. (eds.), Advances in Neural Information Processing Systems 25 (NIPS), pp. 2483-2491. MIT Press, 2012.
    • (2012) Advances in Neural Information Processing Systems 25 (NIPS) , pp. 2483-2491
    • Negahban, S.1    Oh, S.2    Shah, D.3
  • 25
    • 79952387636 scopus 로고    scopus 로고
    • Ranking from pairs and triplets: Information quality, evaluation methods and query complexity
    • King, I., Nejdl, W., and Li, H. (eds.), ACM
    • Radinsky, K. and Ailon, N. Ranking from pairs and triplets: Information quality, evaluation methods and query complexity. In King, I., Nejdl, W., and Li, H. (eds.), Fourth ACM International Conference on Web Search and Data Mining (WSDM), pp. 105-114. ACM, 2011.
    • (2011) Fourth ACM International Conference on Web Search and Data Mining (WSDM) , pp. 105-114
    • Radinsky, K.1    Ailon, N.2
  • 26
    • 70450239631 scopus 로고    scopus 로고
    • The p-norm push: A simple convex ranking algorithm that concentrates at the top of the list
    • Rudin, C. The p-norm push: A simple convex ranking algorithm that concentrates at the top of the list. Journal of Machine Learning Research, 10: 2233-2271, 2009.
    • (2009) Journal of Machine Learning Research , vol.10 , pp. 2233-2271
    • Rudin, C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.