A Stability Analysis of Clustering Algorithms
- 1 December 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 314-319
Abstract
The use of clustering for developing a description of a software system's architecture is fairly recent. Thus there is a need to evaluate various clustering algorithms and identify the ones which are expected to give good results for software. A criterion that can be used for evaluation is stability. A clustering algorithm is said to be stable if its output i.e. the clusters it produces, do not change drastically when small changes are made to the input data. The notion of stability is especially important when a software clustering algorithm is used to build a high level description of a software system that is currently under development. In this paper, we compare the stability of six hierarchical clustering algorithms by carrying out experiments on three open-source software systems. We also present an analysis of the results, which provides insight into the clustering process of the various algorithmsKeywords
This publication has 9 references indexed in Scilit:
- Information-theoretic software clusteringIEEE Transactions on Software Engineering, 2005
- Comparison of clustering algorithms in the context of software evolution2005
- The weighted combined algorithm: a linkage algorithm for software clustering2004
- Software clustering techniques and the use of combined algorithm2003
- A user‐assisted approach to component clusteringJournal of Software Maintenance and Evolution: Research and Practice, 2003
- Experiments with clustering as a software remodularization method2003
- On the stability of software clustering algorithms2002
- Frequently forgotten fundamental facts about software engineeringIEEE Software, 2001
- Data clusteringACM Computing Surveys, 1999