Web Science and Digital Libraries Research Group

While researching my dissertation topic, I re-encountered the paper, " Routing Memento Requests Using Binary Classifiers " by Bornand, Balakireva, and Van de Sompel from JCDL 2016 ( arXiv:1606.09136v1 ). The high-level gist of this paper is that by using two corpora of URI-Rs consisting of requests to their Memento aggregator (one for training, the other for training evaluation), the authors were able to significantly mitigate wasted requests to archives that contained no mementos for a requested URI-R. For each of the 17 Web archives included in the experiment, with the exception of the Internet Archive on the assumption that a positive result would always be returned, a classifier was generated. The classifiers informed the decision of, given a URI-R, whether the respective Web archive should be queried. Optimization of this sort has been performed before. For example, AlSum et al. from TPDL 2013 ( trip report , IJDL 2014 , and arXiv ) created profiles for 12 Web a