Demo Data from SIGIR 2026 / reviewers in the wild / expert
Evgenya Romanenkova
dblp:223/2727 · also Evgenia Romanenkova
· DBLP profile ↗
4ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0003-3623-0011ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
2 papers |
Data mining · 100% | |
| Artificial intelligence
3 papers |
Time series and sequential data · 48% Video understanding and tracking · 36% Deep learning architectures and training · 16% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 3 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › time series analysis
change point detection |
1.4 | 2 | 2025 | WWAggr: A Window Wasserstein-Based Aggregation for Ensemble Change Point Detection · ICDM 2025 InDiD: Instant Disorder Detection via a Principled Neural Network · ACM Multimedia 2022 |
Data mining
threshold selection |
0.9 | 1 | 2025 | WWAggr: A Window Wasserstein-Based Aggregation for Ensemble Change Point Detection · ICDM 2025 |
Machine learning › Time series and sequential data
change-point detection |
0.8 | 1 | 2024 | Normalizing Self-Supervised Learning for Provably Reliable Change Point Detection · ICDM 2024 |
Methods — techniques the papers use, named apart from their topics
representation learning · 2.7wasserstein distance · 1.7ensemble aggregation · 1.7spectral normalization · 1.5neural network · 1.1differentiable loss function · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | WWAggr: A Window Wasserstein-Based Aggregation for Ensemble Change Point DetectionabstractChange Point Detection (CPD) aims to identify moments of abrupt distribution shifts in data streams. Real-world high-dimensional CPD remains challenging due to data pattern complexity and violation of common assumptions. Resorting to standalone deep neural networks, the current state-of-theart detectors have yet to achieve perfect quality. Concurrently, ensembling provides more robust solutions, boosting the performance. In this paper, we investigate ensembles of deep change point detectors and realize that standard prediction aggregation techniques, e.g., averaging, are suboptimal and fail to account for problem peculiarities. Alternatively, we introduce WWAggr - a novel task-specific method of ensemble aggregation based on the Wasserstein distance. Our procedure is versatile, working effectively with various ensembles of deep CPD models. Moreover, unlike existing solutions, we practically lift a long-standing problem of the decision threshold selection for CPD. Alexander Stepikin, Evgenya Romanenkova, Alexey Zaytsev 0002 |
ICDM | 2 |
| 2024 | Normalizing Self-Supervised Learning for Provably Reliable Change Point DetectionabstractChange point detection (CPD) methods aim to identify abrupt shifts in the distribution of input data streams. Accurate estimators for this task are crucial across various real-world scenarios. Yet, traditional unsupervised CPD techniques face significant limitations, often relying on strong assumptions or suffering from low expressive power due to inherent model simplicity. In contrast, representation learning methods overcome these drawbacks by offering flexibility and the ability to capture the full complexity of the data without imposing restrictive assumptions. However, these approaches are still emerging in the CPD field and lack robust theoretical foundations to ensure their reliability. Our work addresses this gap by integrating the expressive power of representation learning with the groundedness of traditional CPD techniques. We adopt spectral normalization (SN) for deep representation learning in CPD tasks and prove that the embeddings after SN are highly informative for CPD. Our method significantly outperforms current state-of-the-art methods during the comprehensive evaluation via three standard CPD datasets. Alexandra Bazarova, Evgenya Romanenkova, Alexey Zaytsev 0002 |
ICDM | 2 |
| 2022 | InDiD: Instant Disorder Detection via a Principled Neural NetworkabstractFor sequential data, a change point is a moment of abrupt regime switch in data streams. Such changes appear in different scenarios, including simpler data from sensors and more challenging video surveillance data. We need to detect disorders as fast as possible. Classic approaches for change point detection (CPD) might underperform for semi-structured sequential data because they cannot process its structure without a proper representation. We propose a principled loss function that balances change detection delay and time to a false alarm. It approximates classic rigorous solutions but is differentiable and allows representation learning for deep models. We consider synthetic sequences, real-world data sensors and videos with change points. We carefully labelled available video data with change point moments and released it for the first time. Experiments suggest that complex data require meaningful representations tailored for the specificity of the CPD task --- and our approach provides them outperforming considered baselines. For example, for explosion detection in video, the F1 score for our method is 0.53 compared to baseline scores of 0.31 and 0.35. Evgenya Romanenkova, Alexander Stepikin, Matvey Morozov, Alexey Zaytsev 0002 |
ACM Multimedia | 1 |
| 2020 | Real-Time Data-Driven Detection of the Rock-Type Alteration During a Directional DrillingabstractDuring directional drilling, a bit may sometimes go to a nonproductive rock layer due to the gap about 20 m between the bit and high-fidelity rock-type sensors. The only way to detect the lithotype changes in time is the usage of measurements while drilling (MWD). However, there are no general mathematical modeling approaches that both well reconstruct the rock type based on MWD data and correspond to specifics of the oil and gas industry. In this letter, we present a data-driven procedure that utilizes MWD data for quick detection of changes in rock types. We propose the approach that combines traditional machine learning (ML) based on the solution of the rock-type classification problem with change detection procedures rarely used before in oil and gas industry. The data come from a newly developed oilfield in the north of western Siberia. The results suggest that we can detect a significant part of changes in rock types, reducing the change detection delay from 20 to 1.8 m and the number of false-positive alarms from 43 to 6 per well. Evgenya Romanenkova, Alexey Zaytsev 0002, Nikita Klyuchnikov, Arseniy Gruzdev, Ksenia Antipova, Leyla S. Ismailova, Evgeny Burnaev, Artyom Semenikhin, Vitaliy Koryabkin, Igor Simon, Dmitry A. Koroteev |
IEEE Geosci. Remote. Sens. Lett. | 1 |