Preprint Data Descriptor Version 1 Preserved in Portico This version is not peer-reviewed

Improving Code Smell Detection Using Deep Stacked Autoencoder

Version 1 : Received: 28 March 2024 / Approved: 29 March 2024 / Online: 29 March 2024 (10:41:57 CET)

How to cite: Rehef, K.K.; Abbas, A.S. Improving Code Smell Detection Using Deep Stacked Autoencoder. Preprints 2024, 2024031848. https://doi.org/10.20944/preprints202403.1848.v1 Rehef, K.K.; Abbas, A.S. Improving Code Smell Detection Using Deep Stacked Autoencoder. Preprints 2024, 2024031848. https://doi.org/10.20944/preprints202403.1848.v1

Abstract

The term "code smell" refers to an indication of a problem with the quality of source code. Numerous studies have been conducted to identify problematic features in source code. Initially, the focus was on utilizing metric-based and heuristic-based approaches. In recent years, however, there has been a shift towards using machine learning and deep learning (DL) techniques for smell detection. Nevertheless, the current algorithms are still considered to be in the early stages of development. Recognizing the challenges associated with identifying smells using DL methods, both academics and software developers have made efforts to address these obstacles. This work involves constructing and evaluating new DL models for code smell detection. Two models are built upon stacked autoencoders, employing a hybrid architecture that combines bidirectional long short-term memory and convolutional neural network components.

Keywords

machine learning; deep learning; stack auto encoder; code smell detection; auto encoder.

Subject

Computer Science and Mathematics, Artificial Intelligence and Machine Learning

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.