Split-Jaccard Distance of Hierarchical Decompositions for Software Architectureopen access
- Authors
- Lee, Ki Seong; Hong, Byung-Woo; Kim, Young Min; Ahn, Jaeyeop; Lee, Chan Gun
- Issue Date
- Mar-2015
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- split; clustering; hierarchical; decomposition; distance; metric
- Citation
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E98D, no.3, pp 712 - 716
- Pages
- 5
- Journal Title
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- Volume
- E98D
- Number
- 3
- Start Page
- 712
- End Page
- 716
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/9853
- DOI
- 10.1587/transinf.2014EDL8113
- ISSN
- 1745-1361
- Abstract
- 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.
- Files in This Item
-
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
- College of Software > Department of Artificial Intelligence > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.