Skip to main content
Top

2021 | OriginalPaper | Chapter

Software Anti-patterns Detection Under Uncertainty Using a Possibilistic Evolutionary Approach

Authors : Sofien Boutaib, Maha Elarbi, Slim Bechikh, Chih-Cheng Hung, Lamjed Ben Said

Published in: Genetic Programming

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Code smells (a.k.a. anti-patterns) are manifestations of poor design solutions that could deteriorate the software maintainability and evolution. Despite the high number of existing detection methods, the issue of class label uncertainty is usually omitted. Indeed, two human experts may have different degrees of uncertainty about the smelliness of a particular software class not only for the smell detection task but also for the smell type identification one. Thus, this uncertainty should be taken into account and then processed by detection tools. Unfortunately, these latter usually reject and/or ignore uncertain data that correspond to software classes (i.e. dataset instances) with uncertain labels. This practice could considerably degrade the detection/identification process effectiveness. Motivated by this observation and the interesting performance of the Possibilistic K-NN (PK-NN) classifier in dealing with uncertain data, we propose a new possibilistic evolutionary detection method, named ADIPOK (Anti-patterns Detection and Identification using Possibilistic Optimized K-NNs), that is able to deal with label uncertainty using some concepts stemming from the Possibility theory. ADIPOK is validated using a possibilistic base of smell examples that simulates the subjectivity of software engineers’ opinions’ uncertainty. The statistical analysis of the obtained results on a set of comparative experiments with respect to four state-of-the-art methods show the merits of our proposed method.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference Bounhas, M., Hamed, M.G., Prade, H., Serrurier, M., Mellouli, K.: Naive possibilistic classifiers for imprecise or uncertain numerical data. Fuzzy Sets Syst. 239, 137–156 (2014)MathSciNetCrossRef Bounhas, M., Hamed, M.G., Prade, H., Serrurier, M., Mellouli, K.: Naive possibilistic classifiers for imprecise or uncertain numerical data. Fuzzy Sets Syst. 239, 137–156 (2014)MathSciNetCrossRef
3.
go back to reference Cohen, J.: Statistical Power Analysis for the Behavioral Sciences. Erlbaum Associates, Hillsdale (1988)MATH Cohen, J.: Statistical Power Analysis for the Behavioral Sciences. Erlbaum Associates, Hillsdale (1988)MATH
4.
go back to reference Conover, W.J., Conover, W.J.: Practical Nonparametric Statistics. Wiley, New York (1980)MATH Conover, W.J., Conover, W.J.: Practical Nonparametric Statistics. Wiley, New York (1980)MATH
5.
go back to reference Deb, K., Agrawal, R.B., et al.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115–148 (1995)MathSciNetMATH Deb, K., Agrawal, R.B., et al.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115–148 (1995)MathSciNetMATH
6.
go back to reference Dubois, D., Prade, H.: Possibility theory: an approach to computerized processing of uncertainty. Plenum Press, New York (1988)CrossRef Dubois, D., Prade, H.: Possibility theory: an approach to computerized processing of uncertainty. Plenum Press, New York (1988)CrossRef
7.
go back to reference Fowler, M., Beck, K.: Refactoring: Improving the Design of Existing Code. Addison-Wesely, Boston (1999) Fowler, M., Beck, K.: Refactoring: Improving the Design of Existing Code. Addison-Wesely, Boston (1999)
8.
go back to reference Friedman, N., Geiger, D., Goldszmidt, M.: Bayesian network classifiers. Mach. Learn. 29(2–3), 131–163 (1997)CrossRef Friedman, N., Geiger, D., Goldszmidt, M.: Bayesian network classifiers. Mach. Learn. 29(2–3), 131–163 (1997)CrossRef
9.
go back to reference Gopalan, R.: Automatic detection of code smells in Java source code. Ph.D. thesis, University of Western Australia (2012) Gopalan, R.: Automatic detection of code smells in Java source code. Ph.D. thesis, University of Western Australia (2012)
10.
go back to reference Holmes, C., Adams, N.: A probabilistic nearest neighbour method for statistical pattern recognition. J. Roy. Stat. Soc. B (Stat. Methodol.) 64(2), 295–306 (2002)MathSciNetCrossRef Holmes, C., Adams, N.: A probabilistic nearest neighbour method for statistical pattern recognition. J. Roy. Stat. Soc. B (Stat. Methodol.) 64(2), 295–306 (2002)MathSciNetCrossRef
11.
go back to reference Jain, A., Jatain, A.: Search based software engineering techniques. Int. J. Comput. Appl. 975, 8887 (2015) Jain, A., Jatain, A.: Search based software engineering techniques. Int. J. Comput. Appl. 975, 8887 (2015)
12.
go back to reference Jenhani, I.: From Possibilistic Similarity Measures to Possibilistic Decision Trees: Decision Tree Approaches for Handling Label-uncertainty in Classification Problems. LAP LAMBERT Academic Publishing, Saarbrücken (2010) Jenhani, I.: From Possibilistic Similarity Measures to Possibilistic Decision Trees: Decision Tree Approaches for Handling Label-uncertainty in Classification Problems. LAP LAMBERT Academic Publishing, Saarbrücken (2010)
15.
go back to reference Moha, N., Gueheneuc, Y.G., Duchien, L., Meur, A.F.L.: DECOR: a method for the specification and detection of code and design smells. IEEE Trans. Softw. Eng. 36(1), 20–36 (2009)CrossRef Moha, N., Gueheneuc, Y.G., Duchien, L., Meur, A.F.L.: DECOR: a method for the specification and detection of code and design smells. IEEE Trans. Softw. Eng. 36(1), 20–36 (2009)CrossRef
16.
go back to reference Ouni, A., Kessentini, M., Sahraoui, H., Boukadoum, M.: Maintainability defects detection and correction: a multi-objective approach. Autom. Softw. Eng. 20(1), 47–79 (2013)CrossRef Ouni, A., Kessentini, M., Sahraoui, H., Boukadoum, M.: Maintainability defects detection and correction: a multi-objective approach. Autom. Softw. Eng. 20(1), 47–79 (2013)CrossRef
17.
go back to reference Pearl, J.: Bayesian networks: a model CF self-activated memory for evidential reasoning. In: Proceedings of the 7th Conference of the Cognitive Science Society, University of California, Irvine, CA, USA, pp. 15–17 (1985) Pearl, J.: Bayesian networks: a model CF self-activated memory for evidential reasoning. In: Proceedings of the 7th Conference of the Cognitive Science Society, University of California, Irvine, CA, USA, pp. 15–17 (1985)
18.
go back to reference Quinlan, J.R.: Decision trees as probabilistic classifiers. In: the Proceedings of the 4th International Workshop on Machine Learning, pp. 31–37. Elsevier (1987) Quinlan, J.R.: Decision trees as probabilistic classifiers. In: the Proceedings of the 4th International Workshop on Machine Learning, pp. 31–37. Elsevier (1987)
19.
go back to reference Sahin, D., Kessentini, M., Bechikh, S., Deb, K.: Code-smell detection as a bilevel problem. ACM Trans. Softw. Eng. Methodol. 24(1), 1–44 (2014)CrossRef Sahin, D., Kessentini, M., Bechikh, S., Deb, K.: Code-smell detection as a bilevel problem. ACM Trans. Softw. Eng. Methodol. 24(1), 1–44 (2014)CrossRef
20.
go back to reference Saied, S., Elouedi, Z.: K-nearest neighbors classifier under possibility framework. In: Proceedings of the 27th La Logique Floue est ses Applications, LFA, pp. 1–8 (2018) Saied, S., Elouedi, Z.: K-nearest neighbors classifier under possibility framework. In: Proceedings of the 27th La Logique Floue est ses Applications, LFA, pp. 1–8 (2018)
21.
go back to reference Srinivas, M., Patnaik, L.M.: Genetic algorithms: a survey. Computer 27(6), 17–26 (1994)CrossRef Srinivas, M., Patnaik, L.M.: Genetic algorithms: a survey. Computer 27(6), 17–26 (1994)CrossRef
22.
go back to reference Talbi, E.G.: Metaheuristics: From Design to Implementation, vol. 74, pp. 214–215. Wiley, New York (2009)CrossRef Talbi, E.G.: Metaheuristics: From Design to Implementation, vol. 74, pp. 214–215. Wiley, New York (2009)CrossRef
23.
go back to reference Tsantalis, N., Chatzigeorgiou, A.: Identification of move method refactoring opportunities. IEEE Trans. Softw. Eng. 35(3), 347–367 (2009)CrossRef Tsantalis, N., Chatzigeorgiou, A.: Identification of move method refactoring opportunities. IEEE Trans. Softw. Eng. 35(3), 347–367 (2009)CrossRef
Metadata
Title
Software Anti-patterns Detection Under Uncertainty Using a Possibilistic Evolutionary Approach
Authors
Sofien Boutaib
Maha Elarbi
Slim Bechikh
Chih-Cheng Hung
Lamjed Ben Said
Copyright Year
2021
DOI
https://doi.org/10.1007/978-3-030-72812-0_12

Premium Partner