<?xml version="1.0" standalone="yes"?>
<Paper uid="W97-0111">
  <Title>Clustering Co-occurrence Graph based on Transitivity</Title>
  <Section position="10" start_page="98" end_page="98" type="concl">
    <SectionTitle>
8 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have discussed a method to duster a co-occurrence graph obtained from a corpus, from a graph-theoretical viewpoint. A graph has no ambiguity if its branches, co-occurrence relations are transitive. This graph theoretical approach using graph is characteristic and it differs from the conventional clustering method.</Paragraph>
    <Paragraph position="1"> We proposed an algorithm to extract subgraphs whose branches are transitive co-occurrence relations and discussed its features. The effectiveness of our method was examined using the 30M corpus.</Paragraph>
  </Section>
class="xml-element"></Paper>