Split-Jaccard Distance of Hierarchical Decompositions for Software Architecture

Ki-Seong LEE  Byung-Woo HONG  Youngmin KIM  Jaeyeop AHN  Chan-Gun LEE  

IEICE TRANSACTIONS on Information and Systems   Vol.E98-D   No.3   pp.712-716
Publication Date: 2015/03/01
Publicized: 2014/11/20
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2014EDL8113
Type of Manuscript: LETTER
Category: Software Engineering
split,  clustering,  hierarchical,  decomposition,  distance,  metric,  

Full Text: PDF(168.1KB)>>
Buy this Article

Most previous approaches on comparing the results for software architecture recovery are designed to handle only flat decompositions. In this paper, we propose a novel distance called Split-Jaccard Distance of Hierarchical Decompositions. It extends the Jaccard coefficient and incorporates the concept of the splits of leaves in a hierarchical decomposition. We analyze the proposed distance and derive its properties, including the lower-bound and the metric space.