메뉴 건너뛰기




Volumn , Issue , 2010, Pages 11-20

Towards recency ranking in web search

Author keywords

Recency modeling; Recency ranking; Recency sensitive query classification; Temporal features

Indexed keywords

EVALUATION METRICS; HIGH PRECISION; QUERY CLASSIFICATION; RANKING MODEL; RECENCY RANKING; RETRIEVAL SYSTEMS; TEMPORAL FEATURES; WEB SEARCHES;

EID: 77950924156     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1718487.1718490     Document Type: Conference Paper
Times cited : (131)

References (23)
  • 1
    • 77950931233 scopus 로고    scopus 로고
    • Time will tell: Leveraging temporal expressions in ir
    • I. Arikan, S. Bedathur, and K. Berberich. Time will tell: Leveraging temporal expressions in ir. WSDM, 2009.
    • (2009) WSDM
    • Arikan, I.1    Bedathur, S.2    Berberich, K.3
  • 10
    • 0035470889 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • J. Friedman. Greedy function approximation: a gradient boosting machine. Ann. Statist., 29:1189-1232, 2001.
    • (2001) Ann. Statist. , vol.29 , pp. 1189-1232
    • Friedman, J.1
  • 13
    • 0242540464 scopus 로고    scopus 로고
    • Bursty and hierarchical structure in streams
    • J. Kleinberg. Bursty and hierarchical structure in streams. In KDD, pages 91-101, 2002.
    • (2002) KDD , pp. 91-101
    • Kleinberg, J.1
  • 14
    • 72449201596 scopus 로고    scopus 로고
    • Click-through prediction for news queries
    • A. C. König, M. Gamon, and Q. Wu. Click-through prediction for news queries. Proc. of SIGIR, pages 347-354, 2009.
    • (2009) Proc. of SIGIR , pp. 347-354
    • König, A.C.1    Gamon, M.2    Wu, Q.3
  • 18
    • 33745620504 scopus 로고    scopus 로고
    • Shuffling a stacked deck: The case for partially randomized ranking of search engine results
    • S. Pandey, S. Roy, C. Olston, J. Cho, and S. Chakrabarti. Shuffling a stacked deck: The case for partially randomized ranking of search engine results. VLDB, 2005.
    • (2005) VLDB
    • Pandey, S.1    Roy, S.2    Olston, C.3    Cho, J.4    Chakrabarti, S.5
  • 19
    • 77950961537 scopus 로고    scopus 로고
    • Towards temporal web search
    • M. Pasca. Towards temporal web search. ACM SAC, 2008.
    • (2008) ACM SAC
    • Pasca, M.1
  • 20
    • 3142717571 scopus 로고    scopus 로고
    • Identifying similarities, periodicities and bursts for online search queries
    • M. Vlachos, C. Meek, Z. Vagena, and D. Gunopulos. Identifying similarities, periodicities and bursts for online search queries. In SIGMOD, pages 131-142, 2004.
    • (2004) SIGMOD , pp. 131-142
    • Vlachos, M.1    Meek, C.2    Vagena, Z.3    Gunopulos, D.4
  • 23
    • 84865328708 scopus 로고    scopus 로고
    • A general boosting method and its application to learning ranking functions for web search
    • Z. Zheng, H. Zhang, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for web search. NIPS, 2007.
    • (2007) NIPS
    • Zheng, Z.1    Zhang, H.2    Zhang, T.3    Chapelle, O.4    Chen, K.5    Sun, G.6


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