EDBT 2026 Demo / reviewers in the wild / expert
Takayuki Ishizaki
dblp:01/9184
· DBLP profile ↗
4ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4 · 1 first-author · 3 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Energy systems and smart grids · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 50% Logic in computer science · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Energy systems and smart grids
power system modeling |
0.3 | 1 | 2018 | Graph-Theoretic Analysis of Power Systems · Proc. IEEE 2018 |
Energy systems and smart grids
power system stability |
0.3 | 1 | 2018 | Graph-Theoretic Analysis of Power Systems · Proc. IEEE 2018 |
Logic in computer science › formal methods
distributed controller synthesis |
0.1 | 1 | 2018 | Graph-Theoretic Analysis of Power Systems · Proc. IEEE 2018 |
Graph algorithms and graph theory
graph sparsification |
0.1 | 1 | 2018 | Graph-Theoretic Analysis of Power Systems · Proc. IEEE 2018 |
Methods — techniques the papers use, named apart from their topics
small-signal analysis · 0.7nonlinear dynamics · 0.7graph theory · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Hierarchical Uncertainty Characterization of Monthly Net Load in Renewable Power SystemsabstractThe accurate characterization of net load uncertainty can ensure the economy and stability of renewable power systems operation. In existing studies, Gaussian mixture model (GMM) and Dirichlet process mixture model (DPMM) are powerful tools for characterizing the uncertainty of monthly net load. However, the correlation among the Gaussian components and the common distribution characteristics among the monthly net load are not considered in these studies, which may lead to lower characterization accuracy. To solve these issues, we propose a hierarchical uncertainty characterization method for monthly net load considering Gaussian component reduction and correlation. Firstly, the method obtains the Gaussian mixture components and the label information of the annual net load by the Expectation-Maximum (EM) algorithm. Then, the Gaussian components of the monthly net load are corrected by the label information, which helps extract the common distribution characteristics among the monthly net load. On this basis, the corrected Gaussian components are considered as the base distribution. A component-preserving Expectation-Maximum (CPEM) algorithm is developed for component reduction. This realizes the uncertainty characterization of the monthly net load with high accuracy and lower time consumption. Importantly, the temporal correlation of net load is converted into the correlation among the Gaussian components, which are explicitly characterized by the Spearman coefficient. Finally, the superiority of the proposed method is verified with actual data collected in Australia. Note to Practitioners—In this article, we address the issue of monthly net load uncertainty characterization in renewable power systems. A hierarchical uncertainty characterization method is proposed to enable the distribution characteristic extraction of monthly net load. Most existing works on uncertainty characterization use GMM and DPMM, where the internal information in the net load data (e.g., distribution and component correlation information) is poorly utilized. This poses a considerable challenge for accurately analyzing the net load uncertainty. To this end, the article proposes a hierarchical uncertainty characterization method for monthly net load considering Gaussian component reduction and correlation. In this method, the common and typical distribution characteristics of monthly net load are considered by the CPEM algorithm. Moreover, the temporal information of the net load is transformed as the correlation among the Gaussian components, which are integrated into the E-step in the proposed CPEM algorithm. Since more internal information is utilized, the proposed method is helpful in characterizing the net load uncertainty by means of high accuracy and lower time consumption. The results of the uncertainty characterization can be readily implemented in the planning operation and real-time dispatch of renewable power systems. Yuan Zheng Li, Guokai Hao, Takayuki Ishizaki, Zhigang Zeng |
IEEE Trans Autom. Sci. Eng. | 5 |
| 2024 | Can Gas Consumption Data Improve the Performance of Electricity Theft Detection?abstractMachine learning techniques have been extensively developed in the field of electricity theft detection. However, almost all typical models primarily rely on electricity consumption data to identify fraudulent users, often neglecting other pertinent household information such as gas consumption data. This article aims to explore the untapped potential of gas consumption data, a critical yet overlooked factor in electricity theft detection. In particular, we perform theoretical, qualitative, and quantitative correlation analyses between gas and electricity consumption data. Then, we propose two model-agnostic frameworks (i.e., multichannel network and twin network frameworks) to seamlessly integrate gas consumption data into machine learning models. Simulation results show a significant improvement in model performance when gas consumption data are incorporated using our proposed frameworks. Also, our proposed gas and electricity convolutional neural network, based on the proposed framework, demonstrates superior performance compared to classical and recent machine learning models on datasets with varying fraudulent ratios. Wenlong Liao, Ruijin Zhu, Takayuki Ishizaki, Yushuai Li, Yixiong Jia, Zhe Yang 0007 |
IEEE Trans. Ind. Informatics | 3 |
| 2022 | Three-Stage Robust Unit Commitment Considering Decreasing Uncertainty in Wind Power ForecastingabstractTo ensure powersupply–demand balance under the increasing penetration of wind power, the existing nonanticipative robust unit commitment models (NRUCs) co-optimize the commitment status and the dispatch policy of power sources. Exploiting the fact that the wind power uncertainty reduces over time, this article proposes an NRUC where determining the dispatch policy is delayed until the uncertainty decreases. The proposed NRUC features three decision-making problems sequentially solved under different degrees of uncertainty. The first decision-making problem is formulated as an intractable three-stage robust optimization problem. To solve this problem, a suboptimal approach is developed where a constraint is imposed on the dispatch policy so that the transmission capacity constraint is met regardless of the dispatch level. Results of simulations on a 24-bus and a 300-bus test system show that the proposed NRUC outperforms existing NRUCs regarding feasibility and optimality under currently severe but decreasing wind power uncertainty. Youngchae Cho, Takayuki Ishizaki, Jun-ichi Imura |
IEEE Trans. Ind. Informatics | 2 |
| 2018 | Graph-Theoretic Analysis of Power SystemsabstractIn this paper, we present an overview of the applications of graph theory in power system modeling, dynamics, coherency, and control. First, we study synchronization of generator dynamics using both nonlinear and small-signal representations of classical structure-preserving models of power systems in light of their network structure and the weights associated with the nodes and edges of the network graph. We overview important necessary and sufficient conditions for both phase and frequency synchronization. We highlight the role of graph structure in coherency properties, and introduce the idea of generator and bus aggregation whereby dynamic equivalent models of large power grids can be developed while retaining the concept of a “bus” in the network graph of the equivalent model. We also discuss several new results on graph sparsification for designing distributed controllers for power flow oscillation damping. Takayuki Ishizaki, Aranya Chakrabortty, Jun-ichi Imura |
Proc. IEEE | 1 |