A strongly polynomial minimum cost circulation algorithm
Combinatorica
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Automatic hypertext construction
Automatic hypertext construction
A study of retrospective and on-line event detection
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Automatic generation of overview timelines
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Temporal summaries of new topics
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Detecting events with date and place information in unstructured text
Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
Bursty and hierarchical structure in streams
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
WWW '03 Proceedings of the 12th international conference on World Wide Web
Mining newsgroups using networks arising from social behavior
WWW '03 Proceedings of the 12th international conference on World Wide Web
Hypertext versions of journal articles: computer-aided linking and realistic human-based evaluation
Hypertext versions of journal articles: computer-aided linking and realistic human-based evaluation
A method for relating multiple newspaper articles by using graphs, and its application to Webcasting
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
A graph-theoretic approach to extract storylines from search results
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
On the Streaming Model Augmented with a Sorting Primitive
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Automatically generating hypertext in newspaper articles by computing semantic relatedness
NeMLaP3/CoNLL '98 Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning
NHS: a tool for the automatic construction of news hypertext
IRSG'98 Proceedings of the 20th Annual BCS-IRSG conference on Information Retrieval Research
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
We develop an algorithmic framework to decompose a collection of time-stamped text documents into semantically coherent threads. Our formulation leads to a graph decomposition problem on directed acyclic graphs, for which we obtain three algorithms --- an exact algorithm that is based on minimum cost flow and two more efficient algorithms based on maximum matching and dynamic programming that solve specific versions of the graph decomposition problem. Applications of our algorithms include superior summarization of news search results, improved browsing paradigms for large collections of text-intensive corpora, and integration of time-stamped documents from a variety of sources. Experimental results based on over 250,000 news articles from a major newspaper over a period of four years demonstrate that our algorithms efficiently identify robust threads of varying lengths and time-spans.