메뉴 건너뛰기




Volumn , Issue , 2011, Pages 815-824

Post-ranking query suggestion by diversifying search results

Author keywords

Learning to rank; Post ranking re ordering; Query suggestion; Random walk

Indexed keywords

RANDOM PROCESSES;

EID: 80052128552     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2009916.2010025     Document Type: Conference Paper
Times cited : (50)

References (25)
  • 4
    • 72449184156 scopus 로고    scopus 로고
    • Refined experts: Improving classification in large taxonomies
    • New York, NY, USA ACM
    • P. N. Bennett and N. Nguyen. Refined experts: improving classification in large taxonomies. In SIGIR '09, pages 11-18, New York, NY, USA, 2009. ACM.
    • (2009) SIGIR '09 , pp. 11-18
    • Bennett, P.N.1    Nguyen, N.2
  • 5
    • 0032270694 scopus 로고    scopus 로고
    • The use of mmr, diversity-based reranking for reordering documents and producing summaries
    • New York, NY, USA ACM
    • J. Carbonell and J. Goldstein. The use of mmr, diversity-based reranking for reordering documents and producing summaries. In Proceedings of SIGIR '98, pages 335-336, New York, NY, USA, 1998. ACM.
    • (1998) Proceedings of SIGIR '98 , pp. 335-336
    • Carbonell, J.1    Goldstein, J.2
  • 8
    • 72449122369 scopus 로고    scopus 로고
    • Entropy-biased models for query representation on the click graph
    • New York, NY, USA ACM
    • H. Deng, I. King, and M. R. Lyu. Entropy-biased models for query representation on the click graph. In SIGIR '09, pages 339-346, New York, NY, USA, 2009. ACM.
    • (2009) SIGIR '09 , pp. 339-346
    • Deng, H.1    King, I.2    Lyu, M.R.3
  • 9
    • 0035470889 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • J. H. Friedman. Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29:1189-1232, 2000. (Pubitemid 33405972)
    • (2001) Annals of Statistics , vol.29 , Issue.5 , pp. 1189-1232
    • Friedman, J.H.1
  • 10
    • 1842637192 scopus 로고    scopus 로고
    • Cumulated gain-based evaluation of IR techniques
    • DOI 10.1145/582415.582418
    • K. Järvelin and J. Kekäläinen. Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst., 20:422-446, October 2002. (Pubitemid 44642296)
    • (2002) ACM Transactions on Information Systems , vol.20 , Issue.4 , pp. 422-446
    • Jarvelin, K.1    Kekalainen, J.2
  • 11
    • 84885665252 scopus 로고    scopus 로고
    • Accurately interpreting clickthrough data as implicit feedback
    • New York, NY, USA ACM
    • T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay. Accurately interpreting clickthrough data as implicit feedback. In SIGIR '05, pages 154-161, New York, NY, USA, 2005. ACM.
    • (2005) SIGIR '05 , pp. 154-161
    • Joachims, T.1    Granka, L.2    Pan, B.3    Hembrooke, H.4    Gay, G.5
  • 12
    • 0002282074 scopus 로고
    • A new measure of rank correlation
    • June
    • M. G. Kendall. A New Measure of Rank Correlation. Biometrika, 30(1/2):81-93, June 1938.
    • (1938) Biometrika , vol.30 , Issue.1-2 , pp. 81-93
    • Kendall, M.G.1
  • 13
    • 57649092193 scopus 로고    scopus 로고
    • Mcrank: Learning to rank using multiple classification and gradient boosting
    • J. C. Platt, D. Koller, Y. Singer, and S. T. Roweis, editors MIT Press
    • P. Li, C. J. C. Burges, and Q. Wu. Mcrank: Learning to rank using multiple classification and gradient boosting. In J. C. Platt, D. Koller, Y. Singer, and S. T. Roweis, editors, NIPS. MIT Press, 2007.
    • (2007) NIPS
    • Li, P.1    Burges, C.J.C.2    Wu, Q.3
  • 14
    • 69249119464 scopus 로고    scopus 로고
    • Learning to rank for information retrieval
    • March
    • T.-Y. Liu. Learning to rank for information retrieval. Found. Trends Inf. Retr., 3:225-331, March 2009.
    • (2009) Found. Trends Inf. Retr. , vol.3 , pp. 225-331
    • Liu, T.-Y.1
  • 15
    • 85167435647 scopus 로고    scopus 로고
    • Diversifying query suggestion results
    • H. Ma, M. R. Lyu, and I. King. Diversifying query suggestion results. In AAAI, 2010.
    • (2010) AAAI
    • Ma, H.1    Lyu, M.R.2    King, I.3
  • 16
    • 67650067661 scopus 로고    scopus 로고
    • Learning latent semantic relations from clickthrough data for query suggestion
    • New York, NY, USA ACM
    • H. Ma, H. Yang, I. King, and M. R. Lyu. Learning latent semantic relations from clickthrough data for query suggestion. In CIKM '08, pages 709-718, New York, NY, USA, 2008. ACM.
    • (2008) CIKM '08 , pp. 709-718
    • Ma, H.1    Yang, H.2    King, I.3    Lyu, M.R.4
  • 17
    • 67650083602 scopus 로고    scopus 로고
    • Query suggestion using hitting time
    • New York, NY, USA ACM
    • Q. Mei, D. Zhou, and K. Church. Query suggestion using hitting time. In CIKM '08, pages 469-478, New York, NY, USA, 2008. ACM.
    • (2008) CIKM '08 , pp. 469-478
    • Mei, Q.1    Zhou, D.2    Church, K.3
  • 18
    • 0001454867 scopus 로고
    • On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling
    • K. Pearson. On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling. Philosophical Magazine, 302:157-175, 1900.
    • (1900) Philosophical Magazine , vol.302 , pp. 157-175
    • Pearson, K.1
  • 19
    • 77954585773 scopus 로고    scopus 로고
    • Optimal rare query suggestion with implicit user feedback
    • New York, NY, USA ACM
    • Y. Song and L. He. Optimal rare query suggestion with implicit user feedback. In WWW '10, pages 901-910, New York, NY, USA, 2010. ACM.
    • (2010) WWW '10 , pp. 901-910
    • Song, Y.1    He, L.2
  • 20
    • 41149096059 scopus 로고    scopus 로고
    • Random walk with restart: Fast solutions and applications
    • March
    • H. Tong, C. Faloutsos, and J.-Y. Pan. Random walk with restart: fast solutions and applications. Knowl. Inf. Syst., 14:327-346, March 2008.
    • (2008) Knowl. Inf. Syst. , vol.14 , pp. 327-346
    • Tong, H.1    Faloutsos, C.2    Pan, J.-Y.3
  • 22
    • 57349104886 scopus 로고    scopus 로고
    • Improve retrieval accuracy for difficult queries using negative feedback
    • New York, NY, USA ACM
    • X. Wang, H. Fang, and C. Zhai. Improve retrieval accuracy for difficult queries using negative feedback. In CIKM '07, pages 991-994, New York, NY, USA, 2007. ACM.
    • (2007) CIKM '07 , pp. 991-994
    • Wang, X.1    Fang, H.2    Zhai, C.3
  • 23
    • 77953628309 scopus 로고    scopus 로고
    • Adapting boosting for information retrieval measures
    • June
    • Q. Wu, C. J. Burges, K. M. Svore, and J. Gao. Adapting boosting for information retrieval measures. Inf. Retr., 13:254-270, June 2010.
    • (2010) Inf. Retr. , vol.13 , pp. 254-270
    • Wu, Q.1    Burges, C.J.2    Svore, K.M.3    Gao, J.4
  • 25
    • 23644435310 scopus 로고    scopus 로고
    • A risk minimization framework for information retrieval
    • DOI 10.1016/j.ipm.2004.11.003, PII S0306457304001530
    • C. Zhai and J. Lafferty. A risk minimization framework for information retrieval. Inf. Process. Manage., 42:31-55, January 2006. (Pubitemid 41130281)
    • (2006) Information Processing and Management , vol.42 , Issue.SPEC. ISS 1 , pp. 31-55
    • Zhai, C.1    Lafferty, J.2


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