Subontology Extraction Using Hyponym and Hypernym Closure on is-a Directed Acyclic Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Knowledge and Data Engineering Année : 2012

Subontology Extraction Using Hyponym and Hypernym Closure on is-a Directed Acyclic Graphs

Résumé

Ontologies are successfully used as semantic guides when navigating through the huge and ever increasing quantity of digital documents. Nevertheless, the size of numerous domain ontologies tends to grow beyond the human capacity to grasp information. This growth is problematic for a lot of key applications that require user interactions such as document annotation or ontology modification/evolution. The problem could be partially overcome by providing users with a sub-ontology focused on their current concepts of interest. A sub-ontology restricted to this sole set of concepts is of limited interest since their relationships can generally not be explicit without adding some of their hyponyms and hypernyms. This paper proposes efficient algorithms to identify these additional key concepts based on the closure of two common graph operators: the least common-ancestor and greatest common descendant. The resulting method produces ontology excerpts focused on a set of concepts of interest and is fast enough to be used in interactive environments. As an example, we use the resulting program, called OntoFocus (http://www.ontotoolkit.mines-ales.fr/), to restrict, in few seconds, the large Gene Ontology (~30,000 concepts) to a sub-ontology focused on concepts annotating a gene related to breast cancer.
Fichier principal
Vignette du fichier
TKDE-2011-02-0051_manuscript.pdf (812.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00797150 , version 1 (05-03-2013)

Identifiants

  • HAL Id : hal-00797150 , version 1

Citer

Vincent Ranwez, Sylvie Ranwez, Stefan Janaqi. Subontology Extraction Using Hyponym and Hypernym Closure on is-a Directed Acyclic Graphs. IEEE Transactions on Knowledge and Data Engineering, 2012, 24 (12), pp.2288-2300. ⟨hal-00797150⟩
244 Consultations
287 Téléchargements

Partager

Gmail Facebook X LinkedIn More