메뉴 건너뛰기




Volumn , Issue , 2010, Pages 474-482

Learning dense models of query similarity from user click logs

Author keywords

[No Author keywords available]

Indexed keywords

EDIT DISTANCE; EVALUATION METRICS; IMPLICIT FEEDBACK; LARGE DATASETS; LINEAR RANKING; QUERY LOGS; QUERY SIMILARITY; RANKING METHODS; SEARCH RESULTS; SEMANTIC SIMILARITY; STOCHASTIC GRADIENT DESCENT; WEAK LABELS;

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

References (28)
  • 3
    • 77954626554 scopus 로고    scopus 로고
    • From 'Dango' to 'Japanese cakes': Query reformulation models and patterns
    • IEEE Cs Press
    • P. Boldi, F. Bonchi, C. Castillo, and S. Vigna. 2009. From 'Dango' to 'Japanese cakes': Query reformula- tion models and patterns. In Proceedings of Web Intelligence. IEEE Cs Press.
    • (2009) Proceedings of Web Intelligence
    • Boldi, P.1    Bonchi, F.2    Castillo, C.3    Vigna, S.4
  • 4
    • 84855418436 scopus 로고    scopus 로고
    • Normalized (pointwise) mutual information in collocation extraction
    • G. Bouma. 2009. Normalized (pointwise) mutual information in collocation extraction. In Proceedings of GSCL.
    • (2009) Proceedings of GSCL
    • Bouma, G.1
  • 7
    • 84936824188 scopus 로고
    • Word association norms, mutual information and lexicography
    • Kenneth Church and Patrick Hanks. 1990. Word association norms, mutual information and lexicography. Computational Linguistics, 16(1):22-29.
    • (1990) Computational Linguistics , vol.16 , Issue.1 , pp. 22-29
    • Church, K.1    Hanks, P.2
  • 16
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • V.I. Levenshtein. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10(8):707-710.
    • (1966) Soviet Physics Doklady , vol.10 , Issue.8 , pp. 707-710
    • Levenshtein, V.I.1
  • 18
    • 0004030721 scopus 로고
    • Computer intensive methods for testing hypotheses
    • Wiley, New York
    • Eric W. Noreen. 1989. Computer Intensive Methods for Testing Hypotheses. An Introduction. Wiley, New York.
    • (1989) An Introduction
    • Noreen, E.W.1
  • 19
    • 68949180328 scopus 로고    scopus 로고
    • More data trumps smarter algorithms: Comparing pointwise mutual information with latent semantic analysis
    • G. Recchia and M.N. Jones. 2009. More data trumps smarter algorithms: comparing pointwise mutual information with latent semantic analysis. Behavioral Research Methods, 41(3):647-656.
    • (2009) Behavioral Research Methods , vol.41 , Issue.3 , pp. 647-656
    • Recchia, G.1    Jones, M.N.2
  • 20
    • 27644575651 scopus 로고    scopus 로고
    • Analysis of multiple query reformulations on the web: The interactive information retrieval context
    • DOI 10.1016/j.ipm.2005.05.005, PII S030645730500066X
    • S.Y. Rieh and H. Xie. 2006. Analysis of multiple query reformulations on the web: the interactive information retrieval context. Inf. Process. Manage., 42(3):751-768. (Pubitemid 41563163)
    • (2006) Information Processing and Management , vol.42 , Issue.3 , pp. 751-768
    • Rieh, S.Y.1    Xie, H.2
  • 25
    • 24044511526 scopus 로고    scopus 로고
    • Ranking and reranking with perceptron
    • DOI 10.1007/s10994-005-0918-9
    • Libin Shen and Aravind K. Joshi. 2005. Ranking and reranking with perceptron. Journal of Machine Learning Research, 60(1-3):73-96. (Pubitemid 41218063)
    • (2005) Machine Learning , vol.60 , Issue.1-3 , pp. 73-96
    • Shen, L.1    Joshi, A.K.2


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