Rodolfo Bojorque

Dr. Rodolfo Bojorque

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 December 2017 in IEEE Access
Verified
Journal Article
Open access
JSJESUS BOBADILLA SANCHO
JESUS BOBADILLA SANCHO
RBRodolfo Bojorque
Rodolfo Bojorque
AHAntonio Hernando
Antonio Hernando
RHRemigio Hurtado
Remigio Hurtado
Recommender Systems present a high-level of sparsity in their ratings matrices. The collaborative filtering sparse data makes it difficult to: 1) compare elements using memory-based solutions; 2) obtain precise models using model-based solutions; 3) get accurate predictions; and 4) properly cluster elements. We propose the use of a Bayesian non-negative matrix factorization (BNMF) method to improve the current clustering results in the collaborative filtering area. We also provide an original pre-clustering algorithm adapted to the proposed probabilistic method. Results obtained using several open data sets show: 1) a conclusive clustering quality improvement when BNMF is used, compared with the classical matrix factorization or to the improved KMeans results; 2) a higher predictions accuracy using matrix factorizationbased methods than using improved KMeans; and 3) better BNMF execution times compared with those of the classic matrix factorization, and an additional improvement when using the proposed pre-clustering algorithm.

11 June 2019 in Advances in Intelligent Systems and Computing
Verified
Book Chapter
Closed access
PDF file
RBRodolfo Bojorque
Rodolfo Bojorque
FPFernando Pesántez-Avilés
Fernando Pesántez-Avilés

28 November 2025 in Algorithms
Verified
Journal Article
Open access
PDF file
MAMiguel Arcos-Argudo
Miguel Arcos-Argudo
RBRodolfo Bojorque
Rodolfo Bojorque
ATAndrés Torres
Andrés Torres
Intrusion detection systems (IDSs) must balance detection quality with operational transparency. We present a deterministic, leakage-free comparison of three classical classifiers: Naïve Bayes (NB), Logistic Regression (LR), and Linear Discriminant Analysis (LDA). We also propose a hybrid pipeline that trains LR on Autoencoder embeddings (AE). Experiments use NSL-KDD and CICIDS2017 under two regimes (with/without SMOTE (Synthetic Minority Oversampling Technique) applied only on training data). All preprocessing (one-hot encoding, scaling, and imputation) is fitted on the training split; fixed seeds and deterministic TensorFlow settings ensure exact reproducibility. We report a complete metric set—Accuracy, Precision, Recall, F1, Area Under the Curve (AUC), and False Alarm Rate (FAR)—and release a replication package (code, preprocessing artifacts, and saved prediction scores) to regenerate all reported tables and metrics. On NSL-KDD, AE+LR yields the highest AUC (≈0.904) and the strongest F1 among the evaluated models (e.g., 0.7583 with SMOTE), while LDA slightly edges LR on Accuracy/F1. NB attains very high Precision (≈0.98) but low Recall (≈0.24), resulting in the weakest F1, yet a low FAR due to conservative decisions. On CICIDS2017, LR delivers the best Accuracy/F1 (0.9878/0.9752 without SMOTE), with AE+LR close behind; both approach ceiling AUC (≈0.996). SMOTE provides modest gains on NSL-KDD and limited benefits on CICIDS2017. Overall, LR/LDA remain strong, interpretable baselines, while AE+LR improves separability (AUC) without sacrificing a simple, auditable decision layer for practical IDS deployment.

5 July 2018 in IEEE Access
Verified
Journal Article
Open access
Fernando OrtegaFernando Ortega
Fernando Ortega
RHRemigio Hurtado
Remigio Hurtado
JSJESUS BOBADILLA SANCHO
JESUS BOBADILLA SANCHO
RBRodolfo Bojorque
Rodolfo Bojorque
Recommendation to group of users is a big challenge for collaborative filtering. The recommendations to groups of users arise from the convenience of being able to recommend a group of users about products or services that satisfy the entire group. In this paper, we propose the similarity measure SMGU, tailored for collaborative filtering recommendations to groups of users. This similarity measure combines both numerical and non-numerical information. Numerical information is weighted attending to the rating singularity of the group members. This paper focuses on the assumption that the singularity of the ratings cast by the users of the group is a relevant information for finding suitable neighbors. For each item, we consider that a rating is singular for a group or for a user when that rating is different from the majority of the rating cast by the other users. Non-numerical structural information can be considered as valuable to match group preferences with neighbors preferences. Experiments have been run using open recommender systems datasets. Compared with representative baselines, results show accuracy improvements when the proposed method is used. Additionally, this paper provides a section devoted to the experiments reproducibility issue. Finally, this work opens opportunities to face new challenges in the recommendation to group of users: explanation of recommendations, determination of reliability measures, and improvement of accuracy, novelty and diversity results.


28 December 2018 in IEEE Access
Verified
Journal Article
Open access
RHRemigio Hurtado
Remigio Hurtado
JSJESUS BOBADILLA SANCHO
JESUS BOBADILLA SANCHO
RBRodolfo Bojorque
Rodolfo Bojorque
Fernando OrtegaFernando Ortega
Fernando Ortega
Xin LiXin Li
Xin Li
Recommender systems clustering is an important issue, both for the improvement of the collaborative filtering accuracy and to obtain analytical information from their high sparse datasets. Recommender systems items and users usually share features belonging to different clusters; e.g. a musicalcomedy movie. Soft clustering, therefore, is the collaborative filtering clustering most natural approach. In this paper, we propose a new prediction approach for probabilistic soft clustering methods. Additionally, we put to the test a not traditional scientific documentation collaborative filtering dataset: SD4AI, and we compare results with the Movielens baseline. Not traditional collaborative filtering datasets have challenging features such as: not regular rating frequency distributions, broad range of rating values and a particularly high sparsity. Results show the suitability of using soft-clustering approaches, where their probabilistic overlapping parameters find optimum values when balanced hard/soft clustering is used. This paper opens some promising lines of research, such as: recommender systems use in the scientific documentation field, IoT-based datasets processing, and design of new model-based soft clustering methods.