Sequence diagram refactoring using single and hybridized algorithms

Abdulrahman Ahmed Bobakr Baqais; Mohammad Alshayeb

doi:10.1371/journal.pone.0202629

Sequence diagram refactoring using single and hybridized algorithms

Abdulrahman Ahmed Bobakr Baqais, Mohammad Alshayeb^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

Data mining and search-based algorithms have been applied to various problems due to their power and performance. There have been several studies on the use of these algorithms for refactoring. In this paper, we show how search based algorithms can be used for sequence diagram refactoring. We also show how a hybridized algorithm of Kmeans and Simulated Annealing (SA) algorithms can aid each other in solving sequence diagram refactoring. Results show that search based algorithms can be used successfully in refactoring sequence diagram on small and large case studies. In addition, the hybridized algorithm obtains good results using selected quality metrics. Detailed insights on the experiments on sequence diagram refactoring reveal that the limitations of SA can be addressed by hybridizing the Kmeans algorithm to the SA algorithm.

Original language	English
Article number	e0202629
Journal	PLoS ONE
Volume	13
Issue number	8
DOIs	https://doi.org/10.1371/journal.pone.0202629
State	Published - Aug 2018

Bibliographical note

Publisher Copyright:
© 2018 Baqais, Alshayeb. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

ASJC Scopus subject areas

General Biochemistry, Genetics and Molecular Biology
General Agricultural and Biological Sciences
General

Access to Document

10.1371/journal.pone.0202629

Cite this

@article{483bc9c033774d279b8cac90a635801a,

title = "Sequence diagram refactoring using single and hybridized algorithms",

abstract = "Data mining and search-based algorithms have been applied to various problems due to their power and performance. There have been several studies on the use of these algorithms for refactoring. In this paper, we show how search based algorithms can be used for sequence diagram refactoring. We also show how a hybridized algorithm of Kmeans and Simulated Annealing (SA) algorithms can aid each other in solving sequence diagram refactoring. Results show that search based algorithms can be used successfully in refactoring sequence diagram on small and large case studies. In addition, the hybridized algorithm obtains good results using selected quality metrics. Detailed insights on the experiments on sequence diagram refactoring reveal that the limitations of SA can be addressed by hybridizing the Kmeans algorithm to the SA algorithm.",

author = "Baqais, {Abdulrahman Ahmed Bobakr} and Mohammad Alshayeb",

note = "Publisher Copyright: {\textcopyright} 2018 Baqais, Alshayeb. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.",

year = "2018",

month = aug,

doi = "10.1371/journal.pone.0202629",

language = "English",

volume = "13",

journal = "PLoS ONE",

issn = "1932-6203",

publisher = "Public Library of Science",

number = "8",

}

TY - JOUR

T1 - Sequence diagram refactoring using single and hybridized algorithms

AU - Baqais, Abdulrahman Ahmed Bobakr

AU - Alshayeb, Mohammad

N1 - Publisher Copyright: © 2018 Baqais, Alshayeb. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

PY - 2018/8

Y1 - 2018/8

N2 - Data mining and search-based algorithms have been applied to various problems due to their power and performance. There have been several studies on the use of these algorithms for refactoring. In this paper, we show how search based algorithms can be used for sequence diagram refactoring. We also show how a hybridized algorithm of Kmeans and Simulated Annealing (SA) algorithms can aid each other in solving sequence diagram refactoring. Results show that search based algorithms can be used successfully in refactoring sequence diagram on small and large case studies. In addition, the hybridized algorithm obtains good results using selected quality metrics. Detailed insights on the experiments on sequence diagram refactoring reveal that the limitations of SA can be addressed by hybridizing the Kmeans algorithm to the SA algorithm.

AB - Data mining and search-based algorithms have been applied to various problems due to their power and performance. There have been several studies on the use of these algorithms for refactoring. In this paper, we show how search based algorithms can be used for sequence diagram refactoring. We also show how a hybridized algorithm of Kmeans and Simulated Annealing (SA) algorithms can aid each other in solving sequence diagram refactoring. Results show that search based algorithms can be used successfully in refactoring sequence diagram on small and large case studies. In addition, the hybridized algorithm obtains good results using selected quality metrics. Detailed insights on the experiments on sequence diagram refactoring reveal that the limitations of SA can be addressed by hybridizing the Kmeans algorithm to the SA algorithm.

UR - http://www.scopus.com/inward/record.url?scp=85052143112&partnerID=8YFLogxK

U2 - 10.1371/journal.pone.0202629

DO - 10.1371/journal.pone.0202629

M3 - Article

C2 - 30133518

AN - SCOPUS:85052143112

SN - 1932-6203

VL - 13

JO - PLoS ONE

JF - PLoS ONE

IS - 8

M1 - e0202629

ER -

Sequence diagram refactoring using single and hybridized algorithms

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this