This paper describes methods for relating (thread- ing) multiple newspaper articles, and for visualizing various characteristics of them by using a directed graph. A set of articles is represented by a set of word vectors, and the similarity between the vec- tors is then calculated. The graph is constructed from the similarity matrix. By applying some con- straints on the chronological ordering of articles, an efficient threading algorithm that runs in O(n) time (where n is the number of articles) is obtained. The constructed graph is visualized with words that rep- resent the topics of the threads, and words that rep- resent new information in each article. The thread- ing technique is suitable for Webcasting (push) ap- plications. A threading server determines relation- ships among artic...

Click Here to View the Paper In XML Format