Combining initial segments of lists

Warmuth, Manfred K., Koolen, Wouter M., & Helmbold, David P. (2014) Combining initial segments of lists. Theoretical Computer Science, 519, pp. 29-45.

View at publisher

Abstract

We propose a new way to build a combined list from K base lists, each containing N items. A combined list consists of top segments of various sizes from each base list so that the total size of all top segments equals N. A sequence of item requests is processed and the goal is to minimize the total number of misses. That is, we seek to build a combined list that contains all the frequently requested items. We first consider the special case of disjoint base lists. There, we design an efficient algorithm that computes the best combined list for a given sequence of requests. In addition, we develop a randomized online algorithm whose expected number of misses is close to that of the best combined list chosen in hindsight. We prove lower bounds that show that the expected number of misses of our randomized algorithm is close to the optimum. In the presence of duplicate items, we show that computing the best combined list is NP-hard. We show that our algorithms still apply to a linearized notion of loss in this case. We expect that this new way of aggregating lists will find many ranking applications.

Impact and interest:

1 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 82483
Item Type: Journal Article
Refereed: Yes
Additional Information: The special issue on Algorithmic Learning Theory for ALT 2011
Keywords: Online learning; Ranking; Worst-case analysis; Relative loss bounds
DOI: 10.1016/j.tcs.2013.09.021
ISSN: 0304-3975
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Past > Schools > Mathematical Sciences
Deposited On: 12 Mar 2015 22:37
Last Modified: 26 May 2015 22:05

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page