Skip to main content

Graph Decomposition Approaches for Terminology Graphs

  • Conference paper
MICAI 2007: Advances in Artificial Intelligence (MICAI 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4827))

Included in the following conference series:

  • 1066 Accesses

Abstract

We propose a graph-based decomposition methodology of a network of document features represented by a terminology graph. The graph is automatically extracted from raw data based on Natural Language Processing techniques implemented in the TermWatch system. These graphs are Small Worlds. Based on clique minimal separators and the associated graph of atoms: a subgraph without clique separator, we show that the terminology graph can be divided into a central kernel which is a single atom and a periphery made of small atoms. Moreover, the central kernel can be separated based on small optimal minimal separators.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. ME., B., SB., J.: Graph theoretic modeling of large-scale semantic networks. J. Biomed Inform. 39(4), 451–464 (2006)

    Article  Google Scholar 

  2. SanJuan, E., Ibekwe-SanJuan, F.: Text mining without document context. Information Processing and Management 42, 1532–1552 (2006)

    Article  Google Scholar 

  3. Ibekwe-SanJuan, F.: A linguistic and mathematical method for mapping thematic trends from texts. In: Proc. of the 13th European Conference on Artificial Intelligence (ECAI), Brighton, UK, pp. 170–174 (1998)

    Google Scholar 

  4. Berry, A., Kaba, B., Nadif, M., SanJuan, E., Sigayret, A.: Classification et désarticulation de graphes de termes. In: Proc. of the 7th International conference on Textual Data Statistical Analysis (JADT 2004), Louvain-la-Neuve, Belgium, pp. 160–170 (2004)

    Google Scholar 

  5. Tarjan, R.E.: Amortized computational complexity 6(2), 306–318 (1985)

    Google Scholar 

  6. Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs 16, 47–56 (1974)

    Google Scholar 

  7. Ferrer-i-Cancho, R., Sole, R.V.: The small world of human language. Proceedings of The Royal Society of London. Series B, Biological Sciences 268(1482), 2261–2265 (2001)

    Article  Google Scholar 

  8. Auber, D., Chiricota, Y., Jourdan, F., Melancon, G.: Multiscale visualization of small world networks. In: IEEE Symposition on Information Visualisation, pp. 75–81. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  9. Bui, T., Fukuyama, J., Jones, C.: The planar vertex separator problem: Complexity and algorithms. Manuscript (1994)

    Google Scholar 

  10. Balas, E., de Souza, C.C.: The vertex separator problem: a polyhedral investigation. Math. Program. 103(3), 583–608 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Chen, C.: Citespace ii: Detecting and visualizing emerging trends and transient patterns in scientific literature. JASIST 57(3), 359–377 (2006)

    Article  Google Scholar 

  12. Neumann, A., Gräber, W., Tergan, S.O.: Paris - visualizing ideas and information in a resource-based learning scenario. In: Knowledge and Information Visualization, pp. 256–281 (2005)

    Google Scholar 

  13. Ganter, B., Wille, R.: Formal Concept Analysis. In: Mathematical Foundations, Springer, Heidelberg (1999)

    Google Scholar 

  14. Braam, R., Moed, H., A., A.V.R.: Mapping science by combined co-citation and word analysis. 2. dynamical aspects. Journal of the American Society for Information Science 42(2), 252–266 (1991)

    Article  Google Scholar 

  15. Small, H.: Visualizing science by citation mapping. JASIS 50(9), 799–813 (1999)

    Article  Google Scholar 

  16. Schiffrin, R., Börner, K.: Mapping knowledge domains. In: Schiffrin, R., Börner, K. (eds.) Publication of the National Academy of Science (PNAS), vol. 101(suppl 1), pp. 5183–5185 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alexander Gelbukh Ángel Fernando Kuri Morales

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Didi Biha, M., Kaba, B., Meurs, MJ., SanJuan, E. (2007). Graph Decomposition Approaches for Terminology Graphs. In: Gelbukh, A., Kuri Morales, Á.F. (eds) MICAI 2007: Advances in Artificial Intelligence. MICAI 2007. Lecture Notes in Computer Science(), vol 4827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76631-5_84

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76631-5_84

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76630-8

  • Online ISBN: 978-3-540-76631-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics