Graph decomposition approaches for terminology graphs

Authors:
Mohamed Didi Biha;Bangaly Kaba;Marie-Jean Meurs;Eric SanJuan
Affiliations:
LANLG, Avignon, France;LIMOS, Université Blaise Pascal Clermont 2, Aubiere cedex, France;LIA, Université d'Avignon, Avignon, Cedex 9, France;LIA, Université d'Avignon, Avignon, Cedex 9, France
Venue:
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Year:
2007

Citing 8
Cited 1

Visualizing science by citation mapping

Journal of the American Society for Information Science
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
The vertex separator problem: a polyhedral investigation

Mathematical Programming: Series A and B
CiteSpace II: Detecting and visualizing emerging trends and transient patterns in scientific literature

Journal of the American Society for Information Science and Technology
Text mining without document context

Information Processing and Management: an International Journal - Special issue: Informetrics
Graph theoretic modeling of large-scale semantic networks

Journal of Biomedical Informatics
Multiscale visualization of small world networks

INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
ParIS: visualizing ideas and information in a resource-based learning scenario

Knowledge and Information Visualization

Decomposition of terminology graphs for domain knowledge acquisition

Proceedings of the 17th ACM conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

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.