Comparison of Graph Clustering Algorithms for Recovering Software Architecture Module Views
- 1 January 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15345351,p. 251-254
- https://doi.org/10.1109/csmr.2009.28
Abstract
In the domain of software architecture recovery, classical clustering algorithms have been used to recover module views, while new ones have been proposed to tackle specific software architecture issues. Nonetheless, little information concerning their empirical evaluation in this context is presently available. This paper presents an empirical study that evaluates four clustering algorithms according to three previously proposed criteria: extremity of cluster distribution, authoritativeness, and stability, which were measured against consecutive releases of four different systems. Our results suggest that the k-means algorithm performs best in terms of authoritativeness and extremity and that the modularization quality algorithm produces more stable clusters. They also point out that fully automated clustering techniques alone cannot recover module views in a sensible way, but may provide a reasonable first step to speed up an expert-assisted architecture recovery process.Keywords
This publication has 6 references indexed in Scilit:
- Comparison of clustering algorithms in the context of software evolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- MoJo: a distance metric for software clusteringsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Using automatic clustering to produce high-level system organizations of source codePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Evaluating architectural extractorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A framework for experimental evaluation of clustering techniquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Community structure in social and biological networksProceedings of the National Academy of Sciences, 2002