Methods for selecting and improving software clustering algorithms. (31st July 2012)

• Record Type: Journal Article
• Authors: Shtern, Mark; Tzerpos, Vassilios
• Is Part Of: Software, practice & experience. Volume 44:Number 1(2014)
• Page Start: 33
• Page End: 46
• Publication Date: 2012-07-31
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2147
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2147-abs-0001"> <title>SUMMARY</title> <p id="spe2147-para-0001">Several software clustering algorithms have been proposed in the literature, each with its own strengths and weaknesses. Most of these algorithms have been applied to particular software systems with considerable success. However, no algorithm has been shown to be superior in all cases. As a result, selecting a software clustering algorithm that is best suited for a specific software system remains a hard question to answer. At the same time, improving the effectiveness of an existing algorithm is a time‐consuming process that would benefit from a methodology that allowed the early evaluation of an idea. In this paper, we first introduce a formal description template for software clustering algorithms. Based on this template, we propose a novel method for the selection of a software clustering algorithm for specific needs, as well as a method for software clustering algorithm improvement. The applicability and usefulness of the two methods introduced in this paper is demonstrated by applying them in four distinct case studies. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p> </abstract>