Ivana Dragović
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ivana Dragović has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Pavle Milošević
Faculty of Organizational Sciences, University of Belgrade, 11000 Belgrade, Serbia
5 shared publications - Bratislav Petrović
University of Belgrade
2 shared publications - Milica Zukanović
Faculty of Organizational Sciences, University of Belgrade, Jove Ilića 154, Belgrade, 11000, Serbia
2 shared publications - Aleksandar Rakićević
University of Belgrade
1 shared publication - Ana Poledica
University of Belgrade
1 shared publication - Dejan Milošević
Faculty of Organizational Sciences, University of Belgrade, Jove Ilića 154, Belgrade, 11000, Serbia
1 shared publication
Latest Publications
- Open Access
- 27 August 2026
- Published by SAGE Publications in Journal of Sports Analytics
- Vol. 12
From rookie to contract extension: Modeling NBA player career trajectories with machine learning
This paper investigates machine learning-based prediction of players’ long-term career trajectories at different career stages. Specifically, we predict whether a player is likely to achieve Elite Player , High-Impact Starter or Rotation Player status based on data from their first one, three, and five NBA seasons. The target classes are expert-defined, subjective categories intended to capture meaningful differences in players’ career success and on-court impact. We collected, analyzed, and preprocessed a dataset of 942 players, described by 60 attributes representing their performance metrics and physical characteristics. We compare the classification performance of Multilayer Perceptron, Random Forest, and XGBoost, along with Logistic Regression as a benchmark. Furthermore, we conducted two experiments: one that takes into account the effect of NBA era player was active and another that neglects it. Finally, we identify the most important attributes contributing to classification outcome. Random Forest achieves the best performance after the rookie season (ROCAUC = 0.671 ± 0.039), indicating that career outcomes can be predicted only to a limited extent from rookie-season data. Performance improves substantially after three seasons (0.793 ± 0.025) and five seasons (0.859 ± 0.023), suggesting that additional performance history provides much stronger signals of long-term career success. PER is identified as the most important performance indicator.
- 27 August 2026
- Published by SAGE Publications in Journal of Sports Analytics
- Vol. 12
Open AccessFrom rookie to contract extension: Modeling NBA player career trajectories with machine learning
This paper investigates machine learning-based prediction of players’ long-term career trajectories at different career stages. Specifically, we predict whether a player is likely to achieve Elite Player , High-Impact Starter or Rotation Player status based on data from their first one, three, and five NBA seasons. The target classes are expert-defined, subjective categories intended to capture meaningful differences in players’ career success and on-court impact. We collected, analyzed, and preprocessed a dataset of 942 players, described by 60 attributes representing their performance metrics and physical characteristics. We compare the classification performance of Multilayer Perceptron, Random Forest, and XGBoost, along with Logistic Regression as a benchmark. Furthermore, we conducted two experiments: one that takes into account the effect of NBA era player was active and another that neglects it. Finally, we identify the most important attributes contributing to classification outcome. Random Forest achieves the best performance after the rookie season (ROCAUC = 0.671 ± 0.039), indicating that career outcomes can be predicted only to a limited extent from rookie-season data. Performance improves substantially after three seasons (0.793 ± 0.025) and five seasons (0.859 ± 0.023), suggesting that additional performance history provides much stronger signals of long-term career success. PER is identified as the most important performance indicator.
- Open Access
- 9 September 2024
- Published by International Conference on Information Systems Development
Logic-Based Evaluation of Production Scheduling Rules Using Interpolative Boolean Algebra
This paper proposes a logic-based approach based on Interpolative Boolean Algebra (IBA) for multi-criteria evaluation of different priority and dispatching rules for production scheduling. Scheduling is crucial in optimizing operational activities, enabling efficient resource allocation within specific time constraints. While standard approaches to multi-criteria evaluation often use the weighted sum or weighted product method, they cannot capture logical and statistical relationships from the data. To address these limitations, we propose logical aggregation (LA) based on IBA, ensuring transparency and explainability in data aggregation. This paper evaluates the performance of six well-known priority and dispatching rules on 30 common benchmark instances of the job shop problem based on four scheduling criteria functions as input attributes. Analysis shows that the Critical Ratio rule performs the best, with Earliest Due Date also being a solid recommendation. This is a valuable insight for production managers unable to perform time-consuming simulations when facing tight deadlines.
- 9 September 2024
- Published by International Conference on Information Systems Development
Open AccessLogic-Based Evaluation of Production Scheduling Rules Using Interpolative Boolean Algebra
This paper proposes a logic-based approach based on Interpolative Boolean Algebra (IBA) for multi-criteria evaluation of different priority and dispatching rules for production scheduling. Scheduling is crucial in optimizing operational activities, enabling efficient resource allocation within specific time constraints. While standard approaches to multi-criteria evaluation often use the weighted sum or weighted product method, they cannot capture logical and statistical relationships from the data. To address these limitations, we propose logical aggregation (LA) based on IBA, ensuring transparency and explainability in data aggregation. This paper evaluates the performance of six well-known priority and dispatching rules on 30 common benchmark instances of the job shop problem based on four scheduling criteria functions as input attributes. Analysis shows that the Critical Ratio rule performs the best, with Earliest Due Date also being a solid recommendation. This is a valuable insight for production managers unable to perform time-consuming simulations when facing tight deadlines.
- Open Access
- 23 March 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (7) , 950
IBA-VNS: A Logic-Based Machine Learning Algorithm and Its Application in Surgery
The interpretability and explainability of machine learning (ML) approaches play a key role in the trustworthiness of ML models in various applications. The objective of this paper is to incorporate a logic-based reasoning in the ML model that is not only accurate but also interpretable and easily applied. More precisely, we propose a hybrid IBA-VNS approach based on interpolative Boolean algebra (IBA) and variable neighborhood search (VNS). IBA is chosen over traditional multi-valued and/or fuzzy logic techniques due to its consistency in preserving all Boolean axioms. The VNS heuristic is used for model training, i.e., determining the optimal logical aggregation function within the IBA framework for solving observed prediction problems. Obtained logic aggregation functions are easy to understand and may provide additional insight to the decision-maker. The proposed approach does not require any domain knowledge and is applicable in various domains. IBA-VNS is evaluated on several standard datasets. Further, IBA-VNS is applied to the real-world problem of predicting hospital length of stay (LOS), showing exceptional results in terms of interpretability and accuracy. In fact, the dataset is collected from the LabSerb program regarding colorectal surgeries in the period 2015–2023. The proposed approach extracted knowledge regarding the problem, i.e., the causal relations between the patient’s health condition and LOS, along with achieving an MAE of 1.144 days.
- 23 March 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (7) , 950
Open AccessIBA-VNS: A Logic-Based Machine Learning Algorithm and Its Application in Surgery
The interpretability and explainability of machine learning (ML) approaches play a key role in the trustworthiness of ML models in various applications. The objective of this paper is to incorporate a logic-based reasoning in the ML model that is not only accurate but also interpretable and easily applied. More precisely, we propose a hybrid IBA-VNS approach based on interpolative Boolean algebra (IBA) and variable neighborhood search (VNS). IBA is chosen over traditional multi-valued and/or fuzzy logic techniques due to its consistency in preserving all Boolean axioms. The VNS heuristic is used for model training, i.e., determining the optimal logical aggregation function within the IBA framework for solving observed prediction problems. Obtained logic aggregation functions are easy to understand and may provide additional insight to the decision-maker. The proposed approach does not require any domain knowledge and is applicable in various domains. IBA-VNS is evaluated on several standard datasets. Further, IBA-VNS is applied to the real-world problem of predicting hospital length of stay (LOS), showing exceptional results in terms of interpretability and accuracy. In fact, the dataset is collected from the LabSerb program regarding colorectal surgeries in the period 2015–2023. The proposed approach extracted knowledge regarding the problem, i.e., the causal relations between the patient’s health condition and LOS, along with achieving an MAE of 1.144 days.
- Open Access
- 1 September 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (17) , 2115
A Novel Approach to Generalized Intuitionistic Fuzzy Sets Based on Interpolative Boolean Algebra
One of the main issues in IFS theory are generalizations of intuitionistic fuzzy set (IFS) definition as well as IFS operations. In this paper, we present the LBIFS-IBA approach by applying operations based on interpolative Boolean algebra (IBA) on generalized IFS. Namely, LBIFS are defined as a special case of Liu’s generalized IFS with the maximal interpretational surface. By extending the interpretational surface, the descriptive power of the approach is enhanced, and therefore the problematic situations when can be modeled. In addition, IBA-based algebra secures Boolean properties of the proposed approach. Considerable attention is given to comprehension of uncertainty within LBIFS-IBA, i.e., we propose a novel manner of uncertainty interpretation by treating values from [−1,1] interval. In order to prove its importance, we compare LBIFS-IBA with several well-known IFS generalizations, showing that only our approach offers meaningful uncertainty interpretation is all selected cases. Additionally, we illustrate the practical benefits of LBIFS-IBA by applying it to an example of modeling Japanese candlesticks for price charting and paying special attention to uncertainty interpretation.- 1 September 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (17) , 2115
Open AccessA Novel Approach to Generalized Intuitionistic Fuzzy Sets Based on Interpolative Boolean Algebra
One of the main issues in IFS theory are generalizations of intuitionistic fuzzy set (IFS) definition as well as IFS operations. In this paper, we present the LBIFS-IBA approach by applying operations based on interpolative Boolean algebra (IBA) on generalized IFS. Namely, LBIFS are defined as a special case of Liu’s generalized IFS with the maximal interpretational surface. By extending the interpretational surface, the descriptive power of the approach is enhanced, and therefore the problematic situations when can be modeled. In addition, IBA-based algebra secures Boolean properties of the proposed approach. Considerable attention is given to comprehension of uncertainty within LBIFS-IBA, i.e., we propose a novel manner of uncertainty interpretation by treating values from [−1,1] interval. In order to prove its importance, we compare LBIFS-IBA with several well-known IFS generalizations, showing that only our approach offers meaningful uncertainty interpretation is all selected cases. Additionally, we illustrate the practical benefits of LBIFS-IBA by applying it to an example of modeling Japanese candlesticks for price charting and paying special attention to uncertainty interpretation.