Time is of the essence: improving recency ranking using Twitter data
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Realtime web search refers to the retrieval of very fresh content which is in high demand. An effective portal web search engine must support a variety of search needs, including realtime web search. However, supporting realtime web search introduces two challenges not encountered in non-realtime web search: quickly crawling relevant content and ranking documents with impoverished link and click information. In this paper, we advocate the use of realtime micro-blogging data for addressing both of these problems. We propose a method to use the micro-blogging data stream to detect fresh URLs. We also use micro-blogging data to compute novel and effective features for ranking fresh URLs. We demonstrate these methods improve effective of the portal web search engine for realtime web search.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“[Dong et al. 2010b] incorporated fresh URLs extracted from Twitter into a general web search system.”
From Survey of Temporal Information Retrieval and Related Applications (2015) · cites this paper as Dong et al. 2010b
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731 · cited 2×
“We can compute the importance of each feature by the method proposed in [12].”
MethodThe anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004 · cited 1×
“The analog in web search is the PageRank of a document [4].”
BackgroundIntroduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Cumulated gain-based evaluation of IR techniques
Järvelin, K., & Kekäläinen, J. (2002) · ACM Transactions on Information Systems · doi:10.1145/582415.582418 · Cited by 4,841
Learning to rank using gradient descent
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102363 · Cited by 2,836 · cited 3×
“For example, RankSVM [19] uses support vector machines; RankBoost [11] applies the idea of boosting from weak learners; GBrank [28] uses gradient boosting with decision tree; RankNet [6] uses gradient boosting with neural network.”
BackgroundMethodLearning to rank: from pairwise approach to listwise approach
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273513 · Cited by 1,960
Broder, A. (2002) · ACM SIGIR Forum · doi:10.1145/792550.792552 · Cited by 1,944 · cited 1×
“Inc. 701 First Avenue, Sunnyvale, CA 94089 {anlei, ruiqiang, pranam, jingbai, diazf, yichang, zhaohui}@yahoo-inc.com Hongyuan Zha College of Computing Georgia Institute of Technology Atlanta, GA 30032 zha@cc.gatech.edu ABSTRACT Realtime web search refers to the retrieval of very fresh content…”
BackgroundKrishnamurthy, B., Gill, P., & Arlitt, M. (2008) · Proceedings of the first workshop on Online social networks · doi:10.1145/1397735.1397741 · Cited by 697 · cited 1×
“[21] identify distinct classes of Twitter users and their behaviors, geographic growth patterns and current size of the network, and compare crawl results obtained under rate limiting constraints.”
Background
Cited by
When things matter: A survey on data-centric internet of things
Qin, Y., Sheng, Q. Z., Falkner, N. J. G., Dustdar, S., Wang, H., & Vasilakos, A. V. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2015.12.016 · Cited by 331
Twevent: segment-based event detection from tweets
Li, C., Sun, A., & Datta, A. (2012) · Proceedings of the 21st ACM international conference on Information and knowledge management · doi:10.1145/2396761.2396785 · Cited by 317
Credibility ranking of tweets during high impact events
Gupta, A., & Kumaraguru, P. (2012) · Proceedings of the 1st Workshop on Privacy and Security in Online Social Media · doi:10.1145/2185354.2185356 · Cited by 297
Semantic Enrichment of Twitter Posts for User Profile Construction on the Social Web
Abel, F., Gao, Q., Houben, G.-J., & Tao, K. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21064-8_26 · Cited by 267
A survey of Twitter research: Data model, graph structure, sentiment analysis and attacks
Antonakaki, D., Fragopoulou, P., & Ioannidis, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.114006 · Cited by 265
Metadata
- Authors
- Dong, A., Zhang, R., Kolari, P., Bai, J., Diaz, F., Chang, Y., Zheng, Z., & Zha, H.
- Venue
- Proceedings of the 19th international conference on World wide web
- Publisher
- ACM
- Published
- 2010-04-26
- Pages
- 331-340
- OpenAlex
- W2167355161
- Cited by
- 208
- References
- 8
- FWCI
- 23.39
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.