{"title":"Apogee: Application Ontology Generation from Domain Ontologies","authors":"I. Exman, Danil Iskusnov","doi":"10.5220/0005181000310042","DOIUrl":null,"url":null,"abstract":"To achieve runnable knowledge from the highest abstraction level of an application one needs to start with a set of application ontologies. But application ontologies are not readily available in the literature. One needs to generate dedicated and smaller application ontologies from larger generic domain ontologies. The main problem to be solved is to generate application ontologies with optimal size given two opposing criteria: to enlarge the selected domain ontology segments to include most relationships between relevant concepts, as opposed to reduce the same segments to exclude irrelevant terms. The proposed solution is to traverse the domain ontology just one level upward from the last relevant keywords found. The work also describes a chain of algorithms and practical techniques to reach the proposed solution stage. Finally, case studies are used to actually illustrate the whole approach.","PeriodicalId":82708,"journal":{"name":"Sky and telescope","volume":"6 1","pages":"31-42"},"PeriodicalIF":0.0000,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sky and telescope","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0005181000310042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
To achieve runnable knowledge from the highest abstraction level of an application one needs to start with a set of application ontologies. But application ontologies are not readily available in the literature. One needs to generate dedicated and smaller application ontologies from larger generic domain ontologies. The main problem to be solved is to generate application ontologies with optimal size given two opposing criteria: to enlarge the selected domain ontology segments to include most relationships between relevant concepts, as opposed to reduce the same segments to exclude irrelevant terms. The proposed solution is to traverse the domain ontology just one level upward from the last relevant keywords found. The work also describes a chain of algorithms and practical techniques to reach the proposed solution stage. Finally, case studies are used to actually illustrate the whole approach.