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
The budgeted maximum coverage problem
Information Processing Letters
Amazon.com Recommendations: Item-to-Item Collaborative Filtering
IEEE Internet Computing
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
The Journal of Machine Learning Research
Improving web search results using affinity graph
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Prediction, Learning, and Games
Prediction, Learning, and Games
Incorporating non-local information into information extraction systems by Gibbs sampling
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Google news personalization: scalable online collaborative filtering
Proceedings of the 16th international conference on World Wide Web
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Modeling Discriminative Global Inference
ICSC '07 Proceedings of the International Conference on Semantic Computing
Redundancy, diversity and interdependent document relevance
ACM SIGIR Forum
Surfing the blogosphere: optimal personalized strategies for searching the web
INFOCOM'10 Proceedings of the 29th conference on Information communications
Connecting the dots between news articles
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Learning to rank relevant and novel documents through user feedback
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Proceedings of the fourth ACM international conference on Web search and data mining
Multi-dimensional search result diversification
Proceedings of the fourth ACM international conference on Web search and data mining
Efficient diversity-aware search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Submodularity and its applications in optimized information gathering
ACM Transactions on Intelligent Systems and Technology (TIST)
Diversity in ranking via resistive graph centers
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Beyond keyword search: discovering relevant scientific literature
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Diversified ranking on large graphs: an optimization viewpoint
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Connecting Two (or Less) Dots: Discovering Structure in News Articles
ACM Transactions on Knowledge Discovery from Data (TKDD)
Online selection of diverse results
Proceedings of the fifth ACM international conference on Web search and data mining
Fair and balanced: learning to present news stories
Proceedings of the fifth ACM international conference on Web search and data mining
Trains of thought: generating information maps
Proceedings of the 21st international conference on World Wide Web
Practical collapsed variational bayes inference for hierarchical dirichlet process
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Temporal corpus summarization using submodular word coverage
Proceedings of the 21st ACM international conference on Information and knowledge management
Representing documents through their readers
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Diversity maximization under matroid constraints
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Information cartography: creating zoomable, large-scale maps of information
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
Social circle analysis on ego-network based on context frequent pattern mining
Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
Discovering social circles in ego networks
ACM Transactions on Knowledge Discovery from Data (TKDD) - Casin special issue
Hi-index | 0.00 |
In recent years, the blogosphere has experienced a substantial increase in the number of posts published daily, forcing users to cope with information overload. The task of guiding users through this flood of information has thus become critical. To address this issue, we present a principled approach for picking a set of posts that best covers the important stories in the blogosphere. We define a simple and elegant notion of coverage and formalize it as a submodular optimization problem, for which we can efficiently compute a near-optimal solution. In addition, since people have varied interests, the ideal coverage algorithm should incorporate user preferences in order to tailor the selected posts to individual tastes. We define the problem of learning a personalized coverage function by providing an appropriate user-interaction model and formalizing an online learning framework for this task. We then provide a no-regret algorithm which can quickly learn a user's preferences from limited feedback. We evaluate our coverage and personalization algorithms extensively over real blog data. Results from a user study show that our simple coverage algorithm does as well as most popular blog aggregation sites, including Google Blog Search, Yahoo! Buzz, and Digg. Furthermore, we demonstrate empirically that our algorithm can successfully adapt to user preferences. We believe that our technique, especially with personalization, can dramatically reduce information overload.