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


Rodolfo Bojorque has a total of 43 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Beyond Predictive Performance: SHAP-Based Explanations and Alignment with Literature-Based Indicators in Code Smell Detection

    by Marcela Mosquera, Rodolfo Bojorque

    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.

  • Open Access

    An Open Multi-Campus Dataset of Academic Service Requests Before and After Administrative Process Redesign

    by Rodolfo Bojorque, Andrea Plaza, Pilar Morquecho, Fernando Moscoso

    This paper presents an open, anonymized dataset of academic service requests collected before and after an administrative process redesign in a multi-campus university in Ecuador. The dataset was extracted from the Sistema Nacional Académico and covers two consecutive six-month periods: PERIOD_1, representing the original processes, and PERIOD_2, representing the redesigned processes. It contains 432 aggregated records corresponding to 97,809 requests across three pseudonymized campuses, 25 request types, and 13 workflow states. Each record combines period, campus, request type, current state, and the aggregated request count, while reducing disclosure risk through aggregation and removal of identifiers. Descriptive analyses show that request volume increased by 14.03%, while the combined share of requests observed in the Approved and Processed Request states increased from 75.71% to 77.36%. At the common extraction snapshot, the proportion of requests observed in four institutionally defined undesirable workflow states decreased from 5.20% to 4.46%. The dataset, documentation, and reproducible analysis code are publicly available through Figshare and GitHub, supporting research on higher education administration, workflow analysis, institutional analytics, and process improvement.

  • Open Access

    Beyond Model Complexity: A Reproducible Comparison of Classical Machine Learning, Matrix Factorization, Graph Embeddings, and LightGCN for Recommendation

    by Rodolfo Bojorque, David Yánez-Peter, Miguel Arcos-Argudo

    Recommender systems increasingly incorporate graph embeddings and graph neural networks to capture high-order relationships between users and items. However, the additional complexity of these approaches does not necessarily guarantee better recommendation quality than strong classical and latent-factor baselines. This study presents a reproducible comparison of six recommendation models representing four methodological families: Logistic Regression and Random Forest; Matrix Factorization with Bayesian Personalized Ranking; DeepWalk and node2vec; and LightGCN. The experiments were conducted on the MovieLens 1M dataset using a per-user temporal split. For each user, the most recent positive interaction was assigned to testing, the preceding interaction to validation, and all earlier positive interactions to training. The primary evaluation used identical candidate sets containing one held-out positive movie and 99 sampled unobserved movies. Performance was measured using Recall, Precision, Hit Rate, and NDCG at multiple cutoffs, complemented by bootstrap confidence intervals, paired statistical tests, computational-efficiency measurements, and analyses by user activity and movie popularity. Matrix Factorization achieved the best overall performance, reaching a Recall@10 of 0.7458 and an NDCG@10 of 0.4558, representing an approximately 56% improvement in NDCG@10 over Random Forest, the strongest classical baseline. Validation-based tuning improved LightGCN to an NDCG@10 of 0.2875; it significantly outperformed Logistic Regression but remained statistically indistinguishable from Random Forest after Holm correction. Tuned node2vec also significantly outperformed DeepWalk, reaching an NDCG@10 of 0.1593, although both random-walk embedding methods’ results remained substantially below than the strongest baselines. Popularity-based analysis further revealed that classical models and LightGCN achieved substantially higher ranking effectiveness for popular movies, whereas Matrix Factorization maintained comparatively stronger performance for less-popular items. These findings show that under the evaluated setting, greater model complexity did not consistently translate into higher recommendation effectiveness, and they thus highlight the importance of strong baselines, model tuning, standardized evaluation, and reproducible experimental protocols.

  • Open Access

    Beyond Model Complexity: A Reproducible Comparison of Classical Machine Learning, Matrix Factorization, Graph Embeddings, and LightGCN for Recommendation

    by Rodolfo Bojorque, David Yánez-Peter, Miguel Arcos

    Recommender systems increasingly incorporate graph embeddings and graph neural networks to capture high-order relationships between users and items. However, the additional complexity of these approaches does not necessarily guarantee better recommendation quality than strong classical and latent-factor baselines. This study presents a reproducible comparison of six recommendation models representing four methodological families: Logistic Regression, Random Forest, Matrix Factorization with Bayesian Personalized Ranking, DeepWalk, node2vec, and LightGCN. The experiments were conducted on the MovieLens 1M dataset using a per-user temporal split. For each user, the most recent positive interaction was assigned to testing, the preceding interaction to validation, and all earlier positive interactions to training. All models were evaluated using identical candidate sets containing one held-out positive movie and 99 sampled unobserved movies. Performance was measured using Recall, Precision, Hit Rate, and NDCG at multiple cutoffs, complemented by bootstrap confidence intervals, paired statistical tests, computational-efficiency measurements, and analyses by user activity and movie popularity. Matrix Factorization achieved the best overall performance, reaching a Recall@10 of 0.7458 and an NDCG@10 of 0.4558, representing an approximately 56% improvement in NDCG@10 over Random Forest, the strongest classical baseline. LightGCN did not significantly outperform Logistic Regression and remained below Random Forest, despite its higher computational cost. DeepWalk and node2vec obtained similar and substantially lower aggregate results. Popularity-based analysis further revealed that classical models and LightGCN achieved substantially higher ranking effectiveness for popular movies, whereas Matrix Factorization maintained comparatively stronger performance for less-popular items. These findings demonstrate that model complexity alone is not a reliable indicator of recommendation effectiveness and highlight the importance of strong baselines, standardized evaluation, and reproducible experimental protocols.

  • Open Access

    An Open Multi-Campus Dataset of Academic Service Requests Before and After Administrative Process Redesign

    by Rodolfo Bojorque, Andrea Plaza, Pilar Morquecho, Fernando Moscoso

    This paper presents an open, anonymized dataset of academic service requests collected before and after an administrative process redesign in a multi-campus university in Ecuador. The dataset was extracted from the Sistema Nacional Académico and covers two consecutive six-month periods: PERIOD_1, representing the original processes, and PERIOD_2, representing the redesigned processes. It contains 432 aggregated records corresponding to 97,809 requests across three anonymized campuses, 25 request types, and 13 workflow states. Each record combines period, campus, request type, current state, and the aggregated request count, while preserving privacy through aggregation and removal of identifiers. Descriptive analyses show that request volume increased by 14.03%, approved requests increased by 24.27%, and the combined rate of four institutionally defined undesirable states decreased from 5.20% to 4.46%. The dataset, documentation, and reproducible analysis code are publicly available through Figshare and GitHub, supporting research on higher education administration, workflow analysis, institutional analytics, and process improvement.

  • Open Access

    Numerically Stabilized Regularized Learning for Intrusion Detection: Conditioning, Scaling, and Cross-Dataset Transfer Analysis

    by Miguel Arcos-Argudo, Rodolfo Bojorque, Mauricio Ortiz

    This paper presents a numerical-computational analysis of ℓ2-regularized logistic learning for binary intrusion detection under heterogeneous datasets, class imbalance, and cross-dataset shift. Rather than proposing a new intrusion detection architecture, the study examines how numerical conditioning, feature scaling, feature set design, threshold selection, false negative behavior, false alarm behavior, and distribution shift affect operational detection performance. Experiments were conducted on CICIDS2017, UNSW-NB15, and CIRA-CIC-DoHBrw-2020 using reproducible train–validation–test protocols over five fixed random seeds. The numerical audit showed that standard scaling reduced the spectral condition number of traffic feature matrices by several orders of magnitude across datasets and feature configurations. However, scaling did not produce uniformly monotonic predictive gains: in some cases, raw feature optimization achieved comparable or higher F1-score, whereas scaled preprocessing produced more controlled false alarm behavior. In-domain experiments showed that dataset-specific features may improve ranking metrics such as area under the receiver-operating-characteristic curve (AUROC) or area under the precision–recall curve (AUPR) without necessarily improving thresholded operational metrics. Cross-dataset transfer experiments revealed strong source–target asymmetry, with transferred thresholds producing either near-zero positive detection or excessive false alarms. Additional robustness experiments with Random Forest and XGBoost improved in-domain F1-score and false negative rate (FNR), but did not eliminate off-domain degradation, with high FNR persisting under direct cross-dataset transfer. Finally, a Kolmogorov–Smirnov-based distribution shift analysis showed that in-domain discrepancies were small, whereas cross-dataset discrepancies were consistently large under common standardized traffic features. These findings suggest that numerical stability, ranking quality, thresholded detection performance, false negative and false alarm behavior, and distribution shift should be analyzed jointly when evaluating intrusion detection models.

  • Open Access

    Numerically Stabilized Regularized Learning for Intrusion Detection: Conditioning, Scaling, and Cross-Dataset Transfer Analysis

    by Miguel Arcos-Argudo, Rodolfo Bojorque, Mauricio Ortiz

    This paper presents a numerical-computational analysis of ℓ2-regularized logistic learning for binary intrusion detection under heterogeneous datasets, class imbalance, and cross-dataset shift. Rather than proposing a new intrusion-detection architecture, the study examines how numerical conditioning, feature scaling, feature-set design, threshold selection, and distribution shift affect operational detection behavior. Experiments were conducted on CICIDS2017, UNSW-NB15, and CIRA-CIC-DoHBrw-2020 using reproducible train-validation-test protocols over five fixed random seeds. The numerical audit showed that standard scaling reduced the spectral condition number of traffic-feature matrices by several orders of magnitude across datasets and feature configurations. However, scaling did not produce uniformly monotonic predictive gains: in some cases, raw-feature optimization achieved comparable or higher F1-score, whereas scaled preprocessing produced more controlled false-alarm behavior. In-domain experiments showed that dataset-specific features may improve ranking metrics such as AUROC or AUPR without necessarily improving thresholded operational metrics. Cross-dataset transfer experiments revealed strong source-target asymmetry, with transferred thresholds producing either near-zero positive detection or excessive false alarms. Finally, a Kolmogorov–Smirnov-based distribution-shift analysis showed that in-domain discrepancies were small, whereas cross-dataset discrepancies were consistently large under common standardized traffic features. These findings suggest that numerical stability, ranking quality, thresholded detection performance, false-alarm behavior, and distribution shift should be analyzed jointly when evaluating intrusion-detection models.