Discrete Mathematics - Topics on domination
Approximating the minimum maximal independence number
Information Processing Letters
A comparison of p-dispersion heuristics
Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
IEEE Transactions on Knowledge and Data Engineering
Improving recommendation lists through topic diversification
WWW '05 Proceedings of the 14th international conference on World Wide Web
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
On approximation algorithms of k-connected m-dominating sets in disk graphs
Theoretical Computer Science
Novelty and diversity in information retrieval evaluation
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation
CARD: a decision-guidance framework and application for recommending composite alternatives
Proceedings of the 2008 ACM conference on Recommender systems
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
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
Distance-Based Representative Skyline
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Using trees to depict a forest
Proceedings of the VLDB Endowment
ACM SIGMOD Record
Similarity Search: The Metric Space Approach
Similarity Search: The Metric Space Approach
Efficient diversity-aware search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
On query result diversification
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Incremental diversification for very large sets: a streaming-based approach
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Diversification and refinement in collaborative filtering recommender
Proceedings of the 20th ACM international conference on Information and knowledge management
Online selection of diverse results
Proceedings of the fifth ACM international conference on Web search and data mining
Max-Sum diversification, monotone submodular functions and dynamic updates
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Dynamic diversification of continuous data
Proceedings of the 15th International Conference on Extending Database Technology
Parameter-free and domain-independent similarity search with diversity
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
POIKILO: a tool for evaluating the results of diversification models and algorithms
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Recently, result diversification has attracted a lot of attention as a means to improve the quality of results retrieved by user queries. In this paper, we propose a new, intuitive definition of diversity called DisC diversity. A DisC diverse subset of a query result contains objects such that each object in the result is represented by a similar object in the diverse subset and the objects in the diverse subset are dissimilar to each other. We show that locating a minimum DisC diverse subset is an NP-hard problem and provide heuristics for its approximation. We also propose adapting DisC diverse subsets to a different degree of diversification. We call this operation zooming. We present efficient implementations of our algorithms based on the M-tree, a spatial index structure, and experimentally evaluate their performance.