Unweaving a web of documents

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 574-579

  Guha, R ^a   Sivakumar, D ^b   Kumar, Ravi ^b   Sundaram, Ravi ^c  

^a GOOGLE INC   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c Northeastern University   (United States)

Author keywords

Graph algorithms; Graph decomposition; News threads

Indexed keywords

COST FLOW; GRAPH ALGORITHMS; GRAPH DECOMPOSITION; NEW THREADS;

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; DYNAMIC PROGRAMMING; GRAPH THEORY; TEXT PROCESSING; WEB BROWSERS;

WEBSITES;

EID: 32344438748     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081870.1081939     Document Type: Conference Paper

References (25)

1. G. Aggarwal, M. Datar, S. Rajagopalan, and M. Ruhl. On the streaming model augmented with a sorting primitive. In 45th FOCS, pages 540-549, 2004.
2. R. Agrawal, S. Rajagopalan, R. Srikant, and Y. Xu. Mining newsgroups using networks arising from social behavior. In 12th WWW, pages 529-535, 2003.
3. J. Allan. Automatic Hypertext Construction, PhD thesis, Cornell U., 1995.
4. J. Allan, J. Carbonell, G. Doddington, J. Yamron, and Y. Yang. Topic detection and tracking pilot study: Final report. DARPA Broadcast News Transcription and Understanding Workshop, 1998.
5. J. Allan, R. Gupta, and V. Khandelwal, Temporal summaries of new topics, In 24th SIGIR, pages 10-18, 2001.
6. W. Blustein. Hypertext Versions of Journal Articles: Computer-aided Linking and Realistic Human-based Evaluation. PhD thesis, U. Western Ontario, 1999.
7. T. Dalamagas. NHS: A tool for the automatic construction of news hypertext, 1998.
8. T. Dalamagas and M. D. Dunlop. Automatic construction of news hypertext. In HIM, pages 265-278, 1997.
9. J. Edmonds and R. M. Karp. Theoretical improvements in algorithm efficiency for network flow problems, JACM, 19:248-264, 1972.
10. G. W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In 6th KDD, pages 150-160, 2000.
11. M. Garey and D. Johnson. Computers and Intractability. Freeman, 1979.
12. A. Goldberg and R. Tarjan. Solving minimum-cost flow problems by successive approximation. In 19th STOC, pages 7-18, 1987.
13. S. J. Green. Automatically generating hypertext in newspaper articles by computing semantic relatedness. In Joint Conf. on New Methods in Lang. and Comp. Nat, Lang. Learning, pages 101-110, 1998.
14. M. Henzinger, B.-W. Chang, B. Milch,and S. Brin. Query-free news search. In 12th WWW, pages 1-10, 2003.
15. 5/2 algorithm for maximum matchings in bipartite graphs. SICOMP, 24(2):225-231, 1973.
16. J. Kleinberg. Bursty and hierarchical structure in streams. In 8th KDD, pages 91-101, 2002.
17. R. Kumar, U. Mahadevan, and D. Sivakumar. A graph-theoretic approach to extract storylines from search results. In 10th KDD, pages 216-225, 2004.
18. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for emerging cyber-communities. Computer Networks, 31(11-16):1481-1493, 1999.
19. J.-J. Pan. Path Partition and Its Variation in Graphs. PhD thesis, National Chiao Tung U., 2004.
20. A. F. Smeaton and P. J. Morrissey. Experiments on the automatic construction of hypertexts from texts. The New Review of Hypermedia and Multimedia, 1:23-39, 1995.
21. D. A. Smith. Detecting events with date and place information in unstructured text. In 2nd ACM/IEEE-CS DL, pages 191-196, 2002.
22. R. Swan and J. Allan. Automatic generation of overview timelines. In 23rd SIGIR, pages 49-56, 2000.
23. E. Tardos. A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5:247-256, 1985.
24. N. Uramoto and K. Takeda. A method for relating multiple newspaper articles by using graphs, and its application to webcasting. In 36th ACL, pages 1307-1313, 1998.
25. Y. Yang, T. Pierce, and J. Carbonell. A study on retrospective and on-line event detection, In 21st SIGIR, pages 28-36, 1998.