mlsanityData to 7 Oct 2026

Look back, look around: a systematic analysis of effective predictors for new outlinks in focused Web crawling

arXiv 2111.05062 ↗First posted 9 Nov 2021cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Small and medium enterprises rely on detailed Web analytics to be informed about their market and competition. Focused crawlers meet this demand by crawling and indexing specific parts of the Web. Critically, a focused crawler must quickly find new pages that have not yet been indexed. Since a new page can be discovered only by following a new outlink, predicting new outlinks is very relevant in practice. In the literature, many feature designs have been proposed for predicting changes in the Web. In this work we provide a structured analysis of this problem, using new outlinks as our running prediction target. Specifically, we unify earlier feature designs in a taxonomic arrangement of features along two dimensions: static versus dynamic features, and features of a page versus features of the network around it. Within this taxonomy, complemented by our new (mainly, dynamic network) features, we identify best predictors for new outlinks. Our main conclusion is that most informative features are the recent history of new outlinks on a page itself, and of its content-related pages. Hence, we propose a new 'look back, look around' (LBLA) model, that uses only these features. With the obtained predictions, we design a number of scoring functions to guide a focused crawler to pages with most new outlinks, and compare their performance. The LBLA approach proved extremely effective, outperforming other models including those that use a most complete set of features. One of the learners we use, is the recent NGBoost method that assumes a Poisson distribution for the number of new outlinks on a page, and learns its parameters. This connects the two so far unrelated avenues in the literature: predictions based on features of a page, and those based on probabilistic modelling. All experiments were carried out on an original dataset, made available by a commercial focused crawler.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 57 references that are in the map. First posted on arXiv 9 Nov 2021.

Builds on

7 of 57 references.

References · 7

  1. 2019NGBoost: Natural Gradient Boosting for Probabilistic Predictioncited by 94
  2. 2020Online Algorithms for Estimating Change Rates of Web Pagescited by 7
  3. 2019Learning to Crawlcited by 4
  4. 2020Change Rate Estimation and Optimal Freshness in Web Page Crawlingcited by 3
  5. 2019Change Detection and Notification of Webpages: A Surveycited by 1
  6. 2020Who Should Google Scholar Update More Often?cited by 1
  7. 2020Fast top-K Cosine Similarity Search through XOR-Friendly Binary Quantization on GPUscited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.