메뉴 건너뛰기




Volumn , Issue , 2012, Pages 353-362

Query suggestion by constructing term-transition graphs

Author keywords

Learning to rank; Page rank; Query suggestion

Indexed keywords

GRAPH-BASED; INFORMATION NEED; INTERACTIVE APPROACH; LARGE DATA; LEARNING TO RANK; PAGE RANKS; PAGERANK; QUERY REFORMULATION; QUERY SUGGESTION; RANDOM WALK; RELEVANT QUERY; USER QUERY; WIKIPEDIA;

EID: 84863290030     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2124295.2124339     Document Type: Conference Paper
Times cited : (52)

References (25)
  • 1
    • 77956045296 scopus 로고    scopus 로고
    • Microsoft web n-gram services. http://research.microsoft.com/enus/ collaboration/focus/cs/web-ngram.aspx.
    • Microsoft Web N-gram Services
  • 3
    • 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
    • 65449160200 scopus 로고    scopus 로고
    • Context-aware query suggestion by mining click-through and session data
    • H. Cao, D. Jiang, J. Pei, Q. He, Z. Liao, E. Chen, and H. Li. Context-aware query suggestion by mining click-through and session data. In KDD '08, 2008.
    • (2008) KDD '08
    • Cao, H.1    Jiang, D.2    Pei, J.3    He, Q.4    Liao, Z.5    Chen, E.6    Li, H.7
  • 6
    • 33745769863 scopus 로고    scopus 로고
    • Query expansion using random walk models
    • K. Collins-Thompson and J. Callan. Query expansion using random walk models. In CIKM '05, pages 704-711.
    • CIKM '05 , pp. 704-711
    • Collins-Thompson, K.1    Callan, J.2
  • 8
    • 77950900883 scopus 로고    scopus 로고
    • Query reformulation using anchor text
    • V. Dang and B. W. Croft. Query reformulation using anchor text. In WSDM '10, pages 41-50, 2010.
    • (2010) WSDM '10 , pp. 41-50
    • Dang, V.1    Croft, B.W.2
  • 9
    • 72449122369 scopus 로고    scopus 로고
    • Entropy-biased models for query representation on the click graph
    • H. Deng, I. King, and M. R. Lyu. Entropy-biased models for query representation on the click graph. In SIGIR '09, pages 339-346, 2009.
    • (2009) SIGIR '09 , pp. 339-346
    • Deng, H.1    King, I.2    Lyu, M.R.3
  • 10
    • 77953061730 scopus 로고    scopus 로고
    • Topic-sensitive pagerank
    • T. H. Haveliwala. Topic-sensitive pagerank. In WWW '02, pages 517-526, 2002.
    • (2002) WWW '02 , pp. 517-526
    • Haveliwala, T.H.1
  • 12
    • 57349164104 scopus 로고    scopus 로고
    • A case for shorter queries, and helping users create them
    • April 2007
    • G. Kumaran and J. Allan. A case for shorter queries, and helping users create them. In Human Language Technologies 2007, pages 220-227, April 2007.
    • (2007) Human Language Technologies , pp. 220-227
    • Kumaran, G.1    Allan, J.2
  • 13
    • 57349158648 scopus 로고    scopus 로고
    • Effective and efficient user interaction for long queries
    • New York, NY, USA. ACM
    • G. Kumaran and J. Allan. Effective and efficient user interaction for long queries. In SIGIR '08, pages 11-18, New York, NY, USA, 2008. ACM.
    • (2008) SIGIR '08 , pp. 11-18
    • Kumaran, G.1    Allan, J.2
  • 14
    • 74549128582 scopus 로고    scopus 로고
    • Post-rank reordering: Resolving preference misalignments between search engines and end users
    • C. Liu, M. Li, and Y.-M. Wang. Post-rank reordering: resolving preference misalignments between search engines and end users. In CIKM '09, pages 641-650, 2009.
    • (2009) CIKM '09 , pp. 641-650
    • Liu, C.1    Li, M.2    Wang, Y.-M.3
  • 16
    • 67650083602 scopus 로고    scopus 로고
    • Query suggestion using hitting time
    • Q. Mei, D. Zhou, and K. Church. Query suggestion using hitting time. In CIKM '08, pages 469-478, 2008.
    • (2008) CIKM '08 , pp. 469-478
    • Mei, Q.1    Zhou, D.2    Church, K.3
  • 17
    • 0032270695 scopus 로고    scopus 로고
    • Improving automatic query expansion
    • M. Mitra, A. Singhal, and C. Buckley. Improving automatic query expansion. In SIGIR '98, pages 206-214, 1998.
    • (1998) SIGIR '98 , pp. 206-214
    • Mitra, M.1    Singhal, A.2    Buckley, C.3
  • 19
    • 32344431861 scopus 로고    scopus 로고
    • Query chains: Learning to rank from implicit feedback
    • F. Radlinski and T. Joachims. Query chains: learning to rank from implicit feedback. In KDD '05, pages 239-248.
    • KDD '05 , pp. 239-248
    • Radlinski, F.1    Joachims, T.2
  • 22
    • 74549114729 scopus 로고    scopus 로고
    • Mining query logs: Turning search usage data into knowledge
    • F. Silvestri. Mining query logs: Turning search usage data into knowledge. Foundations and Trends in Information Retrieval, 4(1-2):1-174, 2010.
    • (2010) Foundations and Trends in Information Retrieval , vol.4 , Issue.1-2 , pp. 1-174
    • Silvestri, F.1
  • 23
    • 77954585773 scopus 로고    scopus 로고
    • Optimal rare query suggestion with implicit user feedback
    • Y. Song and L. He. Optimal rare query suggestion with implicit user feedback. In WWW '10, pages 901-910.
    • WWW '10 , pp. 901-910
    • Song, Y.1    He, L.2
  • 24
    • 67650083615 scopus 로고    scopus 로고
    • Mining term association patterns from search logs for effective query reformulation
    • X. Wang and C. Zhai. Mining term association patterns from search logs for effective query reformulation. In CIKM '08, pages 479-488, 2008.
    • (2008) CIKM '08 , pp. 479-488
    • Wang, X.1    Zhai, C.2


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