Abstract
This paper proposes a novel text mining method for a document set based on graph-based analysis. Graph-based analysis first identifies the similarity links in the document set and then determines core documents, those that have the highest level of centrality. Each core document represents a different topic. Next, the centrality scores are used together with the graph structure to identify those documents that are associated with the core documents. This process results in a predetermined number of topics. For each topic the user is presented with a set of documents in three-layer structure: core document, supplemental documents (those that are strongly associated with the core document), and subtopic documents (those that are only slightly associated with the core document and supplemental documents). The user can select any the topics and browse the documents related to that topic. Furthermore, the user can select documents according to the level; for example, subtopic documents are assumed to contain information that differs from the topic indicated and so might be interesting. In analyses of a set of newspaper articles, we evaluate “accuracy of topic identification” and “accuracy of document collecting related to the topics”. Furthermore, we show an example of document set visualization based on graph structure and centrality score; the results indicate the method’s usefulness for browsing and analyzing document sets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Proceedings of WWW7, pp. 107–117 (1998)
Erkan, G., Radev, D.R.: LexRank: Graph-based Lexical Centrality as Salience in Text Summarization. Journal of Artificial Intelligence Research 22, 457–479 (2004)
Ferragina, P., Gulli, A.: The Anatomy of a Hierarchical Clustering Engine for Web-page, News and Book Snippets. In: Perner, P. (ed.) ICDM 2004. LNCS, vol. 3275, pp. 395–398. Springer, Heidelberg (2004)
He, X., Ding, C.H.Q., Zha, H., Simon, H.D.: Automatic Topic Identification Using Webpage Clustering. In: Proc. of ICDM 2001, pp. 195–202 (2001)
Hearst, M., Pedersen, J.: Reexamining the cluster hypothesis: scatter/gather on retrieval results. In: Proc. of SIGIR 1996, pp. 76–84 (1996)
Kamvar, S.D., Klein, D., Manning, C.D.: Spectral Learning. In: Proc. of IJCAI 2003, pp. 561–566 (2003)
Kleinberg, J.: Authoritative source in a hyperlinked environment. Journal of the ACM 46, 604–632 (1999)
Kurland, O., Lee, L.: PageRank without hyperlinks: Structural re-ranking using links induced by language models. In: Proc. of SIGIR 2005, pp. 306–313 (2005)
Leuski, A.: Evaluating document clustering for interactive information retrieval. In: Proc. of CIKM 2001, pp. 33–40 (2001)
Mihalcea, R., Tarau, P.: TextRank: Bringing Order into Texts. In: Proc. of EMNLP 2004, pp. 404–411 (2004)
Toda, H., Kataoka, R.: A search result clustering method using informatively named entities. In: Proc. of WIDM 2005, pp. 81–86 (2005)
Yamada, T., Saito, K., Ueda, N.: Cross-Entropy Directed Embedding of Network Data. In: Proc. of ICML 2003, pp. 832–839 (2003)
Zamir, O., Etzioni, O.: Grouper: A Dynamic Clustering Interface to Web Search Results. In: Proc. of WWW8, pp. 1361–1374 (1999)
Zeng, H.J., He, Q.C., Chen, Z., Ma, W.Y., Ma, J.: Learning to Cluster Web Search Results. In: Proc. of SIGIR 2004, pp. 210–217 (2004)
Zhao, Y., Karypis, G.: Evaluation of Hierarchical Clustering Algorithms for Document Datasets. In: Proc. of CIKM 2002, pp. 515–524 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Toda, H., Kataoka, R., Kitagawa, H. (2006). Topic Structure Mining for Document Sets Using Graph-Based Analysis. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_32
Download citation
DOI: https://doi.org/10.1007/11827405_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37871-6
Online ISBN: 978-3-540-37872-3
eBook Packages: Computer ScienceComputer Science (R0)