Property-Based Quality Measures in Ontology Modeling

Abstract

The development of an appropriate ontology model is usually a hard task. One of the main issues is that ontology developers usually concentrate on classes and neglect the role of properties. This paper analyzes the role of an appropriate property set in providing multi-purpose ontology models with a high level of re-usability in different areas. In this paper, novel quality metrics related to property components are introduced and a conversion method is presented to map the base ontology into models for software development. The benefits of the proposed quality metrics and the usability of the proposed conversion methods are demonstrated by examples from the field of knowledge modeling.

1. Introduction

Ontology as a subfield of knowledge engineering is used for explicit standardized conceptualization of certain problem domains [1]. Ontology frameworks provide tools for semantic modelling and reasoning. Ontologies are increasingly used in various fields, such as knowledge management, information extraction, and the semantic web [2].

Ontology models can be implemented at different levels. Upper ontology [3] covers general concepts used in many application areas. Terms such as thing, human, and task refer to upper ontology entries. Domain ontology [4], on the other hand, involves specific concepts used in only a few application domains.

In the classic approach of Noy and McGuinness [5], an ontology can be used to:

• enable a shared understanding of the information structure;
• enable information reuse in applications;
• apply ontological structures at different stages of IS development, such as analysis, conceptualization, and design.

Nowadays, ontologies can be used as the main tool of automatized process control in many flexible environments.

For many reasons, the development of an appropriate ontology model is usually a hard task. Many efforts have been directed to the creation of methodologies for guiding users in the development of ontologies. Methodological tools such as On-To-Knowledge [6] can help users to build ontologies from scratch. One issue during ontology development is the selection of appropriate components (classes and properties) [7]. By considering many ontology examples, it can be seen that authors usually concentrate on the class level. On the other hand, in other semantic modeling languages, such as the UML model or concept lattices, the attributes and properties play a key role in model structure. Our main motivation here is to show that only an appropriate set of related concepts and properties can provide a high level of interoperability and reusability in the created ontology models. To help designers use an appropriate set of properties, we introduce novel quality metrics based on property measures of the ontology models. In addition to a formal analysis, we present a methodology and program framework to perform the required transformation and calculations. The architecture of the developed framework is presented in Figure 1.

In this paper, we first provide an overview of related ontology quality metrics and compare them with other dominant modeling approaches used in knowledge and software engineering. After a survey of related works, we introduce the formal model of the property-oriented ontology representation. This section presents five novel property-based quality metrics. The next section focuses on develo** algorithms for metric calculation, and provides the implementation details of the methods. In the last section, we present test experiments on the ontology evaluation using the proposed methods.

2. Related Work

To manage the methodological gap between ontology and modeling schema, the DOGMA model [8] introduces a double articulation ontology model. The ontology has two main components: ontology base and ontology commitments. The ontology base contains the standard concept level model elements such as taxonomy and concept assertions. The second component is used to describe the domain-specific ontology rules. These rules can be used to determine the available properties and domain specific integrity constraints.

Considering the practical guidelines for ontology development, a design pattern-oriented method was proposed in [9]. The proposed modular design approach includes the following six main design patterns, covering the different key aspects of the ontology:

• Structural pattern,
• Syntactic pattern,
• Content pattern,
• Presentation pattern,
• Consideration pattern.

Considering the area of Software Engineering (SE) in general, there is a rich literature on the application of ontology tools in SE processes. One of the first proposals on ontology support [10] focused on the software quality issues. The main reason for the importance of ontology tools in SE is that experience shows lack of domain knowledge [11] to be a very risky situation in the software development process. The excellent survey of Ruiz and Hilera [12] presents all the important achievements of this research field. Their survey shows that the whole area of software development and software technology is involved in the development of ontology-based model extensions.

In the majority of proposals, a separate domain ontology model is constructed covering the specific SE development phases. The constructed and validated ontology models are mapped manually or partially automatically into SE models. With regard to automatic map**, the work of Bures [13] presents a method for code generation directly through a high-level and detailed ontology specification, resulting in good consistency of the generated code. A similar approach is presented in [14]; an ontology-oriented programming method is proposed in which the specification of a problem solution is expressed in the form of an ontology. Regarding the semi-automated integration approaches, the constructed ontology model can be used to generate standard SE design models. For example, in [15], the UML document was extended with annotations generated from the related ontology.

There have been proposals in the literature focusing on special schema-oriented extensions of the base ontology model. In [16], the conflicts caused by multiple inheritance were investigated in detail, with a a semi-automatic approach proposed to deal with such conflicts. The work of [17] highlighted the importance of integrating OOP concepts with standard knowledge engineering approaches. Based on these considerations, we focus here on the integration of ontological and schematic approaches. The goal of our work is to investigate the feasibility of a property-based ontology approach.

An important related modeling approach is the field of Formal Concept Analysis (FCA). FCA [18,19] provides tools to manage and investigate concept sets generated from an input formal context. A formal context is defined as a triplet $(G,T,I)$, where I is a binary relation between G (a set of objects) and T (a set of attributes); $(x,y)\in I$ is met if and only if the attribute $y\in T$ is true for the object $x\in G$. Two derivation operators $(g,f)$ are introduced as map**s between the powersets of G and T. For $A\subseteq G,B\subseteq T$,

$$f:2^G\to 2^{T}f\left(A\right)=\left\{m\in T|\forall o\in A:(o,m)\in I\right\}$$

$$g:2^T\to 2^G:g\left(B\right)=\left\{o\in G|\forall m\in B:(o,m)\in I\right\}$$

For a context $(G,T,I)$, a formal concept is defined as a pair $(A,B)$ for which the following conditions are met:

• $A\subseteq G$
• $B\subseteq T$
• $A=g\left(B\right)$
• $B=f\left(A\right)$.

An important aspect in FCA is the fact that a concept is defined as a pair of related object and attribute sets. Thus, every concept is uniquely identified in its context by the corresponding object set or attribute set. Here, we note that the objects in FCA are the atoms in the concept lattice, i.e., they correspond to the individuals in the ontology model. Considering these attributes, we can generally consider them as predicates having true or false Boolean values. In this sense, FCA attributes may correspond to property–value pairs in ontology. Thus, as schematic models highlight the viewpoint that attributes (predicates, properties) are the key elements in identifying the concepts, in FCA the attributes must be first-order members of semantic models.

One of the first models integrating ontology and FCA methods was presented in [20]. Their proposed model was based on the following principles:

• Concepts are described by their properties;
• The concept hierarchy is determined by the properties;
• The same property sets mean the same concepts.

The construction of ahn ontology is controlled and supported by a corresponding concept lattice. Every ontology can be mapped to a unique context and FCA concept lattice. The ontology design tool can perform the following supporting actions:

• Visualization of the related FCA concept lattice;
• If two concepts are assigned to the same property set, an error message can be raised to modify the ontology;
• After selecting a set of properties, a new related concept is generated, the system determines its position in the taxonomy graph, and the new concept is inserted into the current concept lattice.

A similar integration approach was presented in [21] for constructing an ontology to describe the semantics of business actions. The target ontology was constructed in a distributed way by integrating local component descriptions. The input component models describe the relevant properties of the actions, then the integration module coverts them into concepts using the FCA engine.

In the proposal presented in [22], an FCA concept lattice based on property relationships was constructed to determine the taxonomy of the ontology classes. Each class was associated with the FCA concept having the largest number of shared properties.

Regarding applied cases, one of the first publications was the development of a clinical domain ontology [23]. This ontology was generated from a set of 368 textual patient discharge reports using natural language preprocessing modules to convert texts into terms and attributes. Later, several other application studies on ontology construction with FCA support were worked out, among others, in the fields of tourism [24] and naval operations [25].

Another important approach is the combination of direct rule-based languages with FCA to construct domain ontologies [26]. Rule-based language can be used to enrich an ontology with additional relationships and axioms [27].

Ontology is an actively investigated research domain. Considering recent works, we highlight the following fields:

• Integration of ontology into smart systems, such as e-tutor systems [28,29]
• Application of ontology-based tools in schematic modeling [30]
• Integration of ontology and machine learning methods [31]
• Ontology in knowledge mining [32].

Due to the complexity of ontological modeling and to the strong relationship and inference with other semantic modeling tools, there is a need to provide objective measures of the quality of ontological modeling and schema. In the literature, there are works analysing the requirements [33,34]; however, there is no general and widely accepted theoretical and technical foundation for the synthesis of these requirements. Thus, the development of efficient tools to support modeling of ontologies remains a real and relevant research topic in the knowledge engineering community. With regard to approaches proposed in the literature, it is apparent that the proposed metrics focus mainly on the structure of class relationships, and to an extent cover the distribution of instances [20].

Summarizing the previous works, we can highlight the following challenges:

• There is a need for better integration of different semantic modelling tools;
• The integration of ontology and OOP methods is an important problem domain;
• Ontology quality measures should be adapted to the special requirements of ontology–OOP model integration.

In the next section, an analysis of ontology quality metrics is presented; we then introduce a novel attribute-oriented ontology modeling approach that provides a set of related metrics.

3. Ontology Modeling and Quality Measures

3.1. Quality Metrics

There are many quality requirements of ontology models that should be considered during the ontology construction process. On the other hand, from the viewpoint of practical applications, better support for quality ontology development is a key factor in the desired success of the ontology model.

Considering the difficulties in practical ontology modeling, the following factors can be emphasized:

• Many developers come from the database domain, where a closed-world approach is the dominant model. In contrast, the ontology model uses an open-world approach, and explicit additional axioms must be created to provide a more suitable view.
• An ontology should cover a wide range of concepts, and global ontologies are usually constructed by many partial (domain-specific) ontology models having different granularity and functionality. Due to the large size of ontology models, an automatic integration tool that can discover hidden inconsistencies is usually required.
• Subjectivity., i.e., there are no golden rules and guidelines for ontology design, and there exist different approaches to ontology development (e.g., both inductive and deductive approaches [35], resulting in very different ontology models for the same domain).
• In many OOP models, the main relationship between classes is the specialization relationship. Child classes inherit the properties of the parent class automatically. In ontology modeling, the declaration of a domain axiom on a property does not mean an automatic inheritance; a separate subclass axiom must be added to the corresponding ontology.

In the next sections, we provide an overview of research results related to ontology quality. A common approach is to adapt the standard software quality metrics to ontology [35]. For example, [36] proposed following quality aspects: syntactic quality, semantic quality, pragmatic quality, and social quality. Considering the different approaches in the literature, we can categorize the ontology-specific quality aspects into the following three main areas [34,37]:

• schema and type definitions;
• the amount and the resolution of the data;
• clarity, compatibility, and usability.

Unfortunately, it is a difficult task to construct a common set of metrics which objectively describe all aspects of ontology quality. In the next section, we present the most commonly used examples, which generally emphasize important properties of the ontology.

3.1.1. Structural Measures

As ontology models are implemented using graphs, various authors have introduced metrics to measure the complexity and quality of the graph structure. The main aspects within structural metrics cover, among others, the balancing and density (richness) measures of the graph.

Using the notation of the formal ontology model presented in [37], the ontology O is provided by

$$O:=\{C,P,A,H^C,prop,att\},$$

where:

• C: the set of concepts;
• P: the set of relations;
• A: the set of properties;
• $H^C\subseteq C\times C$: concept taxonomy;
• $prop$: $P\to C\times C$, which relates concepts non-taxonomically, that is, every property may have domain and range axioms;
• $att$: $A\to C$, which relates concepts with literal values.

In the literature [37], the following quality measures are used for ontology evaluations:

• Relation Richness: $RR={\displaystyle \frac{\left|P\right|}{\left|SC\right|+\left|P\right|}},$ where $SC$ denotes the set of subclass relationships. An ontology that contains many relations other than class–subclass relations is richer than a taxonomy with only class–subclass relationships.
• Property Richness: $AR={\displaystyle \frac{\left|att\right|}{\left|C\right|}}.$ It is assumed that as more properties are assigned to classes, more information can be conveyed in the ontology model.
• Inheritance Richness: $IR={\displaystyle \frac{{\sum }_{C_i\in C}\left|H^C(C_1,C_i)\right|}{\left|C\right|}}$, which is defined as the average number of subclasses per class.
• Class Richness: This value shows the ratio of the number of classes that have instances and the total number of classes.
• Average Population: $P={\displaystyle \frac{\left|I\right|}{\left|C\right|}},$ where I is the number of instances; this shows the average number of instances for a class.
• Cohesion: This can be defined as the number of disjoint components of the ontology graph; a value of 1 signifies strong cohesion.
• Importance of a Class: This metric shows the importance of a class $C_i$ as the number of instances that belong to the subtree rooted at $C_i$ compared to the total number of instances.
• Fullness: The fullness of a class $C_i$ is defined as the actual number of instances that belong to the subtree rooted at $C_i$ compared to the expected number of instances under the subtree.
• Inheritance Richness: This shows the average number of subclasses per class in the subtree related to $C_i$.
• Connectivity: This metric is defined for a class $C_i$ as the number of instances of other classes that are connected to instances of $C_i$.

An alternative set of graph-oriented quality metrics has been proposed by [38], including the following heuristic elements:

• Number of objects: the number of individuals belonging to a class;
• Number of properties: the number of predicates belonging to a class;
• Number of children: the number of subclasses;
• Number of parents: the number of superclasses;
• Depth of inheritance tree: the length of the longest path in the covered subgraph;
• Centrality measure: how far the depth of the class is from the average depth of all classes;
• Density measure: the number of related classes.

As can be seen, these metrics are quantitative metrics against the schema of the ontology. The quality may relate to the integrity aspects of the ontology as well. A schema can be considered a low quality one when it contains a large number of conflicts [39]. This model distinguishes the following integrity measures:

• property assertion conflicts;
• class assertion conflicts;
• statement assertion conflicts.

Methods for checking integrity can be extended to the instance level as well [40].

3.1.2. Usability Metrics

The usability factor can be investigated from many different aspects. The usual categorization involves the following elements:

• Human aspects, i.e., the readability and understandability of the ontology;
• Compatibility aspects, i.e., are the instances derived from the same schema definition compatible with each others or not;
• Technical aspects, that is, applicability of the ontology must be measured considering the available software tools.

In [35], the following practical measures were proposed to evaluate the quality of ontology models:

• Computational efficiency (the size of the model);
• Adaptability (involving cohesion and coupling);
• Clarity (unambiguous naming);
• Accuracy (which shows the agreement between the constructed model and expert knowledge about the domain);
• Completeness (all relevant information is covered by the ontology model);
• Consistency (the ontology does not include or allow for any contradictions).

3.2. Key Issues in Ontology Design

Regarding the approaches proposed in the literature, it can be seen that the proposed metrics focus mainly on the structure of class relationships, and to an extent cover the distribution of the instances. In [20], it is stated that ontology design usually starts and stops with designing taxonomy. Our motivation here is to show that the properties or attributes are important factors of ontology quality. The attributes play an important role in data and knowledge modeling, as they convey the concrete data values, while classes can be considered as containers of the related attributes. The correctness of a data model is based primarily on the correct structure of the attributes. The proposed model to enhance the role of properties in ontologies is based on the adoption of a conceptual description following Formal Concept Analysis (FCA) for ontology modeling.

4. Property-Based Ontology Representation

4.1. Formal Model

In this section, we introduce a property-based ontology description approach for OWL ontologies. The input ontology model is provided by

$$\mathcal{O}:=\{\mathcal{C},\mathcal{I},\prec ,\mathcal{P},\mathcal{T}\},$$

where

• $\mathcal{C}$: the set of concepts;
• $\mathcal{I}$: the set of individuals;
• $\prec \subset \mathcal{C}\times \mathcal{C}$: the concept taxonomy relationship (acyclic);
• $\mathcal{P}=\{p:\mathcal{I}\to do{m}_p\}$: the set of properties, where $do{m}_p$ denotes the value set of property p; The properties can be used as follows:

  -

  in individual assertion triplets $(i,p,v)$, in which case the value of p is equal to v and $p\left(i\right)=v$;

  -

  in class axioms of the following forms:

  ∗

  p domain c ( or $\exists p.\top \subseteq c$ )

  ∗

  $c\subseteq \exists p.v$

  ∗

  $c\subseteq =p.v$

  where the symbol v denotes the value of property p;

• $\mathcal{T}\subset \mathcal{I}\times \mathcal{C}$: type assignment to the individuals.

Starting with the input ontology, the first step is to generate the related set of base properties, where every property–value pair found in the ontology corresponds to a base attribute:

$$\mathcal{A}=\left\{a\right\}=\left\{\right(p,v\left)\right|p\in \mathcal{P}\wedge (p,v)\mathrm{occurs}\mathrm{in}\mathrm{an}\mathrm{assertion}\mathrm{triplet}\mathrm{or}\mathrm{in}\mathrm{a}\mathrm{class}\mathrm{axiom}\left)\right\}$$

We can extend the attribute set with generalization of the property values:

$$\left\{\right(p,\top \left)\right|p\in \mathcal{P}\}\subset \mathcal{A}$$

For an arbitrary $a\in \mathcal{A}$ and $i\in \mathcal{I}$, the symbol $a\left(i\right)$ is true if individual i meets property a. The attribute notation $(p,\top )$ is true only if, for some value v, that property $(p,v)$ is met. In this case, the value of the property is not important.

In the next step, we introduce a new attribute property map**:

$$A:\mathcal{C}\to \wp \left(\mathcal{A}\right),A^{\prime }:\mathcal{I}\to \wp \left(\mathcal{A}\right)$$

where

• $\forall i\in \mathcal{I}:A^{\prime }\left(i\right)=\left\{a\right|a\left(i\right)\}$
• $\forall c\in \mathcal{C}:A\left(c\right)=\left\{a\right|\forall i\in c:a\left(i\right)\}$

The set $A\left(c\right)$ corresponds to the intent set of the formal concepts in FCA. In order to determine the $A\left(c\right)$ sets, we perform a sequence of specialization and generalization steps. In the case of specialization, the properties of parent concepts are inferred to the lower levels, that is, to the descendant concepts. The explicit specialization process is based on property-oriented class axioms in the ontology. Having an axiom $c\subseteq \exists a$ or $c\subseteq =a$, we can conclude that

$$a\in A\left(c\right).$$

If $c_1\prec c_2\wedge a\in A\left(c_2\right)$, then

$$a\in A\left(c_1\right)$$

is met as well. The specialization process terminates when all of the individuals are processed. Thus, an updated $A^{\prime }\left(i\right)$ set is obtained for every individual. The result is a context in which the objects correspond to the individuals. A row related to individual i contains the elements of $A^{″}\left(i\right)$.

As an example, let us take the following ontology fragment:

    <DataPropertyAssertion>

        <DataProperty IRI=‘‘#color’’/>

        <NamedIndividual IRI=‘‘#chair1’’/>

        <Literal datatypeIRI=‘‘PlainLiteral’’>brown</Literal>

    </DataPropertyAssertion>

    <DataPropertyAssertion>

        <DataProperty IRI=‘‘#age’’/>

        <NamedIndividual IRI=‘‘#peter1’’/>

        <Literal datatypeIRI=‘‘integer’’>12</Literal>

    </DataPropertyAssertion>

    <DataPropertyAssertion>

        <DataProperty IRI=‘‘#name’’/>

        <NamedIndividual IRI=‘‘#peter1’’/>

        <Literal datatypeIRI=‘‘PlainLiteral’’>Peter</Literal>

    </DataPropertyAssertion>

    <DataPropertyAssertion>

        <DataProperty IRI=‘‘#age’’/>

        <NamedIndividual IRI=‘‘#employee1’’/>

        <Literal datatypeIRI=‘‘PlainLiteral’’>old</Literal>

    </DataPropertyAssertion>

    <DataPropertyAssertion>

        <DataProperty IRI=‘‘#name’’/>

        <NamedIndividual IRI=‘‘#employee1’’/>

        <Literal datatypeIRI=‘‘PlainLiteral’’>Tom</Literal>

    </DataPropertyAssertion>

    <DataPropertyAssertion>

        <DataProperty IRI=‘‘#age’’/>

        <NamedIndividual IRI=‘‘#dog1’’/>

        <Literal datatypeIRI=‘‘PlainLiteral’’>old</Literal>

    </DataPropertyAssertion>

The related property set $\mathcal{A}$ contains the following elements:

• $a_1$ = (#color, braun)
• $a_2$ = (#age, 12)
• $a_3$ = (#name, Peter)
• $a_4$ = (#age, old)
• $a_5$ = (#name, Tom).

The generated context table is shown in

Table 1. T1: Generated context table.

	${\mathit{a}}_1$	${\mathit{a}}_2$	${\mathit{a}}_3$	${\mathit{a}}_4$	${\mathit{a}}_5$
#chair1	1	0	0	0	0
#peter1	0	1	1	0	0
#employee1	0	0	0	1	1
#dog1	0	0	0	1	0

:

During the generalization process, we apply the following rule borrowed from the closed world assumption: if an attribute a is valid for every child concept of c, then the attribute is valid for c. This approach is used in FCA modeling as well, among others. In the generalization step, the attribute sets of the concepts are updated, starting with the individuals. For a concept c, the set of related attributes is calculated in the following way:

$$A\left(c\right)={\cap }_{i:i\prec c}A\left(i\right)\bigcap {\cap }_{c^{\prime }:c^{\prime }\prec c}A\left(c^{\prime }\right)$$

In the intersection operation, we use the following value level generalization step. If we have two attributes related to the same property (p) that have different values, we construct an attribute $(p,\top )$. This attribute means that the item has a property p with any value.

We distinguish two domain sets for any attribute a:

• declared domains $D_a^{dec}$
• inferred domains $D_a^{inf}$

A concept c is an element of the inferred domain of attribute a if

$$a\in A\left(c\right)\wedge \neg \exists c^{\prime }:c\prec c^{\prime },a\in A\left(c^{\prime }\right)\wedge c\notin D_a^{dec}$$

We assume that both domain sets contain the ⊤ concept as well, i.e., $\top \in D_a^{dec}$ and $\top \in D_a^{inf}$. The domain set is equal to the union of the declared and inferred domains

$$D_a=D_a^{dec}\cup D_a^{inf}$$

After constructing the attribute sets for every concept and individual, the following consistency check can be performed:

• For every concept, the attribute set cannot be empty, i.e., $\forall c\in \left(C\right):A\left(c\right)\ne \varnothing$
• Different concepts must have different attribute sets, i.e., $\forall c_1,c_2\in \left(C\right):A\left(c_1\right)=A\left(c_2\right)\iff c_1=c_2$
• Domain axioms of the form ’$a\mathrm{domain}c$’ are assigned only to those concepts c which meet the condition that every individual $i^{\prime }$ or concept $c^{\prime }$ having the given attribute are subconcepts of c : $i^{\prime }\prec c,c^{\prime }\prec c$.

If the generated ontology would hurt these rules, then the ontology design expert must update and improve the initial ontology. These rules ensure that the every concept has a corresponding and unique attribute set similar to the FCA approach.

4.2. Property-Based Metrics

The property-oriented ontology model provides an opportunity to introduce specific property-based quality metrics for ontologies. The main principle is that the property distribution in the taxonomy must be well balanced and consistent. To measure this quality, we propose the following measures:

• $m_A=\frac{\left|A\right|}{\left|C\right|}$ : the relative number of the properties. If the value is lower (near or below 1), there are too few properties. If the number is too high, most of the properties are not used in the taxonomy construction.
• $m_e=\frac{|C_{\varnothing }|}{\left|C\right|}$ : the ratio of concepts with empty local (not inherited) property sets. From the viewpoint of FCA, if this value is greater than 0, then the ontology is invalid.
• $m_{=}=\frac{|C_{=}|}{\left|C\right|}$ : the ratio of concepts having non-unique properties set. From the viewpoint of FCA, if this value is greater than 0, then the ontology is invalid.
• $m_l=\frac{{\sum }_{c\notin C_{\varnothing }}\left(\right|A\left(c\right)\left|\right)}{\left|C\right]}$. This measures shows the average length of the local (not empty) property sets. A high value means that many attributes are not relevant in the taxonomy construction.
• $m_c=\frac{{\sum }_a({\sum }_{c\in D_a^{dec}}d(c,D_a^{inf})+{\sum }_{c\in D_a^{inf}}d(c,D_a^{dec}))}{2*\left|A\right|}$: This value shows the total distance between the declared and inferred domain concepts. The distance function $d\left(\right)$ is defined as the length of the shortest path in taxonomy graph between the elements. In the best case, $m_c$ is equal to 0.

As an example, we compare two schema descriptions; the first is an ontology oriented model, while the second is example of the UML-OOP model.

In this example, we first take a sample ontology found on the internet [41]. For the sake of simplicity, we use only the following concept taxonomy fragment:

   Person

      Employee

         Professor

            AssistantProfessor 

            AssociateProfessor

         Lecturer

         Assistant

      Student

         UndergraduateStudent

         GraduateStudent

   Organization

      EducationOrganization

         Department

   Program

      Course

      Seminar

The list of related properties in the ontology, where the first argument denotes the declared domain and the second argument, is the range parameter.

   advisor(Student, Professor)

   affiliateOf(Organization, Person)

   affiliatedOrganization(Organization, Organization)

   alumnus(Organization, Person)

   emailAddress(Person, .STRING)

   head(Organization, Person)

   listedCourse(Program, Course)

   name(Person, .STRING)

   takesCourse(Student, Course)

   teacherOf(Department, Course)

The ontology schema does not contain any individual declarations; thus, the set $D_a^{inf}$ contains only the ⊤ concept for every attribute a. The proposed metrics have the following values for this sample ontology:

• $m_A=10/16=0.62$
• $m_e=11/16=0.69$.
• $m_{=}=0$
• $m_l=2$
• $m_c=1.4$

The second example schema is the UML class diagram presented in Figure 2. If we consider this UML diagram as an ontology model, we have the following metric values:

• $m_A=12/11=1.10$
• $m_e=4/11=0.36$.
• $m_{=}=0$
• $m_l=2$
• $m_c=16/12=1.33$

The third example is the standard pizza ontology [43] presented in Figure 3. The presented reduced ontology contains only fourteen concepts, while the depth of the taxonomy hierarchy is 4. The ontology contains three properties. The first step of ontology processing is to generate the corresponding properties. In this reduced ontology, fifteen attributes were generated from the properties. In the specialization process, eight concepts were extended with inherited attributes (the most widely used derived attribute is ’hasBase some PizzaBase’). In the subsequent generalization phase, the ’NamedPizza’ concept is extended with three new attributes. The resulted ontology can be characterized by the following measures:

• $m_A=15/14=1.07$
• $m_e=4/14=0.07$
• $m_{=}=0$
• $m_l=16/10=1.60$
• $m_c=12/30=0.40$

The fourth example is a large-scale Java project, the source code of the Apache Jena framework (http://jena.apache.org/, (accessed on 26 October 2022). The framework contains 5881 Java source files. We have implemented a class analyzer application using the Reflection API to extract the class definitions. We identified 6264 classes for further analysis. The class/data member/method structure is considered here as a concept/attribute structure. In the processing method, the following simplifications were implemented:

• The data types and signatures in attributes and methods are ignored;
• All attributes and methods are assumed to be public;
• The embedded classes are ignored.

From all source files, we extracted the following data:

• name: fully qualified name of the Java class
• attributes: attribute names
• methods: method names
• parent: name and package of the parent class
• implements: list of interfaces which has implemented in the given class.

The names of the classes are not necessary unique; therefore, it is necessary to consider the fully qualified names of the classes. The main characteristic parameters of the Jena Apache framework source code is summarized in

Table 2. Metric values.

Parameter	Value
total number of classes	5338
number of data members	12,217
number of methods	17,720

.

The attribute-level quality of the Apache Jena framework can be provided by the following parameters:

• $m_A=5.47$
• $m_e=0.03$
• $m_{=}=0.23$
• $m_l=12.39$
• $m_c=0.47$

4.3. Property Relevance

The investigation of attribute relevance is a standard method in data mining, especially in the classification domain, where the correlation between the attribute and the target variable determines the importance of the attribute [44]. The relevance ordering of the attributes can be used, among others, in data reduction or data representation. If we consider the FCA approach, we can see that in FCA every attribute has the same importance, and all possible formal concepts are contained in the generated concept sets. In practical applications, only a small subset of concepts is used and recognized. The selected concepts have a larger practical importance, however. This simplified concept model is represented in the semantic models constructed for the application programs; thus, the generated schema should express the relevance value of the involved concepts. Applying this idea to the constructed ontologies, we can introduce an importance measure for the attributes and properties.

In FSA, for every attribute a there exists a concept c, where

$$A\left(c\right)=a^{″}\mathrm{i}.\mathrm{e}.,a\Rightarrow A\left(c\right).$$

This concept meets the condition

$$a\in A\left(c^{\prime }\right)\Rightarrow c^{\prime }\subseteq c.$$

This concept is the unique suprenum of attribute a. In ontology or other schema modeling, this concept c may be missing. In this case, attribute a may be less important than the attributes with a unique suprenum in the ontology.

Based on this consideration, for a property p in the ontology we can define the relevance factor $r\left(p\right)$ as

$$r\left(p\right)=\frac{{\sum }_{a:p\in a}{\sum }_{c\in D_a}d(\top ,c)}{\left|\right\{a:p\in r\left\}\right|}$$

Symbol $p\in a$ means that the property part of a is equal to p. This measure shows how far the suprenum concepts of a are from the optimal position. In the best case, the suprenum of every attributes related to p is the child node of the top element. In this model, a lower $r\left(p\right)$ value means a higher importance.

Here, we take the properties defined in the reduced pizza ontology (Section 4.2). Based on the generated property-oriented ontology representation, we obtain the following relevance values:

• hasCountryOfOrigin, $r=8$

  -

  $a_6$ : hasCountryOfOrigin value America, $r=8$

• hasBase, $r=2$

  -

  $a_2$ : hasBase some PizzaBase, $r=2$

• hasTop**, $r=3.3$

  -

  $a_1$ : hasTop** some FruitTop**, $r=2$

  -

  $a_3$ : hasTop** some CheeseTop**, $r=3$

  -

  $a_4$ : hasTop** some ⊤, $r=3$

  -

  $a_5$ : hasTop** some MeatTop**, $r=3$

  -

  $a_7$ : hasTop** some MozzarellaTop**, $r=3$

  -

  $a_8$ : hasTop** some PeperoniSausageTop**, $r=3$

  -

  $a_9$ : hasTop** some TomatoTop**, $r=3$

  -

  $a_{10}$ : hasTop** some HotGreenPepperTop**, $r=4$

  -

  $a_{11}$ : hasTop** some JalapenoPepperTop**, $r=4$

  -

  $a_{12}$ : hasTop** some OnionTop**, $r=4$

  -

  $a_{13}$ : hasTop** some PrawnsTop**, $r=4$

  -

  $a_{14}$ : hasTop** some TobascoPepperSouceTop**, $r=4$

  -

  $a_{15}$ : hasTop** some SpicyTop**, $r=3$

Based on calculations, the property hasBase has the largest importance in the presented example ontology. The property hasTop** has a relatively high importance as well, while hasCountryOfOrigin is a property with low importance.

5. Implementation and Evaluation Tests

The program framework constructed to analyse OWL XML documents contains three program modules. The first module is the flattening unit, which converts the input OWL/XML desription into a simplified XML format. The second program unit calculates the property oriented metrics related to the simplified ontology document. The third unit can be used to generate the extended closed-world oriented view of the input ontology.

5.1. Flatting Module

The schema-oriented ontology view focuses on only two main aspects of the ontology model: the property–object relationship and the specialization–generalization relationship. In this modeling approach, the other ontology elements do not play a direct key role. To extract the relevant elements, we perform a preprocessing step that generates a simplified representation of the input ontology. This flattening process converts the complex structures into a set of simple structures. The resulting description contains:

• Spezialization relations (SubClassOf, ClasssAssertion)
• Property-based relations (ObjectSomeValuesFrom, DataSomeValuesFrom, ObjectAllValuesFrom, DataAllValuesFrom, DataPropertyAssertion).

The flattening process introduces temporal classes to substitute for complex class expressions. The transformation process generates new concepts for these constructional expressions. Then, all occurrences of the complex expression are replaced with a reference to the corresponding new concept. This substitution step can be used to reduce the depth of the global ontology. The transformation rules implemented in the flattening process are summarized in

Table 3. Transformation rules used in preprocessing.

Element	Conversion
Class, ObjectProperty, DataProperty, NamedIndividual, AnonymousIndividual, Literal, Declaration, SubClassOf, EquivalentClasses, ClassAssertion, ObjectPropertyAssertion, DataPropertyAssertion	Preserved
ObjectInverseOf	Converted into a new ObjectProperty
Datatype, DataIntersectionOf, DataUnionOf, DataComplementOf, DataOneOf, DatatypeRestriction	The physical storage format is not relevant to the attribute oriented view; a new datatype name is assigned to the formula. Only those DataRange elements are identified which are maximal containers, i.e., it is not part any other DataRange element.
ObjectIntersectionOf	A new temporal class with unique name is assigned to this complex class expression; this class is a subclass of all classes in the intersection.
ObjectUnionOf	A new temporal class with unique name is assigned to this complex class expression; this class is a superclass of all classes in the union.
ObjectComplementOf	If the child element is a Class element then a new temporal class entity is introduced; if the child node is a property-based class definition (ObjectSomeValuesFrom, ObjectAllValuesFrom, ObjectHasValue, DataSomeValuesFrom, DataAllValuesFrom, DataHasValue) then a new value is introduced. In this case, the not p(a) is simplified to p(not a). Remark: all other kind of complex class expressions are converted into a temporal class before processing this element.
ObjectOneOf	A new temporal class with unique name is assigned to this complex class expression; the individuals in the child list is assigned to this temporal class (ClassAssertion)
ObjectSomeValuesFrom, ObjectAllValuesFrom, ObjectHasValue, DataSomeValuesFrom, DataAllValuesFrom, DataHasValue	If the parent element is a class axiom, then it is preserved. Otherwise a new temporal class with unique name is assigned to this complex class expression and a corresponding EquivalentClasses axiom is constructed.
ObjectMinCardinality, ObjectMaxCardinality, ObjectExactCardinality, DataMinCardinality, DataMaxCardinality, DataExactCardinality	The axiom Cardinality (n, p, o) is converted into the following expression: ObjectSomeValuesFrom (p, o).
DisjointClasses, DisjointUnion, SubObjectPropertyOf, EquivalentObjectProperties, DisjointObjectProperties, InverseObjectProperties, DisjointDataProperties, SubDataPropertyOf, EquivalentDataProperties, NegativeObjectPropertyAssertion, NegativeDataPropertyAssertion	As the closed world approach is used in the attribute oriented view, this axiom is ignored.

and

Table 4. Transformation rules used in prepocessing.

Element	Conversion
ObjectPropertyDomain, DataPropertyDomain	The axiom PropertyDomain(p,c) is equivalent with SubClassOf( ObjectSomeValuesFrom (p, *), c). Based on this rule, having PropertyDomain(p,c), we extend the ontology with SubClassof (c’,c) for every c’ with SubClassOf(c’,ObjectSomeValuesFrom( p, *))
ObjectPropertyRange, DataPropertyRange	As the data range is irrelevant, this axiom is ignored.
FunctionalObjectProperty, InverseFunctionalObjectProperty, ReflexiveObjectProperty, IrreflexiveObjectProperty, SymmetricObjectProperty, AsymmetricObjectProperty, TransitiveObjectProperty, FunctionalDataProperty, HasKey, SameIndividual, DifferentIndividuals, ObjectHasSelf	As the model neglects the semantic relationship among the properties, this axiom is ignored.
Annotation*	All annotation elements are ignored.

.

The conversion program manipulates the ontology description on the base XML level. The transformation module was developed in the XQuery language using the e**’’/>

            </ObjectInverseOf>

            <ObjectUnionOf>

                <Class IRI=‘‘/pizza.owl#AnchoviesTop**’’/>

                <Class IRI=‘‘/pizza.owl#CaperTop**’’/>

            </ObjectUnionOf>

        </ObjectAllValuesFrom>

    </SubClassOf>

    <EquivalentClasses>

        <Class IRI=‘‘#Teenager’’/>

        <ObjectIntersectionOf>

            <Class IRI=‘‘#Person’’/>

            <DataSomeValuesFrom>

                <DataProperty IRI=‘‘#hasAge’’/>

                <DatatypeRestriction>

                    <Datatype abbreviatedIRI=‘‘xsd:integer’’/>

                    <FacetRestriction facet=‘‘XMLSchema#maxExclusive’’>

                        <Literal datatypeIRI=‘‘XMLSchema#integer’’>20</Literal>

                    </FacetRestriction>

                    <FacetRestriction facet=‘‘XMLSchema#minExclusive’’>

                        <Literal datatypeIRI=‘‘XMLSchema#integer’’>12</Literal>

                    </FacetRestriction>

                </DatatypeRestriction>

            </DataSomeValuesFrom>

        </ObjectIntersectionOf>

    </EquivalentClasses>

</Ontology>

The resulting flattened form contains the following elements:

Ontology>

    <SubClassOf>

        <Class IRI=‘‘/pizza.owl#Capricciosa’’/>

        <ObjectSomeValuesFrom>

            <ObjectProperty IRI=‘‘Inv_/pizza.owl#hasTop**’’/>

            <Class IRI=‘‘1’’/>

        </ObjectSomeValuesFrom>

    </SubClassOf>

    <Declaration>

        <ObjectProperty IRI=‘‘Inv_/pizza.owl#hasTop**’’/>

    </Declaration>

    <Declaration>

        <Class IRI=‘‘1’’/>

    </Declaration>

    <SubClassOf>

        <Class IRI=‘‘#Teenager’’/>

        <Class IRI=‘‘#Person’’/>

    </SubClassOf>

    <SubClassOf>

        <Class IRI=‘‘#Teenager’’/>

        <DataSomeValuesFrom>

            <DataProperty IRI=‘‘#hasAge’’/>

            <Datatype IRI=‘‘dt_1’’/>

        </DataSomeValuesFrom>

    </SubClassOf>

    <SubClassOf>

        <Class IRI=‘‘#Teenager’’/>

        <Class IRI=‘‘#Human’’/>

    </SubClassOf>

</Ontology>

5.2. Ontology Evaluation

The ontology evaluation module takes the simplified ontology XML file as input and generates the following output items:

• attribute set;
• context for CL construction
• metric values.

The module was implemented in XQuery language. The algorithm of the evaluation module is summarized in

Table 5. Transformation rules used in the evaluation process.

Element	Processing
Class	Preserved as class
NamedIndividual	Converted into Class
ObjectProperty, DataProperty	Preserved as property
ObjectSomeValuesFrom, DataSomeValuesFrom, ObjectPropertyAssertion, DataPropertyAssertion	The (property, value) pair is converted into an attribute. Next, the corresponding attribute is assigned to the reference class
SubClassOf, ClassAssertion	construction of specialization graph

.

After obtaining the specialization graph, the engine performs both the attribute specialization and attribute generalization processes. The specialization process uses the following inference rule:

$$a\left(c\right),c^{\prime }\prec c\Rightarrow a\left(c^{\prime }\right)$$

The reverse process, generalization, uses the following rule:

$$\forall c^{\prime }:c^{\prime }\prec c:a{\left(c\right)}^{\prime }\Rightarrow a\left(c\right)$$

During the generalization process, we introduce a new attribute $(p,*)$ to denote that the class has a property p with an arbitrary value. The resulting description for the input data introduced in the example (Section 5.1) is presented in the next example (Section 5.2). The objects for the FCA context are provided in the classes subtree, with the corresponding attributes listed in the <attr> element. The metric values are shown under the <metrics> element.

<result>

    <classes>

        <Class IRI=‘‘/pizza.owl#Capricciosa’’ type=‘‘c’’ id=‘‘1’’ depth=‘‘1’’>

            <attr><a nn=‘‘Inv_/pizza.owl#hasTop**:1’’>1</a></attr>

            <parent/><children/></Class>

        <Class IRI=‘‘/pizza.owl#AnchoviesTop**’’ type=’’c’’ id=‘‘2’’ depth=‘‘1’’>

            <attr/><parent/><children/></Class>

        <Class IRI=‘‘/pizza.owl#CaperTop**’’ type=‘‘c’’ id=‘‘3’’ depth=‘‘1’’>

            <attr/><parent/><children/></Class>

        <Class IRI=‘‘#Teenager’’ type=’’c‘‘ id=‘‘4’’ depth=‘‘2’’>

            <attr><a nn=‘‘#hasAge:dt_1’’>3</a></attr>

            <parent><c>5</c><c>6</c></parent><children/></Class>

        <Class IRI=‘‘#Person’’ type=‘‘c’’ id=‘‘5’’ depth=‘‘1’’>

            <attr><a m=‘‘u’’ nn=‘‘#hasAge:dt_1’’>3</a></attr>

            <parent/><children><c>4</c></children></Class>

        <Class IRI=‘‘#Human’’ type=‘‘c’’ id=‘‘6’’ depth=‘‘1’’>

            <attr><a m=‘‘u’’ nn=‘‘#hasAge:dt_1’’>3</a></attr>

            <parent/><children><c>4</c></children></Class>

        <Class IRI=‘‘1’’ type=‘‘c’’ id=‘‘7’’ depth=‘‘1’’>

            <attr/><parent/><children/></Class>

    </classes>

    <attributes>

        <Attrib id=‘‘1’’>Inv_/pizza.owl#hasTop**:1</Attrib>

        <Attrib id=‘‘2’’>Inv_/pizza.owl#hasTop**:*</Attrib>

        <Attrib id=‘‘3’’>#hasAge:dt_1</Attrib>

        <Attrib id=‘‘4’’>#hasAge:*</Attrib>

    </attributes>

    <metrics>

        <m_a>0.285714285714285714</m_a>

        <m_em>0.714285714285714286</m_em>

        <m_eq>0.428571428571428571</m_eq>

        <m_l>0.571428571428571429</m_l>

        <m_c>0</m_c>

    </metrics>

</result>

In the experimental phase, we test a number of freely available online ontology sources for metric comparison. The test results are summarized in Figure 4 and

Table 6. Ontology metrics.

Ontology	${\mathit{m}}_{\mathit{A}}$	${\mathit{m}}_{\mathit{e}}$	${\mathit{m}}_{=}$	${\mathit{m}}_{\mathit{l}}$	${\mathit{m}}_{\mathit{c}}$
full Pizza ontology	0.58	0.51	0.31	2.48	1.65
SHOE/onts/univ1.0.	0.62	0.69	0.00	2.00	1.40
UML schema example	1.10	0.36	0.00	2.00	1.33

.

Based on the test results, the evaluation of the tested ontology models can be summarized as follows:

(1)

Regarding the $m_A$ parameter, the best value is for the UML schema example, the standard ontology examples contain too few properties.

(2)

In the case of parameter $m_e$, all models contain concepts with empty property sets; the best value is calculated for the UML model.

(3)

Considering $m_{=}$, both UML model and SHOE ontology have optimal values.

(4)

Regarding the parameter $m_l$, all three models have very similar values, which are relatively low values.

(5)

For the measure $m_c$, while there are no great differences, there is a relatively large distance between the declared and inferred concepts. The best value is again found for the UML model.

Based on the measured values, the usual ontology models appear to be weaker than the UML-oriented models from the viewpoint of property usage; these models should be extended in order to apply them as input for software or database development. With the help of the proposed measures, we can highlight the weakness of the usual ontology design approach for cases in which the resulting models cannot provide enough information for complex applications to support decision-making.

Summarizing the presented results, the main the goal of the proposed methodology is to highlight the importance of properties in ontology models and to measure the attribute-oriented quality of the prepared ontology. The key contributions cover the following elements:

• Our analysis shows available ontology quality tests using only a simple property-based measure (number of properties);
• We argue that a high-quality, multi-purpose, and reusable ontology model can be used in many application domains, such as software development, that require an appropriate property set;
• We introduce five novel property-based quality metrics for ontology models;
• As the performed tests show, the proposed metrics are suitable for showing the key differences of different semantic models;
• The introduced metrics can be used to measure the quality level of ontology models under development.

In addition to the presented benefits, the proposed methodology has limitations, which can be summarized as follows:

• The presented method is only a measure to show the quality of the ontology, and cannot provide direct routines to perform the corrections;
• In the case of complex ontologies, the evaluation of the model may take a longer time.

6. Conclusions

To help designers use an appropriate set of properties in ontology modeling, the present paper introduces novel quality metrics based on property usage parameters for ontology modeling. With an optimal structure, an ontology can be used as a direct tool in fields such as software and database development. This paper presents a detailed analysis of the proposed measures, along with test applications using examples of different sizes. The tested examples show the clear benefits of the proposed quality metrics in ontology modeling; these metrics can provide significant support in the development of multi-purpose ontology models.

The proposed metrics can help ontology designers to produce an ontology which can be applied in different knowledge management applications. Thanks to a more balanced class structure, the resulted ontology is suitable for both software engineering and knowledge management. Prospective application areas for future ontologies include semantic web decision support systems, biology, intelligent e-tutor systems, and engineering applications.