article

Bölen: software module clustering method using the combination of shuffled frog leaping and genetic algorithm

  • Data Technologies and Applications
  • Emerald Publishing Limited
Research footprint

At a glance

Citations
27
References
23
Comments
0
Paper overview

Öz

Purpose Software module clustering is one of the reverse engineering techniques, which is considered to be an effective technique for presenting software architecture and structural information. The objective of clustering software modules is to achieve minimum coupling among different clusters and create maximum cohesion among the modules of each cluster. Finding the best clustering is considered to be a multi-objective N - P hard optimization-problem, and for solving this problem, different meta-heuristic algorithms have been previously proposed. Achieving higher module lustering quality (MQ), obtaining higher success rate for achieving the best clustering quality and improving convergence speed are the main objectives of this study. Design/methodology/approach In this study, a method (Bölen) is proposed for clustering software modules which combines the two algorithms of shuffled frog leaping and genetic algorithm. Findings The results of conducted experiments using traditional data sets confirm that the proposed method outperforms the previous methods in terms of convergence speed, module clustering quality and stability of the results. Originality/value The study proposes SFLA_GA algorithm for optimizing software module clustering, implementing SFLA algorithm in a discrete form by two operators of the genetic algorithm and achieving the above-mentioned purposes in this study. The aim is to achieve higher performance of the proposed algorithm in comparison with other algorithms.

Record transparency

Publication details

DOI
10.1108/dta-08-2019-0138
OpenAlex
W3107225177
Document type
article
Language
EN
Source
Data Technologies and Applications
Last metadata update
Community

Comments

Oturum Açın to join the discussion.

  1. No comments yet. Start the discussion.