Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alexander Stepikin

dblp:318/2983 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0002-0078-4875ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
2 papers
Video understanding and tracking · 69% Deep learning architectures and training · 31%

Topics — the 2 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › time series analysis
change point detection
1.422025
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.912025
WWAggr: A Window Wasserstein-Based Aggregation for Ensemble Change Point Detection · ICDM 2025

Methods — techniques the papers use, named apart from their topics

wasserstein distance · 1.7ensemble aggregation · 1.7representation learning · 1.1neural network · 1.1differentiable loss function · 1.1
YearPublicationVenuePosition
2025 WWAggr: A Window Wasserstein-Based Aggregation for Ensemble Change Point Detection
abstract
Change 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
ICDM1
2022 InDiD: Instant Disorder Detection via a Principled Neural Network
abstract
For 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 Multimedia2