메뉴 건너뛰기




Volumn , Issue , 2011, Pages 805-814

Synthesizing high utility suggestions for rare web search queries

Author keywords

Query recommendations; Rare queries; Search query logs

Indexed keywords

INFORMATION RETRIEVAL; WEBSITES;

EID: 80052127248     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2009916.2010024     Document Type: Conference Paper
Times cited : (28)

References (36)
  • 2
    • 1542317693 scopus 로고    scopus 로고
    • Using terminological feedback for web search refinement: A log-based study
    • P. Anick. Using terminological feedback for web search refinement: a log-based study. In SIGIR '03, 2003.
    • (2003) SIGIR '03
    • Anick, P.1
  • 3
    • 57349175533 scopus 로고    scopus 로고
    • Discovering key concepts in verbose queries
    • M. Bendersky and B. Croft. Discovering key concepts in verbose queries. In SIGIR '08, 2008.
    • (2008) SIGIR '08
    • Bendersky, M.1    Croft, B.2
  • 5
    • 84867919822 scopus 로고
    • Transformation-based error-driven learning and natural language processing: A case study in part-of-speech tagging
    • E. Brill. Transformation-based error-driven learning and natural language processing: A case study in part-of-speech tagging. Computational Linguistics., 21(4), 1995.
    • (1995) Computational Linguistics , vol.21 , Issue.4
    • Brill, E.1
  • 6
    • 0030262401 scopus 로고    scopus 로고
    • A study of aboutness in information retrieval
    • P. D. Bruza and T. W. Huibers. A study of aboutness in information retrieval. In AI '96, 1996.
    • (1996) AI '96
    • Bruza, P.D.1    Huibers, T.W.2
  • 7
    • 85132028005 scopus 로고
    • Word association norms, mutual information, and lexicography
    • K. W. Church and P. Hanks. Word association norms, mutual information, and lexicography. In ACL '89, 1989.
    • (1989) ACL '89
    • Church, K.W.1    Hanks, P.2
  • 8
    • 36448966738 scopus 로고    scopus 로고
    • Random walks on the click graph
    • N. Craswcll and M. Szummcr. Random walks on the click graph. In SIGIR '07, 2007.
    • (2007) SIGIR '07
    • Craswcll, N.1    Szummcr, M.2
  • 9
    • 77950900883 scopus 로고    scopus 로고
    • Query reformulation using anchor text
    • V". Dang and B. Croft. Query reformulation using anchor text. In WSDM '10, 2010.
    • (2010) WSDM '10
    • Dang, V.1    Croft, B.2
  • 10
    • 0030709534 scopus 로고    scopus 로고
    • Automatic feedback using past queries: Social searching?
    • L. Fitzpatrick and M. Dent. Automatic feedback using past queries: social searching? In SIGIR '97, 1997.
    • (1997) SIGIR '97
    • Fitzpatrick, L.1    Dent, M.2
  • 12
    • 0035470889 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • J. H. Friedman. Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29, 2000.
    • Annals of Statistics , vol.29 , pp. 2000
    • Friedman, J.H.1
  • 13
    • 74049151810 scopus 로고    scopus 로고
    • Using the wisdom of the crowds for keyword generation
    • A. Fuxman, P. Tsaparas, K. Achan, and R. Agrawal. Using the wisdom of the crowds for keyword generation. In WWW '08, 2008.
    • (2008) WWW '08
    • Fuxman, A.1    Tsaparas, P.2    Achan, K.3    Agrawal, R.4
  • 14
    • 0000679216 scopus 로고
    • Distributional structure
    • Z. Harris. Distributional structure. Word, 10(23), 1954.
    • (1954) Word , vol.10 , Issue.23
    • Harris, Z.1
  • 15
    • 77954614449 scopus 로고    scopus 로고
    • Exploring web scale language models for search query processing
    • J. Huang, J. Gao, J. Miao, X. Li, K. Wang, and F. Behr. Exploring web scale language models for search query processing. In WWW '10, 2010.
    • (2010) WWW '10
    • Huang, J.1    Gao, J.2    Miao, J.3    Li, X.4    Wang, K.5    Behr, F.6
  • 16
    • 77956027604 scopus 로고    scopus 로고
    • Evaluating verbose query processing techniques
    • S. Huston and B. Croft. Evaluating verbose query processing techniques. In SIGIR '10, 2010.
    • (2010) SIGIR '10
    • Huston, S.1    Croft, B.2
  • 17
    • 83055188869 scopus 로고    scopus 로고
    • Improving recommendation for long-tail queries via templates
    • Y. M. Idan Szpektor, Aristides Gionis. Improving recommendation for long-tail queries via templates. In WWW '11, 2011.
    • (2011) WWW '11
    • Idan Szpektor, Y.M.1    Gionis, A.2
  • 19
    • 1542377477 scopus 로고    scopus 로고
    • Query word deletion prediction
    • R. Jones and D. C. Fain. Query word deletion prediction. In SIGIR '03, 2003.
    • (2003) SIGIR '03
    • Jones, R.1    Fain, D.C.2
  • 21
    • 0028996876 scopus 로고    scopus 로고
    • Improved backing-off for m-gram language modeling
    • R. Kneser and H. Ney. Improved backing-off for m-gram language modeling. ICASSP 1995, 1, 1995.
    • ICASSP 1995 , vol.1 , pp. 1995
    • Kneser, R.1    Ney, H.2
  • 22
    • 72449190623 scopus 로고    scopus 로고
    • Reducing long queries using query quality predictors
    • G. Kumaran and V. R. Carvalho. Reducing long queries using query quality predictors. In SIGIR '09, 2009.
    • (2009) SIGIR '09
    • Kumaran, G.1    Carvalho, V.R.2
  • 23
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: Probabilistic models for segmenting and labeling sequence data
    • J. D. Lafferty, A. McCallum, and F. C. N. Pereira, Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML '01, 2001.
    • (2001) ICML '01
    • Lafferty, J.D.1    McCallum, A.2    Pereira, F.C.N.3
  • 24
    • 0002557709 scopus 로고    scopus 로고
    • Automatic retrieval and clustering of similar words
    • D. Lin. Automatic retrieval and clustering of similar words. In COLING '98, 1998.
    • (1998) COLING '98
    • Lin, D.1
  • 25
    • 67650083602 scopus 로고    scopus 로고
    • Query suggestion using hitting time
    • Q. Mei, D. Zhou, and K. Church. Query suggestion using hitting time. In CIKM '08, 2008.
    • (2008) CIKM '08
    • Mei, Q.1    Zhou, D.2    Church, K.3
  • 28
    • 0029205263 scopus 로고
    • On the reuse of past optimal queries
    • V. V. Raghavan and H. Sever. On the reuse of past optimal queries. In SIGIR '95, 1995.
    • (1995) SIGIR '95
    • Raghavan, V.V.1    Sever, H.2
  • 30
    • 1542377532 scopus 로고    scopus 로고
    • Re-examining the potential effectiveness of interactive query expansion
    • I. Ruthven. Re-examining the potential effectiveness of interactive query expansion. In SIGIR '03, 2003.
    • (2003) SIGIR '03
    • Ruthven, I.1
  • 31
    • 11744346920 scopus 로고
    • On the use of term associations in automatic information retrieval
    • G. Salton. On the use of term associations in automatic information retrieval. In COLING, 1986.
    • (1986) COLING
    • Salton, G.1
  • 32
    • 18744370220 scopus 로고    scopus 로고
    • Scoring missing terms in information retrieval tasks
    • E. Terra and C. L. Clarke. Scoring missing terms in information retrieval tasks. In CIKM '04, 2004.
    • (2004) CIKM '04
    • Terra, E.1    Clarke, C.L.2
  • 33
    • 77956028454 scopus 로고    scopus 로고
    • Learning to rank query reformulations
    • M. B. Van Dang and W. B. Croft. Learning to rank query reformulations. In SIGIR '10, 2010.
    • (2010) SIGIR '10
    • Van Dang, M.B.1    Croft, W.B.2
  • 34
    • 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, 2008.
    • (2008) CIKM '08
    • Wang, X.1    Zhai, C.2
  • 35
    • 84884698326 scopus 로고    scopus 로고
    • Clustering user queries of a search engine
    • J.-R. Wen, J.-Y. Nie, and H.-J. Zhang. Clustering user queries of a search engine. In WWW '01, 2001.
    • (2001) WWW '01
    • Wen, J.-R.1    Nie, J.-Y.2    Zhang, H.-J.3
  • 36
    • 67649855128 scopus 로고    scopus 로고
    • Mining search engine query logs for query recommendation
    • Z. Zhang and O. Nasraoui. Mining search engine query logs for query recommendation. In WWW '06, 2006.
    • (2006) WWW '06
    • Zhang, Z.1    Nasraoui, O.2


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