Natalia Semenova

dblp:304/2687 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
0000-0003-4189-5739ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2025 MonoDeMB: Comprehensive Monocular DepthMap Benchmark
abstract
In this paper, we introduce a comprehensive benchmark for learning-based monocular depth estimation methods. In recent years, depthmap calculation methods have achieved impressive results. The process of comparing the performance of different models requires a lot of resources and time, which can be costly for many developers. The goal of our benchmark is to provide a comparison of how the top models perform on various datasets. We present a table with results based on our tests performed on several popular datasets and one dataset introduced in this paper. In addition, we provide a toolkit that allows each model selected for the benchmark to be tested on any suitable dataset.
Vaagn Chopuryan, Mikhail Kuznetsov, Vasilii Latonov, Vladimir Mashurov, Natalia Semenova
KDD (2)5
2024 Topological and Node Noise Filtering on 3D Meshes Using Graph Neural Networks (Student Abstract)
abstract
Topological and node noise filtration are typically considered separately. Graph Neural Networks (GNN) are commonly used for node noise filtration, as they offer high efficiency and low exploitation costs. This paper explores the solution of joint node and topological noise filtration through the use of graph neural networks. Since treating a 3D mesh as a graph is challenging, an indicator function grid representation is employed as input for GNNs to perform the joint filtering. The resulting machine learning model is inspired by point cloud to mesh reconstruction algorithms and demonstrates low computational requirements during inference, producing successful results for smooth, watertight 3D models.
Vladimir Mashurov, Natalia Semenova
AAAI2
2024 From Variability to Stability: Advancing RecSys Benchmarking Practices
abstract
In the rapidly evolving domain of Recommender Systems (RecSys), new algorithms frequently claim state-of-the-art performance based on evaluations over a limited set of arbitrarily selected datasets. However, this approach may fail to holistically reflect their effectiveness due to the significant impact of dataset characteristics on algorithm performance. Addressing this deficiency, this paper introduces a novel benchmarking methodology to facilitate a fair and robust comparison of RecSys algorithms, thereby advancing evaluation practices. By utilizing a diverse set of 30 open datasets, including two introduced in this work, and evaluating 11 collaborative filtering algorithms across 9 metrics, we critically examine the influence of dataset characteristics on algorithm performance. We further investigate the feasibility of aggregating outcomes from multiple datasets into a unified ranking. Through rigorous experimental analysis, we validate the reliability of our methodology under the variability of datasets, offering a benchmarking strategy that balances quality and computational demands. This methodology enables a fair yet effective means of evaluating RecSys algorithms, providing valuable guidance for future research endeavors.
Valeriy Shevchenko, Nikita Belousov, Alexey Vasilev, Vladimir Zholobov, Artyom Sosedka, Natalia Semenova, Anna Volodkevich, Andrey V. Savchenko, Alexey Zaytsev 0002
KDD6
2022 Logistics, Graphs, and Transformers: Towards Improving Travel Time Estimation
Natalia Semenova, Vadim Porvatov, Vladislav Tishin, Artyom Sosedka, Vladislav Zamkovoy
ECML/PKDD (6)1