Anna Leontjeva

dblp:125/4044 · DBLP profile ↗
← Back
7ranked-venue papers in the field
2as first author
3since 2021 · last 2025
0000-0002-4098-3553ORCID · corroborated

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 4 (2 first)Big Data, Cloud & Distributed Data Systems · 2Information Retrieval & Web Search · 1
YearPublicationVenuePosition
2025 FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff
Andy Hu, Devika Prasad, Luiz Pizzato, Nicholas Foord, Arman Abrahamyan, Anna Leontjeva, Cooper Doyle, Dan Jermyn
IEEE Big Data6
2025 A Robust and Efficient Pipeline for Enterprise-Level Large-Scale Entity Resolution
Sandeepa Kannangara, Arman Abrahamyan, Daniel Elias, Thomas Kilby, Nadav Dar, Luiz Pizzato, Anna Leontjeva, Dan Jermyn
IEEE Big Data7
2022 A Multi-Stakeholder Recommender System for Rewards Recommendations
abstract
Australia’s largest bank, Commonwealth Bank (CBA) has a large data and analytics function that focuses on building a brighter future for all using data and decision science. In this work, we focus on creating better services for CBA customers by developing a next generation recommender system that brings the most relevant merchant reward offers that can help customers save money. Our recommender provides CBA cardholders with cashback offers from merchants, who have different objectives when they create offers. This work describes a multi-stakeholder, multi-objective problem in the context of CommBank Rewards (CBR) and describes how we developed a system that balances the objectives of the bank, its customers, and the many objectives from merchants into a single recommender system.
Naime Ranjbar Kermany, Luiz Pizzato, Thireindar Min, Callum Scott, Anna Leontjeva
RecSys5
2018 Temporal stability in predictive process monitoring
Irene Teinemaa, Marlon Dumas, Anna Leontjeva, Fabrizio Maria Maggi
Data Min. Knowl. Discov.3
2016 Combining Static and Dynamic Features for Multivariate Sequence Classification
abstract
Model precision in a classification task is highly dependent on the feature space that is used to train the model. Moreover, whether the features are sequential or static will dictate which classification method can be applied as most of the machine learning algorithms are designed to deal with either one or another type of data. In real-life scenarios, however, it is often the case that both static and dynamic features are present, or can be extracted from the data. In this work, we demonstrate how generative models such as Hidden Markov Models (HMM) and Long Short-Term Memory (LSTM) artificial neural networks can be used to extract temporal information from the dynamic data. We explore how the extracted information can be combined with the static features in order to improve the classification performance. We evaluate the existing techniques and suggest a hybrid approach, which outperforms other methods on several public datasets.
Anna Leontjeva, Ilya Kuzovkin
DSAA1
2015 Community-Based Prediction of Activity Change in Skype
abstract
A key problem for facilitators of online communication and social networks is to identify users whose activity is likely to change in the near future. Such predictions may serve as basis for targeted campaigns aimed at sustaining or increasing overall user engagement in the network. A common approach to this problem is to apply machine learning methods to make predictions at the level of individuals. These approaches consider only information about each individual user and, thus, do not exploit the social connections and structure of the network. In this paper, we approach the problem of activity change prediction at the level of communities rather than individuals. We develop predictive models of activity change over communities obtained using state-of-art community detection methods and compare their predictive power with each other and against the single-user baseline and ego networks. The results show that community-level prediction models achieve higher prediction accuracy than the traditional single-user approach, whereas a local community detection algorithm outperforms a global modularity-based method.
Irene Teinemaa, Anna Leontjeva, Marlon Dumas, Riivo Kikas
ASONAM2
2012 Fraud Detection: Methods of Analysis for Hypergraph Data
abstract
Hyper graph is a data structure that captures many-to-many relations. It comes up in various contexts, one of those being the task of detecting fraudulent users of an on-line system given known associations between the users and types of activities they take part in. In this work we explore three approaches for applying general-purpose machine learning methods to such data. We evaluate the proposed approaches on a real-life dataset of customers and achieve promising results.
Anna Leontjeva, Konstantin Tretyakov, Jaak Vilo, Taavi Tamkivi
ASONAM1