Urszula Bentkowska
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Urszula Bentkowska has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Barbara Pekala
University of Rzeszów
13 shared publications - Marcin Mrukowicz
University of Rzesz w, Poland
9 shared publications - Jan G. Bazan
Faculty of Exact and Technical Science, Institute of Computer Science, University of Rzeszów, Rzeszów, Poland
7 shared publications - Humberto Bustince
Universidad Pública de Navarra
6 shared publications - Anna Król
University of Rzeszów
5 shared publications - Javier Fernandez
Research Group of Theory of Copulas and Applications University of Almería 04120 Almería Spain
5 shared publications
Latest Publications
- Open Access
- 17 November 2025
- Published by International Conference on Information Systems Development
Neural networks based ensemble classifier for phishing link detection
This contribution proposes an ensemble classification model which is based on neural networks prediction models and well-known online incremental learning models.The considered neural network models belong to different families, namely long-short term memory, deep feed forward and convolutional neural networks. The incremental learning models considered are Passive Aggressive, Bernoulli Naive Bayes and Stochastic Gradient Descent Classifiers. This paper aims to develop a prediction model that reduces false positives (FP) while maintaining overall model performance. Moreover, the stability of the model over time and its ability to correctly classify phishing links, even if the concept shift occur, are under considerations. The ensemble model shows promising results, demonstrating its superiority over base models. Some proposed models significantly outperform some base models according to statistical tests.
- 17 November 2025
- Published by International Conference on Information Systems Development
Open AccessNeural networks based ensemble classifier for phishing link detection
This contribution proposes an ensemble classification model which is based on neural networks prediction models and well-known online incremental learning models.The considered neural network models belong to different families, namely long-short term memory, deep feed forward and convolutional neural networks. The incremental learning models considered are Passive Aggressive, Bernoulli Naive Bayes and Stochastic Gradient Descent Classifiers. This paper aims to develop a prediction model that reduces false positives (FP) while maintaining overall model performance. Moreover, the stability of the model over time and its ability to correctly classify phishing links, even if the concept shift occur, are under considerations. The ensemble model shows promising results, demonstrating its superiority over base models. Some proposed models significantly outperform some base models according to statistical tests.
- Open Access
- 15 November 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (22) , 12133
Identifying and Predicting Changes in Behavioral Patterns for Temporal Data in Treatment of Neonatal Respiratory Failure
In this paper, we present the findings of a study focused on discovering process models and tracking their evolution over time. The research specifically targets a distinct category of these models known as behavioral patterns. Consequently, the challenges and techniques addressed here involve temporal data. To demonstrate the issues and methodologies associated with identifying process patterns and their changes, we use illustrative data from the treatment of respiratory failure in premature infants. The main achievement of the paper is to successfully model behavioral patterns using machine learning models and predict changes in a neonate’s state. That was justified by comparing the classifier’s sensitivity for cases of deterioration, improvement, and stability. Classification quality is best when the pattern remains constant. However, in the proposed model, when the pattern deteriorates, the classification quality decreases only slightly.
- 15 November 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (22) , 12133
Open AccessIdentifying and Predicting Changes in Behavioral Patterns for Temporal Data in Treatment of Neonatal Respiratory Failure
In this paper, we present the findings of a study focused on discovering process models and tracking their evolution over time. The research specifically targets a distinct category of these models known as behavioral patterns. Consequently, the challenges and techniques addressed here involve temporal data. To demonstrate the issues and methodologies associated with identifying process patterns and their changes, we use illustrative data from the treatment of respiratory failure in premature infants. The main achievement of the paper is to successfully model behavioral patterns using machine learning models and predict changes in a neonate’s state. That was justified by comparing the classifier’s sensitivity for cases of deterioration, improvement, and stability. Classification quality is best when the pattern remains constant. However, in the proposed model, when the pattern deteriorates, the classification quality decreases only slightly.
- Open Access
- 15 November 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (22) , 12130
Feature Importance Ranking Using Interval-Valued Methods and Aggregation Functions for Machine Learning Applications
Feature selection is one of the key stages in the process of creating machine learning models and conducting data analysis. This paper presents the results of research related to the implementation of a new algorithm for feature selection and ranking based on weighted interval aggregations. It took into account interval importance values obtained from dividing the dataset into subsets. The algorithm was highly effective in identifying relevant features. The results of comparative studies with nine known methods of feature importance assessment are presented. Ten synthetic datasets and five real datasets were used for the experiments. The calculations also included tests of the relevance of the results obtained. In most experiments, the IVWFR algorithm proved to be the best, achieving the best classification results after identifying subsets of relevant features.
- 15 November 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (22) , 12130
Open AccessFeature Importance Ranking Using Interval-Valued Methods and Aggregation Functions for Machine Learning Applications
Feature selection is one of the key stages in the process of creating machine learning models and conducting data analysis. This paper presents the results of research related to the implementation of a new algorithm for feature selection and ranking based on weighted interval aggregations. It took into account interval importance values obtained from dividing the dataset into subsets. The algorithm was highly effective in identifying relevant features. The results of comparative studies with nine known methods of feature importance assessment are presented. Ten synthetic datasets and five real datasets were used for the experiments. The calculations also included tests of the relevance of the results obtained. In most experiments, the IVWFR algorithm proved to be the best, achieving the best classification results after identifying subsets of relevant features.
- Open Access
- 17 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 48469-48487
Aggregation-Based Ensemble Classifier Versus Neural Networks Models for Recognizing Phishing Attacks
This contribution proposes a classifier designed to reduce the number of false positive detections. It is a self-tuning model, tested in the context of phishing link detection. In this prediction model diverse types of aggregation functions and time-series data periods are used. Aggregation functions are employed to integrate the prediction values of classification models applied in the email phishing problem. Dividing a dataset into subsets allows for incremental learning strategies. This makes it possible to gradually improve the model by using previously acquired knowledge when training on new data. The aim of the contribution is to discuss the problem of obtaining minimal value of FPR while simultaneously getting maximal value of TPR. We applied the proposed ensemble model and neural networks models which were adjusted to the incremental learning strategy (and as base models were applied typical examples of incremental learning models). The study analyzes the dataset provided by FreshMail company. The reason to consider this problem arose with the real-life problem of the Freshamil Company and the data provided by this Company. This dataset uniquely fulfills the criteria essential for our experiments. Unlike other phishing datasets, this data provides dates which is important for the incremental learning approach. The proposed approach of ensemble learning models, based on aggregation functions, is compared to the well-known neural network models which may be treated as state of the art models in recognizing phishing attacks. The main advantage of the proposed algorithm is achieving high numbers of true positives while simultaneously achieving relatively small number of false positives. According to the statistical tests, for some of the desired TPR levels, the proposed model obtained significantly better by a few percentage points results than neural network models. It mitigates the cost arising from the manual analysis of these cases by domain experts.
- 17 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 48469-48487
Open AccessAggregation-Based Ensemble Classifier Versus Neural Networks Models for Recognizing Phishing Attacks
This contribution proposes a classifier designed to reduce the number of false positive detections. It is a self-tuning model, tested in the context of phishing link detection. In this prediction model diverse types of aggregation functions and time-series data periods are used. Aggregation functions are employed to integrate the prediction values of classification models applied in the email phishing problem. Dividing a dataset into subsets allows for incremental learning strategies. This makes it possible to gradually improve the model by using previously acquired knowledge when training on new data. The aim of the contribution is to discuss the problem of obtaining minimal value of FPR while simultaneously getting maximal value of TPR. We applied the proposed ensemble model and neural networks models which were adjusted to the incremental learning strategy (and as base models were applied typical examples of incremental learning models). The study analyzes the dataset provided by FreshMail company. The reason to consider this problem arose with the real-life problem of the Freshamil Company and the data provided by this Company. This dataset uniquely fulfills the criteria essential for our experiments. Unlike other phishing datasets, this data provides dates which is important for the incremental learning approach. The proposed approach of ensemble learning models, based on aggregation functions, is compared to the well-known neural network models which may be treated as state of the art models in recognizing phishing attacks. The main advantage of the proposed algorithm is achieving high numbers of true positives while simultaneously achieving relatively small number of false positives. According to the statistical tests, for some of the desired TPR levels, the proposed model obtained significantly better by a few percentage points results than neural network models. It mitigates the cost arising from the manual analysis of these cases by domain experts.
- 16 July 2024
- Published by Springer Nature
- p. 209-223
An Ensemble Classifier Based on kNN with an Interval Threshold Strategy
- 16 July 2024
- Published by Springer Nature
- p. 209-223
An Ensemble Classifier Based on kNN with an Interval Threshold Strategy
- 25 June 2024
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 491
The effectiveness of aggregation functions used in fuzzy local contrast constructions
- 25 June 2024
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 491
The effectiveness of aggregation functions used in fuzzy local contrast constructions
- Open Access
Ensemble Classifier Based on Interval Modeling for Microarray Datasets
The purpose of the study is to propose a multi-class ensemble classifier using interval modeling dedicated to microarray datasets. An approach of creating the uncertainty intervals for the single prediction values of constituent classifiers and then aggregating the obtained intervals with the use of interval-valued aggregation functions is used. The proposed heterogeneous classification employs Random Forest, Support Vector Machines, and Multilayer Perceptron as component classifiers, utilizing cross-entropy to select the optimal classifier. Moreover, orders for intervals are applied to determine the decision class of an object. The applied interval-valued aggregation functions are tested in terms of optimizing the performance of the considered ensemble classifier. The proposed model’s quality, superior to other well-known and component classifiers, is validated through comparison, demonstrating the efficacy of cross-entropy in ensemble model construction.
Open AccessEnsemble Classifier Based on Interval Modeling for Microarray Datasets
The purpose of the study is to propose a multi-class ensemble classifier using interval modeling dedicated to microarray datasets. An approach of creating the uncertainty intervals for the single prediction values of constituent classifiers and then aggregating the obtained intervals with the use of interval-valued aggregation functions is used. The proposed heterogeneous classification employs Random Forest, Support Vector Machines, and Multilayer Perceptron as component classifiers, utilizing cross-entropy to select the optimal classifier. Moreover, orders for intervals are applied to determine the decision class of an object. The applied interval-valued aggregation functions are tested in terms of optimizing the performance of the considered ensemble classifier. The proposed model’s quality, superior to other well-known and component classifiers, is validated through comparison, demonstrating the efficacy of cross-entropy in ensemble model construction.
- 18 October 2023
- Published by Springer Nature
- p. 85-94
Parameterized Interval-Valued Aggregation Functions in Classification of Data with Large Number of Missing Values
- 18 October 2023
- Published by Springer Nature
- p. 85-94
Parameterized Interval-Valued Aggregation Functions in Classification of Data with Large Number of Missing Values
- 18 October 2023
- Published by Springer Nature
- p. 106-115
Aggregation Functions in Researching Connections Between Bio-Markers and DNA Micro-arrays
- 18 October 2023
- Published by Springer Nature
- p. 106-115
Aggregation Functions in Researching Connections Between Bio-Markers and DNA Micro-arrays
- 19 February 2022
- Published by Springer Nature
- p. 3-14
Application of Decision Rules to Discover Knowledge for Fitting Aggregations to Datasets
- 19 February 2022
- Published by Springer Nature
- p. 3-14
Application of Decision Rules to Discover Knowledge for Fitting Aggregations to Datasets