This paper proposes the use Bayesian networks for the automatic merging of metamodels. The proposed Bayesian networks calculate the probability that a merge of two metamodel elements is suitable, thus suggesting what to merge.
In recent years, both researchers and practitioners have discovered the emerging
possibilities of using metamodels and ontologies. As a consequence, a large quantity
of metamodels and ontologies now exists within all sorts of different applications.
The distributed environment of metamodel and ontology development has led to large
overlaps within and between metamodels. Since these diverse metamodels often
describe similar aspects of systems, developers and users would gain large benefits if
metamodels could easily be merged and aligned with each other. Therefore,
integration and merging of metamodels and ontologies has received an increasing
interest lately [
This paper proposes an approach to metamodel merging where a probabilistic inference engine is employed to evaluate candidate metamodel concepts suitable for merging. The proposed approach uses Bayesian networks to assess the probability that a merge of two elements is suitable. The Bayesian network evaluates a merge based on various syntactic and semantic characteristics of the candidate concepts, such as the similarity of names and associations to other concepts.
The concepts described in this paper all pertain to a certain type of metamodels
called abstract models. Abstract models have previously been proposed as a notation
for describing and analyzing enterprise systems [
A Bayesian network, B=(G, P), is a representation of a joint probability
distribution, where G=(V, E) is a directed acyclic graph consisting of vertices, V, and
edges, E. The vertices denote a domain of random variables X1,…, Xn, also called
chance nodes. Each chance node, Xi, may take on a value xi from the finite domain
Val(Xi). The edges denote causal dependencies between the nodes, i.e. how the nodes
relate to each other. The second component, P, of the network B, describes a
conditional probability distribution for each chance node, P(Xi), given its parents
Pa(Xi) in G. More comprehensive treatment on Bayesian networks can be found in
e.g. Jensen [
When merging abstract models, there are two concerns. Firstly, do any of the classes in the source models represent the same concepts? Secondly, when two classes have been merged, do any of the attributes in the merged class represent the same concepts? If these two concerns are correctly handled, then all associations separately holding in the source models will also be correctly transferred into the target model. Therefore, two Bayesian networks were developed; one describing class merges and one describing attribute merges, c.f. Fig. 2.
The nodes in the class merge network have the following scales: Class Merge = {Yes, No}, Class Similarity Association = {Yes, No}, Class Names = {Identical, Similar, Dissimilar}, Class References = {SamePublication, SameAuthor, DifferentAuthors}, Class Attributes = {All, Some, None}, and Class Associations = {All, Some, None}.
The nodes in the attribute merge network have the following scales: Attribute Merge = {Yes, No}, Attribute Similarity Association = {Yes, No}, Attribute Names = {Identical, Similar, Dissimilar}, Attribute References = {SamePublication, SameAuthor, DifferentAuthors}, and Attribute Associations = {All, Some, None}.
To illustrate the application of the Class Merge network c.f. the Bayesian network
screenshot from GeNIe [
Assume that a package, i.e. a set of abstract models, contains the abstract models presented in Fig. 4.
The method starts by comparing the pairs of classes from the models presented in Fig. 4. Then, the classes with the highest probability are merged. In this example, the class pair Documentation and Document received the probability P = 100 %, and are therefore merged.
The next step is to compare all pairs of attributes in the merged class Documentation. Then, the attributes with the highest probability are merged. In this example, the pair Readability and Readability received the probability P = 100 %, and are therefore merged.
It all starts over from the beginning by comparing all pairs of classes and iterates until no classes receive probabilities over a predefined merging threshold. The resulting model in this example is presented in Fig. 5.
Affects[
This paper addresses the issue of metamodel merging, using the probabilistic framework of Bayesian networks. It was shown that Bayesian networks can be used to guide the merging of metamodels, by considering some key features of the classes and attributes at hand: basically their names, references, and associations. With this information it is possible to discern the probability that the concepts are sufficiently similar to be merged.