Marcela Mosquera
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Marcela Mosquera has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Rodolfo Bojorque
Universidad Politécnica Salesiana
5 shared publications - Pamela Flores
Escuela Politécnica Nacional
2 shared publications - Remigio Hurtado
Universidad Politécnica Salesiana
2 shared publications - Carlos E. Anchundia
Escuela Politécnica Nacional
1 shared publication - Jorge Segovia
Escuela Politécnica Nacional
1 shared publication
Latest Publications
- Open Access
- 20 October 2026
- Published by MDPI AG in Preprints.org
Beyond Predictive Performance: SHAP-Based Explanations and Alignment with Literature-Based Indicators in Code Smell Detection
Machine learning-based code smell detection relies on structural metrics, but predictive performance alone does not establish whether the information used by classifiers corresponds to the characteristics reported in the literature. This study examines the explanatory behavior of Support Vector Machine (SVM) models by integrating SHAP-based feature importance, point-biserial associations, and literature-based code smell indicators. The analysis reconstructs 120 SVM models across three open-source Java systems and four code smells, using ten folds per system–smell combination. Feature importance, persistence across folds, and consistency across software systems are examined alongside SHAP–correlation concordance, indicator coverage, and directional compatibility. The results show that influential metrics vary across code smells and software systems, while high average importance does not necessarily imply persistence across folds. Agreement between SHAP-based rankings and statistical associations is partial. Indicator coverage and directional compatibility provide distinct forms of evidence, and some literature-based operationalizations cannot be evaluated using the available metrics. A complementary sensitivity analysis shows high agreement among repeated SHAP realizations under the tested conditions. These findings indicate that explanatory relevance depends on the experimental context and that model contributions, statistical associations, and literature-based indicators provide complementary evidence for interpreting code smell predictions.
- 20 October 2026
- Published by MDPI AG in Preprints.org
Open AccessBeyond Predictive Performance: SHAP-Based Explanations and Alignment with Literature-Based Indicators in Code Smell Detection
Machine learning-based code smell detection relies on structural metrics, but predictive performance alone does not establish whether the information used by classifiers corresponds to the characteristics reported in the literature. This study examines the explanatory behavior of Support Vector Machine (SVM) models by integrating SHAP-based feature importance, point-biserial associations, and literature-based code smell indicators. The analysis reconstructs 120 SVM models across three open-source Java systems and four code smells, using ten folds per system–smell combination. Feature importance, persistence across folds, and consistency across software systems are examined alongside SHAP–correlation concordance, indicator coverage, and directional compatibility. The results show that influential metrics vary across code smells and software systems, while high average importance does not necessarily imply persistence across folds. Agreement between SHAP-based rankings and statistical associations is partial. Indicator coverage and directional compatibility provide distinct forms of evidence, and some literature-based operationalizations cannot be evaluated using the available metrics. A complementary sensitivity analysis shows high agreement among repeated SHAP realizations under the tested conditions. These findings indicate that explanatory relevance depends on the experimental context and that model contributions, statistical associations, and literature-based indicators provide complementary evidence for interpreting code smell predictions.
- 2 September 2026
- Published by Springer Nature
- p. 133-145
Approach for Management Antipattern Detection on Scrum Software Projects
- 2 September 2026
- Published by Springer Nature
- p. 133-145
Approach for Management Antipattern Detection on Scrum Software Projects
- 4 June 2026
- Published by Springer Nature
- p. 405-414
Software Quality in Machine Learning Systems: A Scoping Review of Smells and Antipatterns
- 4 June 2026
- Published by Springer Nature
- p. 405-414
Software Quality in Machine Learning Systems: A Scoping Review of Smells and Antipatterns
- Open Access
- 8 April 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (8) , 3622
Evaluating Embedding Representations for Multiclass Code Smell Detection: A Comparative Study of CodeBERT and General-Purpose Embeddings
Code smells are indicators of potential design problems in software systems and are commonly used to guide refactoring activities. Recent advances in representation learning have enabled the use of embedding-based models for analyzing source code, offering an alternative to traditional approaches based on manually engineered metrics. However, the effectiveness of different embedding representations for multiclass code smell detection remains insufficiently explored. This study presents an empirical comparison of embedding models for the automatic detection of three widely studied code smells: Long Method, God Class, and Feature Envy. Using the Crowdsmelling dataset as an empirical basis, source code fragments were extracted from the original projects and transformed into vector representations using two embedding approaches: a general-purpose embedding model and the code-specialized CodeBERT model. The resulting representations were evaluated using several machine learning classifiers under a stratified group-based validation protocol. The results show that CodeBERT consistently outperforms the general-purpose embeddings across multiple evaluation metrics, including balanced accuracy, macro F1-score, and Matthews correlation coefficient. Dimensionality reduction analyses using PCA and t-SNE further indicate that CodeBERT organizes code smell instances in a more structured latent representation space, which facilitates the separation of smell categories. In particular, CodeBERT achieved a macro F1-score of 0.8619, outperforming general-purpose embeddings (0.7622) and substantially surpassing a classical TF-IDF baseline (0.4555). These findings highlight the value of this study as a controlled multiclass evaluation of embedding representations and demonstrate the practical value of domain-specific representations for improving automated code smell detection and class separability in real-world software engineering scenarios.
- 8 April 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (8) , 3622
Open AccessEvaluating Embedding Representations for Multiclass Code Smell Detection: A Comparative Study of CodeBERT and General-Purpose Embeddings
Code smells are indicators of potential design problems in software systems and are commonly used to guide refactoring activities. Recent advances in representation learning have enabled the use of embedding-based models for analyzing source code, offering an alternative to traditional approaches based on manually engineered metrics. However, the effectiveness of different embedding representations for multiclass code smell detection remains insufficiently explored. This study presents an empirical comparison of embedding models for the automatic detection of three widely studied code smells: Long Method, God Class, and Feature Envy. Using the Crowdsmelling dataset as an empirical basis, source code fragments were extracted from the original projects and transformed into vector representations using two embedding approaches: a general-purpose embedding model and the code-specialized CodeBERT model. The resulting representations were evaluated using several machine learning classifiers under a stratified group-based validation protocol. The results show that CodeBERT consistently outperforms the general-purpose embeddings across multiple evaluation metrics, including balanced accuracy, macro F1-score, and Matthews correlation coefficient. Dimensionality reduction analyses using PCA and t-SNE further indicate that CodeBERT organizes code smell instances in a more structured latent representation space, which facilitates the separation of smell categories. In particular, CodeBERT achieved a macro F1-score of 0.8619, outperforming general-purpose embeddings (0.7622) and substantially surpassing a classical TF-IDF baseline (0.4555). These findings highlight the value of this study as a controlled multiclass evaluation of embedding representations and demonstrate the practical value of domain-specific representations for improving automated code smell detection and class separability in real-world software engineering scenarios.
- Open Access
- 20 March 2026
- Published by MDPI AG in Preprints.org
Evaluating Embedding Representations for Multiclass Code Smell Detection: A Comparative Study of CodeBERT and General-Purpose Embeddings
Code smells are indicators of potential design problems in software systems and are commonly used to guide refactoring activities. Recent advances in representation learning have enabled the use of embedding-based models for analyzing source code, offering an alternative to traditional approaches based on manually engineered metrics. However, the effectiveness of different embedding representations for multiclass code smell detection remains insufficiently explored. This study presents an empirical comparison of embedding models for the automatic detection of three widely studied code smells: Long Method, God Class, and Feature Envy. Using the Crowdsmelling dataset as an empirical basis, source code fragments were extracted from the original projects and transformed into vector representations using two embedding approaches: a general-purpose embedding model and the code-specialized CodeBERT model. The resulting representations were evaluated using several machine learning classifiers under a stratified group-based validation protocol. The results show that CodeBERT consistently outperforms the general-purpose embeddings across multiple evaluation metrics, including balanced accuracy, macro F1-score, and Matthews correlation coefficient. Dimensionality reduction analyses using PCA and t-SNE further indicate that CodeBERT organizes code smell instances in a more structured latent representation space, which facilitates the separation of smell categories. These findings provide empirical evidence that domain-specific pretraining plays an important role in representation learning for software engineering tasks and that embedding choice significantly influences the separability of code smell categories in multiclass detection settings.
- 20 March 2026
- Published by MDPI AG in Preprints.org
Open AccessEvaluating Embedding Representations for Multiclass Code Smell Detection: A Comparative Study of CodeBERT and General-Purpose Embeddings
Code smells are indicators of potential design problems in software systems and are commonly used to guide refactoring activities. Recent advances in representation learning have enabled the use of embedding-based models for analyzing source code, offering an alternative to traditional approaches based on manually engineered metrics. However, the effectiveness of different embedding representations for multiclass code smell detection remains insufficiently explored. This study presents an empirical comparison of embedding models for the automatic detection of three widely studied code smells: Long Method, God Class, and Feature Envy. Using the Crowdsmelling dataset as an empirical basis, source code fragments were extracted from the original projects and transformed into vector representations using two embedding approaches: a general-purpose embedding model and the code-specialized CodeBERT model. The resulting representations were evaluated using several machine learning classifiers under a stratified group-based validation protocol. The results show that CodeBERT consistently outperforms the general-purpose embeddings across multiple evaluation metrics, including balanced accuracy, macro F1-score, and Matthews correlation coefficient. Dimensionality reduction analyses using PCA and t-SNE further indicate that CodeBERT organizes code smell instances in a more structured latent representation space, which facilitates the separation of smell categories. These findings provide empirical evidence that domain-specific pretraining plays an important role in representation learning for software engineering tasks and that embedding choice significantly influences the separability of code smell categories in multiclass detection settings.
- Open Access
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 217750-217768
Understanding Code Smell Detection Through Hyperparameter Optimization and Metric Correlation Analysis
Hyperparameter optimization plays a pivotal role in the reliability and generalization of machine-learning models for software quality prediction. This paper presents a comparative evaluation of three search strategies: Grid Search, Random Search, and a Hybrid approach applied to the detection of four types of code smells (BLOB, Functional Decomposition, Spaghetti Code, and Swiss Army Knife). Experiments were performed on three open-source Java systems (Azureus, ArgoUML, and Xerces) using Support Vector Machines (SVMs). The results show that all three strategies produce consistent patterns in accuracy and F1-score across the datasets, confirming the robustness of the evaluation framework. Simultaneously, Random Search tends to achieve higher recall for the Functional Decomposition smell, reflecting its ability to explore sparse and irregular hyperparameter spaces. The Hybrid approach combines the exploratory strength of Random Search with the local refinement of Grid Search, offering greater stability with a moderate computational cost. A correlation analysis of software metrics further reveals that while the Blob smell is consistently associated with size and coupling indicators, the other smells—Functional Decomposition, Spaghetti Code, and Swiss Army Knife are captured more indirectly through general structural proxies such as size, cohesion, and coupling. Overall, these findings suggest that hyperparameter tuning not only enhances predictive performance but also provides valuable insights into the structural factors underlying code smells.
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 217750-217768
Open AccessUnderstanding Code Smell Detection Through Hyperparameter Optimization and Metric Correlation Analysis
Hyperparameter optimization plays a pivotal role in the reliability and generalization of machine-learning models for software quality prediction. This paper presents a comparative evaluation of three search strategies: Grid Search, Random Search, and a Hybrid approach applied to the detection of four types of code smells (BLOB, Functional Decomposition, Spaghetti Code, and Swiss Army Knife). Experiments were performed on three open-source Java systems (Azureus, ArgoUML, and Xerces) using Support Vector Machines (SVMs). The results show that all three strategies produce consistent patterns in accuracy and F1-score across the datasets, confirming the robustness of the evaluation framework. Simultaneously, Random Search tends to achieve higher recall for the Functional Decomposition smell, reflecting its ability to explore sparse and irregular hyperparameter spaces. The Hybrid approach combines the exploratory strength of Random Search with the local refinement of Grid Search, offering greater stability with a moderate computational cost. A correlation analysis of software metrics further reveals that while the Blob smell is consistently associated with size and coupling indicators, the other smells—Functional Decomposition, Spaghetti Code, and Swiss Army Knife are captured more indirectly through general structural proxies such as size, cohesion, and coupling. Overall, these findings suggest that hyperparameter tuning not only enhances predictive performance but also provides valuable insights into the structural factors underlying code smells.
- 28 July 2024
- Published by Springer Nature
- p. 585-595
Software Defect Prediction: A Machine Learning Approach with Voting Ensemble
- 28 July 2024
- Published by Springer Nature
- p. 585-595
Software Defect Prediction: A Machine Learning Approach with Voting Ensemble