Evaluating Memento Service Optimizations

May 31, 2019 Β· Declared Dead Β· πŸ› ACM/IEEE Joint Conference on Digital Libraries

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Martin Klein, Lyudmila Balakireva, Harihar Shankar arXiv ID 1906.00058 Category cs.IR: Information Retrieval Cross-listed cs.LG Citations 6 Venue ACM/IEEE Joint Conference on Digital Libraries Last Checked 4 months ago
Abstract
Services and applications based on the Memento Aggregator can suffer from slow response times due to the federated search across web archives performed by the Memento infrastructure. In an effort to decrease the response times, we established a cache system and experimented with machine learning models to predict archival holdings. We reported on the experimental results in previous work and can now, after these optimizations have been in production for two years, evaluate their efficiency, based on long-term log data. During our investigation we find that the cache is very effective with a 70-80% cache hit rate for human-driven services. The machine learning prediction operates at an acceptable average recall level of 0.727 but our results also show that a more frequent retraining of the models is needed to further improve prediction accuracy.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted