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

Sergey Zeltyn

dblp:27/5632 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0003-2540-1604ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 48% Video understanding and tracking · 28% Trustworthy machine learning · 16%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 50% Software testing · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Video understanding and tracking
activity prediction
0.912025
SNAP: Semantic Stories for Next Activity Prediction · AAAI 2025
Software maintenance and evolution
AIOps
0.912025
Taming Uncertainty via Automation: Observing, Analyzing, and Optimizing Agentic AI Systems · ASE 2025
Software testing
testing of AI-based systems
0.912025
Taming Uncertainty via Automation: Observing, Analyzing, and Optimizing Agentic AI Systems · ASE 2025
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network
0.512021
Learning the Parameters of Bayesian Networks from Uncertain Data · AAAI 2021
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
expectation-maximization
0.512021
Learning the Parameters of Bayesian Networks from Uncertain Data · AAAI 2021
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
parameter estimation
0.512021
Learning the Parameters of Bayesian Networks from Uncertain Data · AAAI 2021
Machine learning › Trustworthy machine learning › uncertainty estimation
uncertain data
0.512021
Learning the Parameters of Bayesian Networks from Uncertain Data · AAAI 2021
Data mining
process mining
0.312025
SNAP: Semantic Stories for Next Activity Prediction · AAAI 2025
Distributed systems
fault tolerance
0.312025
Taming Uncertainty via Automation: Observing, Analyzing, and Optimizing Agentic AI Systems · ASE 2025
Distributed systems
root cause analysis
0.312025
Taming Uncertainty via Automation: Observing, Analyzing, and Optimizing Agentic AI Systems · ASE 2025

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

large language model · 3.5narrative construction · 1.7automation pipeline · 1.7expectation-maximization · 0.5
YearPublicationVenuePosition
2025 SNAP: Semantic Stories for Next Activity Prediction
abstract
Predicting the next activity in an ongoing process is one of the most common tasks in the business process management (BPM) domain. It allows businesses to optimize resource allocation, enhance operational efficiency, and aid both in risk mitigation and strategic decision-making. Existing state-of-the-art AI models for BPM do not fully capitalize on available semantic information within process event logs. As current advanced AI-BPM systems provide semantically richer textual data, the need for new adequate models grows. To address this gap, we develop SNAP—a novel system that utilizes LLMs by constructing narratives and semantic contextual stories for historical event logs, which are then used to generate precise and actionable predictions for the ongoing process. SNAP was evaluated on six benchmark datasets, where it demonstrated significant performance improvements over eleven SOTA models, particularly on datasets with high levels of semantic content. This work showcases the potential of integrating LLMs in BPM and outlines a clear path toward future deployment, emphasizing the relevance and innovation of our approach within the broader AI application landscape.
Alon Oved, Segev Shlomov, Sergey Zeltyn, Nir Mashkif, Avi Yaeli
AAAI3
2025 Taming Uncertainty via Automation: Observing, Analyzing, and Optimizing Agentic AI Systems
abstract
Large Language Models (LLMs) are increasingly deployed within agentic systems—collections of interacting, LLM-powered agents that execute complex, adaptive workflows using memory, tools, and dynamic planning. While enabling powerful new capabilities, these systems also introduce unique forms of uncertainty stemming from probabilistic reasoning, evolving memory states, and fluid execution paths. Traditional software observability and operations practices fall short in addressing these challenges.This paper presents our vision of AgentOps: a comprehensive framework for observing, analyzing, optimizing, and automating operation of agentic AI systems. We identify distinct needs across four key roles—developers, testers, site reliability engineers (SREs), and business users—each of whom engages with the system at different points in its lifecycle. We present the AgentOps Automation Pipeline, a six-stage process encompassing behavior observation, metric collection, issue detection, root cause analysis, optimized recommendations, and runtime automation. Throughout, we emphasize the critical role of automation in managing uncertainty and enabling self-improving AI systems—not by eliminating uncertainty, but by taming it to ensure safe, adaptive, and effective operation.
Dany Moshkovich, Sergey Zeltyn
ASE2
2021 Learning the Parameters of Bayesian Networks from Uncertain Data
abstract
The creation of Bayesian networks often requires the specification of a large number of parameters, making it highly desirable to be able to learn these parameters from historical data. In many cases, such data has uncertainty associated with it, including cases in which this data comes from unstructured analysis or from sensors. When creating diagnosis networks, for example, unstructured analysis algorithms can be run on the historical text descriptions or images of previous cases so as to extract data for learning Bayesian network parameters, but such derived data has inherent uncertainty associated with it due to the nature of such algorithms. Because of the inability of current Bayesian network parameter learning algorithms to incorporate such uncertainty, common approaches either ignore this uncertainty, thus reducing the resulting accuracy, or completely disregard such data. We present an approach for learning Bayesian network parameters that explicitly incorporates such uncertainty, and which is a natural extension of the Bayesian network formalism. We present a generalization of the Expectation Maximization parameter learning algorithm that enables it to handle any historical data with likelihood-evidence-based uncertainty, as well as an empirical validation demonstrating the improved accuracy and convergence enabled by our approach. We also prove that our extended algorithm maintains the convergence and correctness properties of the original EM algorithm, while explicitly incorporating data uncertainty in the learning process.
Segev Wasserkrug, Radu Marinescu 0002, Sergey Zeltyn, Evgeny Shindin, Yishai A. Feldman
AAAI3
2011 Improving efficiency in software maintenance
abstract
Efficiency is critical to the profitability of software maintenance and support organizations. Managing such organizations effectively requires suitable measures of efficiency that are sensitive enough to detect significant changes, and accurate and timely in detecting them. Mean time to close problem reports is the most commonly used efficiency measure, but its suitability has not been evaluated carefully. We performed such an evaluation by mining and analyzing many years of support data on multiple IBM products. Our preliminary results suggest that the mean is less sensitive and accurate than another measure, percentiles, in cases that are particularly important in the maintenance and support domain. Using percentiles, we also identified statistical techniques to detect efficiency trends and evaluated their accuracy. Although preliminary, these results may have significant ramifications for effectively measuring and improving software maintenance and support processes.
Sergey Zeltyn, Peri L. Tarr, Murray Cantor, Robert Delmonico, Sateesh Kannegala, Mila Keren, Ashok Pon Kumar, Segev Wasserkrug
MSR1