The Community for Technology Leaders
Green Image
Issue No. 12 - Dec. (2012 vol. 24)
ISSN: 1041-4347
pp: 2288-2300
Sylvie Ranwez , LGI2P/EMA Research Centre, Site EERIE, Nîmes
Stefan Janaqi , LGI2P/EMA Research Centre, Site EERIE, Nîmes
Vincent Ranwez , Université Montpellier II, Montpellier
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 subontology focused on their current concepts of interest. A subontology 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 (lca) and greatest common descendant (gcd). 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 subontology focused on concepts annotating a gene related to breast cancer.
INDEX TERMS
Ontologies, Semantics, Humans, Context, Indexes, Filtering, Visualization, greatest common descendant, Subontology extraction, ontology transformation, directed acyclic graph, least common ancestor
CITATION
Sylvie Ranwez, Stefan Janaqi, Vincent Ranwez, "Subontology Extraction Using Hyponym and Hypernym Closure on is-a Directed Acyclic Graphs", IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. , pp. 2288-2300, Dec. 2012, doi:10.1109/TKDE.2011.173
108 ms
(Ver 3.1 (10032016))