<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2213">
  <Title>A Method for Relating Multiple Newspaper Articles by Using Graphs, and Its Application to Webcasting</Title>
  <Section position="6" start_page="1311" end_page="1311" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have described methods for threading multiple articles and for visualizing various characteristics of them by using directed graphs. An efficient threading algorithm whose complexity is O(n) (where n is the number of articles) was introduced with some constraints on the chronological ordering of articles.</Paragraph>
    <Paragraph position="1"> Some further work can be done to improve our method. There are sonie strategies for constructing an adjacency matrix from a distance matrix. Different strategies give different graphs. We are now evaluating our method by testing it with various strategies. null The development of a technique for visualizing directed graphs is another task for the future. Although directed graphs show more useful information than tree structures, they are difficult to display in a readily understandable way. Software tools for handling graphs are also required.</Paragraph>
    <Paragraph position="2"> Formal features of graphs can express the underlying characteristics of articles. More efficient and useful algorithms are needed to overcome the problem of information overload.</Paragraph>
  </Section>
class="xml-element"></Paper>