Ad-hoc aggregations of ranked lists in the presence of hierarchies

A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists of popular query keywords which can be visualized according to several criteria. At Flickr, lists of popular tags used to tag the images uploaded can be visualized as a cloud based on their popularity. Identification of the k most popular terms can be easily conducted by utilizing well known rank aggregation algorithms. In this paper we take a different approach to information discovery from such ranked lists. We maintain the same rank aggregation framework but we elevate terms at a higher level by making use of popular term hierarchies commonly available. Under such a transformation we show that typical early stopping certificates available for rank aggregation algorithms are no longer applicable. Based on this observation, in this paper, we present a probabilistic framework for early stopping in this setting...

• Type: Conference
• Year: 2008
• Where: SIGMOD
• Authors: Nilesh Bansal, Sudipto Guha, Nick Koudas
• Keywords: Database, Rank Aggregation Algorithms, Rank Aggregation Framework, Rank Aggregation Problem, SIGMOD 2008