We consider the problem of ranking the popularity of items and suggesting popular items based on user feedback. User feedback is obtained by iteratively presenting a set of suggested items, and users selecting items based on their own preferences either from this suggestion set or from the set of all possible items. The goal is to quickly learn the true popularity ranking of items (unbiased by the made suggestions), and suggest true popular items. The difficulty is that making suggestions to users can reinforce popularity of some items and distort the resulting item ranking. The described problem of ranking and suggesting items arises in diverse applications including search query suggestions and tag suggestions for social tagging systems. We propose and study several algorithms for ranking and suggesting popular items, provide analytical results on their performance, and present numerical results obtained using the inferred popularity of tags from a month-long crawl of a popular social book marking service. Our results suggest that lightweight, randomized update rules that require no special configuration parameters provide good performance.
|Translated title of the contribution||Ranking and suggesting popular items|
|Pages (from-to)||1133 - 1146|
|Number of pages||14|
|Journal||IEEE Transactions on Knowledge and Data Engineering|
|Publication status||Published - Aug 2009|
Bibliographical notePublisher: IEEE
Vojnovic, M., Cruise, RJR., Gunawardena, D., & Marbach, P. (2009). Ranking and suggesting popular items. IEEE Transactions on Knowledge and Data Engineering, 21(8), 1133 - 1146. https://doi.org/10.1109/TKDE.2009.34