
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.
Automatic, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], ontology transformation, Least common ancestor, [SCCO.COMP]Cognitive science/Computer science, Directed acyclic graph, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [SPI.AUTO]Engineering Sciences [physics]/Automatic, Machine Learning, Ontology transformation, [SCCO.COMP] Cognitive science/Computer science, Automatique / Robotique, Apprentissage Machine, [II. Artificial Intelligence / IV. Knowledge Representation Formalisms and Methods] [II. Discrete Mathematics / II. Graph Theory], greatest common descendant, 006, Computer science, Sub-ontology extraction, 004, Greatest common descendant, [SPI.AUTO] Engineering Sciences [physics]/Automatic, Informatique (Sciences cognitives), directed acyclic graph, least common ancestor, sub-ontology extraction;ontology transformation;directed acyclic graph;least common ancestor;greatest common descendant, sub-ontology extraction
Automatic, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], ontology transformation, Least common ancestor, [SCCO.COMP]Cognitive science/Computer science, Directed acyclic graph, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [SPI.AUTO]Engineering Sciences [physics]/Automatic, Machine Learning, Ontology transformation, [SCCO.COMP] Cognitive science/Computer science, Automatique / Robotique, Apprentissage Machine, [II. Artificial Intelligence / IV. Knowledge Representation Formalisms and Methods] [II. Discrete Mathematics / II. Graph Theory], greatest common descendant, 006, Computer science, Sub-ontology extraction, 004, Greatest common descendant, [SPI.AUTO] Engineering Sciences [physics]/Automatic, Informatique (Sciences cognitives), directed acyclic graph, least common ancestor, sub-ontology extraction;ontology transformation;directed acyclic graph;least common ancestor;greatest common descendant, sub-ontology extraction
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
