Skip to Main content Skip to Navigation
Journal articles

Sub-ontology extraction using hyponym and hypernym closure on is-a directed acyclic graphs

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [49 references]  Display  Hide  Download

https://hal.inrae.fr/hal-02645875
Contributor : Migration Prodinra Connect in order to contact the contributor
Submitted on : Friday, May 29, 2020 - 3:01:20 AM
Last modification on : Wednesday, October 20, 2021 - 1:23:01 AM

File

Publis013-agap-001_Ranwez_IEEE...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02645875, version 1
  • PRODINRA : 190185

Citation

Vincent Ranwez, Sylvie Chabert-Ranwez, Stefan Janaqi. Sub-ontology extraction using hyponym and hypernym closure on is-a directed acyclic graphs. IEEE Transactions on Knowledge and Data Engineering, Institute of Electrical and Electronics Engineers, 2013, 24 (12), pp.2288-2300. ⟨hal-02645875⟩

Share

Metrics

Record views

69

Files downloads

149