An Optimal Algorithm for MoJo Distance

Authors:
Zhihua Wen;Vassilios Tzerpos
Affiliations:
-;-
Venue:
IWPC '03 Proceedings of the 11th IEEE International Workshop on Program Comprehension
Year:
2003

Citing 0
Cited 4

Information-Theoretic Software Clustering

IEEE Transactions on Software Engineering
Architecture Reconstruction

Software Engineering
A biting-down approach to hierarchical decomposition of object-oriented systems based on structure analysis

Journal of Software Maintenance and Evolution: Research and Practice
Clustering methodologies for software engineering

Advances in Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Effective comparison of different decompositions of a software system is integral for the evaluation of software clustering algorithm . One of the approaches that has been developed to tackle this isssue is the MoJo distance measure.The original algorithm for the computation of MoJo distance was a heuristic one that only approximated the exact value. In this paper, we introduce an algorithm that calculates the exact distance in polynomial time. We also present experiments that showcase that the new algorithm calculates MoJo distance more accurately and efficiently than before.