Anna Kalenkova
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
Research Subjects
Anna Kalenkova has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Artem Polyvyanyy
The University of Melbourne
9 shared publications - Wil M. P. van der Aalst
Process and Data Science (PADS), RWTH Aachen University, 52074 Aachen, Germany
6 shared publications - Lewis Mitchell
Adelaide University
5 shared publications - Andrei Tour
The University of Melbourne 3010 VIC Australia
4 shared publications - Irina Aleksandrovna Lomazova
HSE University, Moscow, Russia
4 shared publications - Adam Hamilton
Affiliation School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, South Australia, Australia
3 shared publications
Latest Publications
- 2 August 2026
- Published by Springer Nature
- p. 380-391
Discovering and Analyzing Stochastic Processes to Reduce Waste in Food Retail
- 2 August 2026
- Published by Springer Nature
- p. 380-391
Discovering and Analyzing Stochastic Processes to Reduce Waste in Food Retail
- Open Access
- 16 July 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (14) , 2566
A Practical Guide to the Multi-Dimensional Elo Rating System
The multi-dimensional Elo rating system was designed to be a method of extending the more popular Elo system to model a wider variety of phenomena based on pairwise comparisons. This is useful in comparing the behaviours of machine learning models that would otherwise be black boxes. Unfortunately, the mElo rating system as it is currently formulated in the academic literature contains feedback loops that prevent the mElo rating system from correctly inferring an expected pairwise comparison matrix. In this paper, we propose an altered version of the mElo rating system that removes the feedback loops and ensures that a certain level of accuracy can be achieved. Furthermore, we demonstrate how the geometry associated with the model behind the multi-dimensional Elo rating system introduces complexities not present in the Elo rating system. We discuss some of these differences and how they affect the use and interpretation of the mElo rating system. We compare our version of the multi-dimensional Elo rating system to other rating systems and demonstrate that it provides the most precise estimates of an expected payoff matrix in realistic situations; we also discuss methods to help the reader select the learning rate. We conclude the paper with a list of recommendations for the practitioner to ensure that the mElo rating system is being used correctly to infer a unique pairwise comparison matrix.
- 16 July 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (14) , 2566
Open AccessA Practical Guide to the Multi-Dimensional Elo Rating System
The multi-dimensional Elo rating system was designed to be a method of extending the more popular Elo system to model a wider variety of phenomena based on pairwise comparisons. This is useful in comparing the behaviours of machine learning models that would otherwise be black boxes. Unfortunately, the mElo rating system as it is currently formulated in the academic literature contains feedback loops that prevent the mElo rating system from correctly inferring an expected pairwise comparison matrix. In this paper, we propose an altered version of the mElo rating system that removes the feedback loops and ensures that a certain level of accuracy can be achieved. Furthermore, we demonstrate how the geometry associated with the model behind the multi-dimensional Elo rating system introduces complexities not present in the Elo rating system. We discuss some of these differences and how they affect the use and interpretation of the mElo rating system. We compare our version of the multi-dimensional Elo rating system to other rating systems and demonstrate that it provides the most precise estimates of an expected payoff matrix in realistic situations; we also discuss methods to help the reader select the learning rate. We conclude the paper with a list of recommendations for the practitioner to ensure that the mElo rating system is being used correctly to infer a unique pairwise comparison matrix.
- 9 June 2026
- Published by Springer Nature
- p. 167-183
Explaining ML-Based Decision Models Through Process Mining Techniques
- 9 June 2026
- Published by Springer Nature
- p. 167-183
Explaining ML-Based Decision Models Through Process Mining Techniques
- Open Access
- 2 June 2026
- Published by MDPI AG in Preprints.org
A Practical Guide to the Multi-Dimensional Elo Rating System
The multi-dimensional Elo rating system was designed to be a method of extending the more popular Elo system to model a wider variety of phenomena based on pairwise comparisons. This is useful in comparing the behaviours of machine learning models that would otherwise be black boxes. Unfortunately, the mElo rating system as it is currently formulated in the academic literature contains feedback loops that prevent the mElo rating system from correctly inferring an expected pairwise comparison matrix. In this paper, we propose an altered version of the mElo rating system that removes the feedback loops and ensures that a certain level of accuracy can be achieved. Furthermore, we demonstrate how the geometry associated with the model behind the multi-dimensional Elo rating system introduces complexities not present in the Elo rating system. We discuss some of these differences and how they affect the use and interpretation of the mElo rating system. We conclude the paper with a list of recommendations for the practitioner to ensure that the mElo rating system is being used correctly to infer a unique pairwise comparison matrix.
- 2 June 2026
- Published by MDPI AG in Preprints.org
Open AccessA Practical Guide to the Multi-Dimensional Elo Rating System
The multi-dimensional Elo rating system was designed to be a method of extending the more popular Elo system to model a wider variety of phenomena based on pairwise comparisons. This is useful in comparing the behaviours of machine learning models that would otherwise be black boxes. Unfortunately, the mElo rating system as it is currently formulated in the academic literature contains feedback loops that prevent the mElo rating system from correctly inferring an expected pairwise comparison matrix. In this paper, we propose an altered version of the mElo rating system that removes the feedback loops and ensures that a certain level of accuracy can be achieved. Furthermore, we demonstrate how the geometry associated with the model behind the multi-dimensional Elo rating system introduces complexities not present in the Elo rating system. We discuss some of these differences and how they affect the use and interpretation of the mElo rating system. We conclude the paper with a list of recommendations for the practitioner to ensure that the mElo rating system is being used correctly to infer a unique pairwise comparison matrix.
- 1 April 2026
- Published by Springer Nature
- p. 69-81
Discovering Coordinated Processes from Social Online Networks
- 1 April 2026
- Published by Springer Nature
- p. 69-81
Discovering Coordinated Processes from Social Online Networks
- Open Access
- 26 December 2025
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 20 (12) , e0338261
The impact of intransitivity on the Elo rating system
This paper studies the behaviour of the Elo rating system when the underlying modelling assumptions are not met. The Elo rating system is a popular statistical technique used to analyse pairwise comparison data. It is perhaps best known for rating chess players. The crucial assumption behind the Elo rating system is that the probability of which players wins a chess game depends primarily on a real-valued parameter, that quantifies the player’s “skill". This implicitly assumes that the binary relation “more likely to win against" is transitive. This paper studies how the Elo rating system behaves when this assumption is relaxed. First, we prove that once the assumption of transitivity is relaxed, the Elo ratings exhibits the undesirable property that estimated ratings are dependent on who plays who. Second, we prove that even when the assumption of transitivity is relaxed, for a given distribution with which players are selected, there is a unique point where the expected change of Elo ratings at that point is zero. This point represents the maximum likelihood estimator of the Elo ratings, given the observed data. Finally, we introduce a statistic that can be used to measure the intransitivity present in a game. We derive this measurement, and demonstrate on simulated data that it satisfies some useful sanity tests.
- 26 December 2025
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 20 (12) , e0338261
Open AccessThe impact of intransitivity on the Elo rating system
This paper studies the behaviour of the Elo rating system when the underlying modelling assumptions are not met. The Elo rating system is a popular statistical technique used to analyse pairwise comparison data. It is perhaps best known for rating chess players. The crucial assumption behind the Elo rating system is that the probability of which players wins a chess game depends primarily on a real-valued parameter, that quantifies the player’s “skill". This implicitly assumes that the binary relation “more likely to win against" is transitive. This paper studies how the Elo rating system behaves when this assumption is relaxed. First, we prove that once the assumption of transitivity is relaxed, the Elo ratings exhibits the undesirable property that estimated ratings are dependent on who plays who. Second, we prove that even when the assumption of transitivity is relaxed, for a given distribution with which players are selected, there is a unique point where the expected change of Elo ratings at that point is zero. This point represents the maximum likelihood estimator of the Elo ratings, given the observed data. Finally, we introduce a statistic that can be used to measure the intransitivity present in a game. We derive this measurement, and demonstrate on simulated data that it satisfies some useful sanity tests.
- Open Access
- 4 November 2025
- Published by Elsevier in Information Systems
- Vol. 137
SOLID-M: An ontology-aware quality framework for conceptual models discovered from event data
- 4 November 2025
- Published by Elsevier in Information Systems
- Vol. 137
Open AccessSOLID-M: An ontology-aware quality framework for conceptual models discovered from event data
- Open Access
Discovering Coordinated Processes From Social Online Networks
The rapid growth of social media presents a unique opportunity to study coordinated agent behavior in an unfiltered environment. Online processes often exhibit complex structures that reflect the nature of the user behavior, whether it is authentic and genuine, or part of a coordinated effort by malicious agents to spread misinformation and disinformation. Detection of AI-generated content can be extremely challenging due to the high quality of large language model-generated text. Therefore, approaches that use metadata like post timings are required to effectively detect coordinated AI-driven campaigns. Existing work that models the spread of information online is limited in its ability to represent different control flows that occur within the network in practice. Process mining offers techniques for the discovery of process models with different routing constructs and are yet to be applied to social networks. We propose to leverage process mining methods for the discovery of AI and human agent behavior within social networks. Applying process mining techniques to real-world Twitter (now X) event data, we demonstrate how the structural and behavioral properties of discovered process models can reveal coordinated AI and human behaviors online.
Open AccessDiscovering Coordinated Processes From Social Online Networks
The rapid growth of social media presents a unique opportunity to study coordinated agent behavior in an unfiltered environment. Online processes often exhibit complex structures that reflect the nature of the user behavior, whether it is authentic and genuine, or part of a coordinated effort by malicious agents to spread misinformation and disinformation. Detection of AI-generated content can be extremely challenging due to the high quality of large language model-generated text. Therefore, approaches that use metadata like post timings are required to effectively detect coordinated AI-driven campaigns. Existing work that models the spread of information online is limited in its ability to represent different control flows that occur within the network in practice. Process mining offers techniques for the discovery of process models with different routing constructs and are yet to be applied to social networks. We propose to leverage process mining methods for the discovery of AI and human agent behavior within social networks. Applying process mining techniques to real-world Twitter (now X) event data, we demonstrate how the structural and behavioral properties of discovered process models can reveal coordinated AI and human behaviors online.
- Open Access
- 26 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 38035-38053
Performance Analysis: Discovering Semi-Markov Models From Event Logs
Process mining is a well-established discipline of data analysis focused on the discovery of process models from information systems’ event logs. Recently, an emerging subarea of process mining, known as stochastic process discovery, has started to evolve. Stochastic process discovery considers frequencies of events in the event data and allows for a more comprehensive analysis. In particular, when the durations of activities are presented in the event log, performance characteristics of the discovered stochastic models can be analyzed, e.g., the overall process execution time can be estimated. Existing performance analysis techniques usually discover stochastic process models from event data, and then simulate these models to evaluate their execution times. These methods rely on empirical approaches. This paper proposes analytical techniques for performance analysis that allow for the derivation of statistical characteristics of the overall processes’ execution times in the presence of arbitrary time distributions of events modeled by semi-Markov processes. The proposed methods include express analysis, focused on the mean execution time estimation, and full analysis techniques that build probability density functions (PDFs) of process execution times in both continuous and discrete forms. These methods are implemented and tested on real-world event data, demonstrating their potential for what-if analysis by providing solutions without resorting to simulation. Specifically, we demonstrated that the discrete approach is more time-efficient for small duration support sizes compared to the simulation technique. Furthermore, we showed that the continuous approach, with PDFs represented as Mixtures of Gaussian Models (GMMs), facilitates the discovery of more compact and interpretable models.
- 26 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 38035-38053
Open AccessPerformance Analysis: Discovering Semi-Markov Models From Event Logs
Process mining is a well-established discipline of data analysis focused on the discovery of process models from information systems’ event logs. Recently, an emerging subarea of process mining, known as stochastic process discovery, has started to evolve. Stochastic process discovery considers frequencies of events in the event data and allows for a more comprehensive analysis. In particular, when the durations of activities are presented in the event log, performance characteristics of the discovered stochastic models can be analyzed, e.g., the overall process execution time can be estimated. Existing performance analysis techniques usually discover stochastic process models from event data, and then simulate these models to evaluate their execution times. These methods rely on empirical approaches. This paper proposes analytical techniques for performance analysis that allow for the derivation of statistical characteristics of the overall processes’ execution times in the presence of arbitrary time distributions of events modeled by semi-Markov processes. The proposed methods include express analysis, focused on the mean execution time estimation, and full analysis techniques that build probability density functions (PDFs) of process execution times in both continuous and discrete forms. These methods are implemented and tested on real-world event data, demonstrating their potential for what-if analysis by providing solutions without resorting to simulation. Specifically, we demonstrated that the discrete approach is more time-efficient for small duration support sizes compared to the simulation technique. Furthermore, we showed that the continuous approach, with PDFs represented as Mixtures of Gaussian Models (GMMs), facilitates the discovery of more compact and interpretable models.
- 1 September 2023
- Published by Springer Nature
- p. 284-302
Agent Miner: An Algorithm for Discovering Agent Systems from Event Data
- 1 September 2023
- Published by Springer Nature
- p. 284-302
Agent Miner: An Algorithm for Discovering Agent Systems from Event Data