Similarity assessment of UML class diagrams using a greedy algorithm

Abstract

During the early stages of software development, engineers find themselves dealing with a large collection of models. Lack of efficient management of these models results in duplicated artifacts, ineffective reuse, and an aggravated maintenance effort. Models' matching is at the core of different model management operations such as models' evolution, consolidation, and retrieval. It is a kind of a combinatorial problem. The difficulty of the problem comes in two main streams, the similarity assessment metrics and the matching algorithms. In this paper, we present a greedy-based algorithm for matching UML class diagrams based on their lexical, internal, neighborhood similarity, and a combination of them. Additionally the paper empirically compares the performance of the proposed algorithm against the simulated annealing algorithm in terms of the matching accuracy and time.

4 Figures and Tables

Cite this paper

@article{AlKhiaty2014SimilarityAO, title={Similarity assessment of UML class diagrams using a greedy algorithm}, author={Mojeeb Al-Khiaty and Moataz A. Ahmed}, journal={2014 International Computer Science and Engineering Conference (ICSEC)}, year={2014}, pages={228-233} }