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
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Novelty and redundancy detection in adaptive filtering
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Improving recommendation lists through topic diversification
WWW '05 Proceedings of the 14th international conference on World Wide Web
Improving web search results using affinity graph
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Less is more: probabilistic models for retrieving fewer relevant documents
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Improving personalized web search using result diversification
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
IO-Top-k: index-access optimized top-k query processing
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Evaluating the accuracy of implicit feedback from clicks and query reformulations in Web search
ACM Transactions on Information Systems (TOIS)
Keyword proximity search in complex data graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Dense subgraph problems with output-density conditions
ACM Transactions on Algorithms (TALG)
TF-IDF uncovered: a study of theories and probabilities
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Novelty and diversity in information retrieval evaluation
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Introduction to Information Retrieval
Introduction to Information Retrieval
Proceedings of the Second ACM International Conference on Web Search and Data Mining
It takes variety to make a world: diversification in recommender systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Ranking objects based on relationships and fixed associations
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
An axiomatic approach for result diversification
Proceedings of the 18th international conference on World wide web
Efficient Computation of Diverse Query Results
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Turning down the noise in the blogosphere
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Expected reciprocal rank for graded relevance
Proceedings of the 18th ACM conference on Information and knowledge management
Redundancy, diversity and interdependent document relevance
ACM SIGIR Forum
Efficient diversity-aware search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient diversity-aware search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Dense subgraph maintenance under streaming edge weight updates for real-time story identification
Proceedings of the VLDB Endowment
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Proceedings of the VLDB Endowment
DisC diversity: result diversification based on dissimilarity and coverage
Proceedings of the VLDB Endowment
SkyDiver: a framework for skyline diversification
Proceedings of the 16th International Conference on Extending Database Technology
Proceedings of the twenty-ninth annual symposium on Computational geometry
Reducing information redundancy in search results
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Parameter-free and domain-independent similarity search with diversity
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
DoS: an efficient scheme for the diversification of multiple search results
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Top-k diversity queries over bounded regions
ACM Transactions on Database Systems (TODS)
Diversity maximization under matroid constraints
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Profile diversity in search and recommendation
Proceedings of the 22nd international conference on World Wide Web companion
Real-time recommendation of diverse related articles
Proceedings of the 22nd international conference on World Wide Web
Scalable diversification of multiple search results
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Top-K structural diversity search in large networks
Proceedings of the VLDB Endowment
POIKILO: a tool for evaluating the results of diversification models and algorithms
Proceedings of the VLDB Endowment
Efficient indexing for diverse query results
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Typical approaches of ranking information in response to a user's query that return the most relevant results ignore important factors contributing to user satisfaction; for instance, the contents of a result document may be redundant given the results already examined. Motivated by emerging applications, in this work we study the problem of Diversity-Aware Search, the essence of which is ranking search results based on both their relevance, as well as their dissimilarity to other results reported. Diversity-Aware Search is generally a hard problem, and even tractable instances thereof cannot be efficiently solved by adapting existing approaches. We propose DIVGEN, an efficient algorithm for diversity-aware search, which achieves significant performance improvements via novel data access primitives. Although selecting the optimal schedule of data accesses is a hard problem, we devise the first low-overhead data access prioritization scheme with theoretical quality guarantees, and good performance in practice. A comprehensive evaluation on real and synthetic large-scale corpora demonstrates the efficiency and effectiveness of our approach.