Applying Spectral Methods to Software Clustering

Authors:
A. Shokoufandeh;S. Mancoridis;M. Maycock
Affiliations:
-;-;-
Venue:
WCRE '02 Proceedings of the Ninth Working Conference on Reverse Engineering (WCRE'02)
Year:
2002

Citing 0
Cited 8

On the Automatic Modularization of Software Systems Using the Bunch Tool

IEEE Transactions on Software Engineering
Application of graph theory to OO software engineering

Proceedings of the 2006 international workshop on Workshop on interdisciplinary software engineering research
Revisiting the ΔIC approach to component recovery

Science of Computer Programming - Software analysis, evolution and re-engineering
Automated clustering to support the reflexion method

Information and Software Technology
Architecture Reconstruction

Software Engineering
Extending the reflexion method for consolidating software variants into product lines

Software Quality Control
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

The application of spectral methods to the software clus-teringproblem has the advantage of producing results thatare within a known factor of the optimal solution. Heuris-ticsearch methods, such as those supported by the Bunchclustering tool, only guarantee local optimality which maybe far from the global optimum. In this paper, we applythe spectral methods to the software clustering problem andmake comparisons to Bunch using the same clustering cri-terion.We conducted a case study, involving 13 softwaresystems, to draw our comparisons. There is a dual benefitto making these comparisons. Specifically, we gain insightinto (1) the quality of the spectral methods solutions; and(2) the proximity of the results produced by Bunch to theoptimal solution.