Abstract : We describe a simple, fast computing and easy to imple- ment method for finding relatively good clusterings of soft- ware systems. Our method relies on the ability to compute the strength of an edge in a graph by applying a straight- forward metric defined in terms of the neighborhoods of its end vertices. The metric is used to identify the weak edges of the graph, which are momentarily deleted to break it into several components. We study the quality metric M Q intro- duced in [1] and exhibit mathematical properties that make it a good measure for clustering quality. Letting the thresh- old weakness of edges vary defines a path, i.e. a sequence of clusterings in the solution space (of all possible cluster- ing of the graph). This path is described in terms of a curve linking MQ to the weakness of the edges in the graph.
Type de document :
Communication dans un congrès
IEEE International Workshop on Program Comprehension, 2003, Portland, Oregon, United States. IEEE Computer Society, pp.217-226, 2003
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00269464
Contributeur : Christine Carvalho de Matos
<>
Soumis le : jeudi 3 avril 2008 - 08:12:12
Dernière modification le : jeudi 11 janvier 2018 - 06:14:31
Document(s) archivé(s) le : vendredi 28 septembre 2012 - 12:10:34
Yves Chiricota, Fabien Jourdan, Guy Melançon. Software Components Capture using Graph Clustering. IEEE International Workshop on Program Comprehension, 2003, Portland, Oregon, United States. IEEE Computer Society, pp.217-226, 2003. 〈lirmm-00269464〉
