Demo Data from EDBT 2026 / reviewers in the wild / expert
Ryota Sugiyama
dblp:259/3255
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1 · 1 first-author · 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.
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 33% Learning theory · 33% Time series and sequential data · 33% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Time series and sequential data
change-point detection |
0.4 | 1 | 2020 | Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming · NeurIPS 2020 |
Machine learning › Learning theory › hypothesis testing
selective inference |
0.4 | 1 | 2020 | Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming · NeurIPS 2020 |
Machine learning › Probabilistic and Bayesian machine learning
statistical inference |
0.4 | 1 | 2020 | Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming · NeurIPS 2020 |
Algorithms and data structures
dynamic programming |
0.4 | 1 | 2020 | Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
selective inference · 0.9hypothesis testing · 0.9dynamic programming · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Continuous Data-driven Personas Generation: An LLM-based Knowledge Graph ApproachabstractBusiness-to-business software systems are inherently specialized and operationally intricate, which make them crucial to develop accurate personas that reflect real end-user requirements throughout the development lifecycle. As user needs continuously evolve over time, it becomes imperative to establish a data-driven framework capable of persistently updating these personas and promptly integrating those changes into the development process to maintain long-term value delivery. Conventional persona generation techniques typically depend on clustering approaches applied to qualitative and quantitative data—a process that is time-intensive, expensive, and requires considerable domain expertise. This study introduces an automated method for continuous persona generation, extracting user requirements from an ongoing stream of user data. The approach utilizes large language models to interpret qualitative inputs and dynamically generate knowledge graphs, enabling real-time insights into shifting user needs. A case study involving inquiry call logs from a customer support center was conducted to validate the method. Results demonstrated that the proposed approach outperformed a traditional clustering-based baseline in approximately 86% of the cases in a question–answering task aimed at evaluating the structuring and retrieval of user requirements. Furthermore, clear insights into user pain points and requiring improvements were provided, reinforcing the effectiveness and practical utility of continuous, data-driven persona generation. Ryota Sugiyama, Hironori Washizaki, Naoyasu Ubayashi, Ryoko Tanahashi, Mai Hirabayashi, Satoshi Okuda, Ken Toriumi |
RE | 1 |
| 2020 | Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic ProgrammingabstractAlthough there is a vast body of literature related to methods for detecting change-points (CPs), less attention has been paid to assessing the statistical reliability of the detected CPs. In this paper, we introduce a novel method to perform statistical inference on the significance of the CPs, estimated by a Dynamic Programming (DP)-based optimal CP detection algorithm. Our main idea is to employ a Selective Inference (SI) approach---a new statistical inference framework that has recently received a lot of attention---to compute exact (non-asymptotic) valid p-values for the detected optimal CPs. Although it is well-known that SI has low statistical power because of over-conditioning, we address this drawback by introducing a novel method called parametric DP, which enables SI to be conducted with the minimum amount of conditioning, leading to high statistical power. We conduct experiments on both synthetic and real-world datasets, through which we offer evidence that our proposed method is more powerful than existing methods, has decent performance in terms of computational efficiency, and provides good results in many practical applications. Vo Nguyen Le Duy, Hiroki Toda, Ryota Sugiyama, Ichiro Takeuchi |
NeurIPS | 3 |