Split-Jaccard Distance of Hierarchical Decompositions for Software Architecture

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

doi:10.1587/transinf.2014EDL8113

Split-Jaccard Distance of Hierarchical Decompositions for Software Architecture

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

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Information 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

Authors

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

Keyword

split, clustering, hierarchical, decomposition, distance, metric

Cite this

Copy

Ki-Seong LEE, Byung-Woo HONG, Youngmin KIM, Jaeyeop AHN, Chan-Gun LEE, "Split-Jaccard Distance of Hierarchical Decompositions for Software Architecture" in IEICE TRANSACTIONS on Information, vol. E98-D, no. 3, pp. 712-716, March 2015, doi: 10.1587/transinf.2014EDL8113.
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.
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.2014EDL8113/_p

Copy

@ARTICLE{e98-d_3_712,
author={Ki-Seong LEE, Byung-Woo HONG, Youngmin KIM, Jaeyeop AHN, Chan-Gun LEE, },
journal={IEICE TRANSACTIONS on Information},
title={Split-Jaccard Distance of Hierarchical Decompositions for Software Architecture},
year={2015},
volume={E98-D},
number={3},
pages={712-716},
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.},
keywords={},
doi={10.1587/transinf.2014EDL8113},
ISSN={1745-1361},
month={March},}

Copy

TY - JOUR
TI - Split-Jaccard Distance of Hierarchical Decompositions for Software Architecture
T2 - IEICE TRANSACTIONS on Information
SP - 712
EP - 716
AU - Ki-Seong LEE
AU - Byung-Woo HONG
AU - Youngmin KIM
AU - Jaeyeop AHN
AU - Chan-Gun LEE
PY - 2015
DO - 10.1587/transinf.2014EDL8113
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E98-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2015
AB - 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.
ER -