메뉴 건너뛰기




Volumn 1, Issue 1, 2008, Pages 408-421

Simrank++: Query rewriting through link analysis of the click graph

Author keywords

Click graph; Link analysis; Similarity metric; Sponsored search

Indexed keywords

CLICK GRAPHS; LINK ANALYSIS; QUERY REWRITINGS; QUERY SIMILARITY; SIMILARITY METRICS; SIMRANK; SPONSORED SEARCHES; USER QUERY;

EID: 84859166305     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453903     Document Type: Article
Times cited : (186)

References (18)
  • 1
    • 38749085661 scopus 로고    scopus 로고
    • Local graph partitioning using pagerank vectors
    • Reid Andersen, Fan Chung, and Kevin Lang. Local graph partitioning using pagerank vectors. In FOCS'06.
    • In FOCS'06
    • Anderse, R.1    Chung, F.2    Lang, K.3
  • 2
    • 57349116335 scopus 로고    scopus 로고
    • Simrank++: Query rewriting through link analysis ofthe click graph
    • I. Antonellis, H. Garcia-Molina, and C. Chang. Simrank++: Query rewriting through link analysis ofthe click graph. In Technical Report, url: http://dbpubs.stanford.edu/pub/2007-32, 2007.
    • (2007) In Technical Report, url
    • Antonellis, I.1    Garcia-Molina, H.2    Chang, C.3
  • 3
    • 80052121018 scopus 로고    scopus 로고
    • Agglomerative clustering of a search engine query log
    • Doug Beeferman and Adam Berger. Agglomerative clustering of a search engine query log. In KDD '00.
    • In KDD '00
    • Beeferman, D.1    Berger, A.2
  • 5
    • 85030321143 scopus 로고    scopus 로고
    • MapReduce: Simplied data processing on large clusters
    • Jerey Dean and Sanjay Ghemawat. MapReduce: Simplied data processing on large clusters. In OSDI 2004.
    • In OSDI 2004
    • Dean, J.1    Ghemawat, S.2
  • 7
    • 0242625250 scopus 로고    scopus 로고
    • Simrank: a measure of structural-context similarity
    • Glen Jeh and Jennifer Widom. Simrank: a measure of structural-context similarity. In KDD '02.
    • In KDD '02
    • Jeh, G.1    Widom, J.2
  • 12
    • 35348840947 scopus 로고    scopus 로고
    • Predicting clicks: Estimating the click-through rate for new ads
    • Matthew Richardson, Ewa Dominowska, and Robert Ragno. Predicting clicks: Estimating the click-through rate for new ads. In WWW '07.
    • In WWW '07
    • Richardson, M.1    Dominowska, E.2    Ragno, R.3
  • 13
    • 1542377532 scopus 로고    scopus 로고
    • Re-examining the potential e ectiveness of interactive query expansion
    • Ian Ruthven. Re-examining the potential e ectiveness of interactive query expansion. In SIGIR '03, pages 213{220.
    • In SIGIR '03, pages 213{220
    • Ruthven, L.1
  • 14
    • 34548328604 scopus 로고
    • Algorithms for random generation and counting: A markov chain approach
    • A. Sinclair. Algorithms for random generation and counting: A markov chain approach. In Birkhauser, Boston-Basel-Berlin, 1993.
    • (1993) In Birkhauser, Boston-Basel-Berlin
    • Sinclair, A.1
  • 15
    • 85038466263 scopus 로고    scopus 로고
    • Scoring missing terms in information retrieval tasks
    • Egidio Terra and Charles L.A. Clarke. Scoring missing terms in information retrieval tasks. In CIKM '04.
    • In CIKM '04
    • Egidio, T.1    Charles, A.C.2
  • 16
    • 0038546532 scopus 로고    scopus 로고
    • Query clustering using user logs. ACM Trans
    • Ji-Rong Wen, Jian-Yun Nie, and Hong-Jiang Zhang. Query clustering using user logs. ACM Trans. Inf. Syst., 2002.
    • (2002) Inf. Syst.
    • Wen, J.-R.1    Nie, J.-Y.2    Zhang, H.-J.3
  • 17
    • 36448973022 scopus 로고    scopus 로고
    • Query rewriting using active learning for sponsored search
    • Wei Vivian Zhang, Xiaofei He, Benjamin Rey, and Rosie Jones. Query rewriting using active learning for sponsored search. In SIGIR '07.
    • In SIGIR '07
    • Zhang, W.V.1    He, X.2    Rey, B.3    Jones, R.4


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