A fast branch & bound nearest neighbour classifier in metric spaces
Pattern Recognition Letters
The use of MMR, diversity-based reranking for reordering documents and producing summaries
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
ACM Computing Surveys (CSUR)
Fully Dynamic Spatial Approximation Trees
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Beyond independent relevance: methods and evaluation metrics for subtopic retrieval
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval
ISM '06 Proceedings of the Eighth IEEE International Symposium on Multimedia
Novelty and diversity in information retrieval evaluation
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Proceedings of the 2009 workshop on Web Search Click Data
Second ACM International Conference on Web Search and Web Data Mining
Visual diversification of image search results
Proceedings of the 18th international conference on World wide web
Portfolio theory of information retrieval
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Dynamic Spatial Approximation Trees for Massive Data
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Text-Based and Content-Based Image Retrieval on Flickr: DEMO
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Expected reciprocal rank for graded relevance
Proceedings of the 18th ACM conference on Information and knowledge management
Probabilistic models of ranking novel documents for faceted topic retrieval
Proceedings of the 18th ACM conference on Information and knowledge management
Exploiting query reformulations for web search result diversification
Proceedings of the 19th international conference on World wide web
Selectively diversifying web search results
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Modelling efficient novelty-based search result diversification in metric spaces
Journal of Discrete Algorithms
Parameter-free and domain-independent similarity search with diversity
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
| Hi-index | 0.00 |
Novelty-based diversification approaches aim to produce a diverse ranking by directly comparing the retrieved documents. However, since such approaches are typically greedy, they require O(n2) documentdocument comparisons in order to diversify a ranking of n documents. In this work, we propose to model novelty-based diversification as a similarity search in a sparse metric space. In particular, we exploit the triangle inequality property of metric spaces in order to drastically reduce the number of required document-document comparisons. Thorough experiments using three TREC test collections show that our approach is at least as effective as existing novelty-based diversification approaches, while improving their efficiency by an order of magnitude.