Temporal summaries of new topics
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
The Journal of Machine Learning Research
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering evolutionary theme patterns from text: an exploration of temporal text mining
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Projected Gradient Methods for Nonnegative Matrix Factorization
Neural Computation
Maximizing Non-Monotone Submodular Functions
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
On quantifying changes in temporally evolving dataset
Proceedings of the 17th ACM conference on Information and knowledge management
Turning down the noise in the blogosphere
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Connecting the dots between news articles
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Evolutionary timeline summarization: a balanced optimization framework via iterative substitution
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Trains of thought: generating information maps
Proceedings of the 21st international conference on World Wide Web
Overlapping community detection at scale: a nonnegative matrix factorization approach
Proceedings of the sixth ACM international conference on Web search and data mining
Personalized collaborative clustering
Proceedings of the 23rd international conference on World wide web
Finding progression stages in time-evolving event sequences
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.00 |
In an era of information overload, many people struggle to make sense of complex stories, such as presidential elections or economic reforms. We propose a methodology for creating structured summaries of information, which we call zoomable metro maps. Just as cartographic maps have been relied upon for centuries to help us understand our surroundings, metro maps can help us understand the information landscape. Given large collection of news documents our proposed algorithm generates a map of connections that explicitly captures story development. As different users might be interested in different levels of granularity, the maps are zoomable, with each level of zoom showing finer details and interactions. In this paper, we formalize characteristics of good zoomable maps and formulate their construction as an optimization problem. We provide efficient, scalable methods with theoretical guarantees for generating maps. Pilot user studies over real-world datasets demonstrate that our method helps users comprehend complex stories better than prior work.