22 January 2024 in IEEE Transactions on Power Systems
Increasing renewable energy resources introduces uncertainties into utility grids, calling for more frequent use of alternative current optimal power flow (AC-OPF) than before. Conventional AC-OPF solvers are too slow for real-time applications; to speed up the computation, deep neural network (DNN) based solvers are introduced. However, their results typically cannot enforce the security constraints of the utility grid. To overcome this difficulty, FRMNet is proposed in this paper, which combines DNN with feasibility restoration mapping (FRM). The DNN receives the load as input and outputs a partial solution. The following FRM maps the infeasible solution to the feasibility region to satisfy the AC-OPF constraints. The proposed FRMNet has four advantages compared to conventional and DNN-based solvers. First, the feasibility of overall solutions is guaranteed via FRM. Second, FRMNet is a self-supervised training method so that it avoids the laborious preparation of the optimal solutions for a training dataset using conventional solvers. Third, FRM is differentiable so that AC-OPF information encoded in gradients is transferred to DNN, which leads to a DNN with high feasibility rate. Fourth, the overall computation time of FRMNet is fast due to its DNN's high feasibility rate. Comprehensive experiments are conducted on IEEE standard cases. Results show that FRMNet's outcomes satisfy all constraints at a significantly faster average speed than conventional solvers. When FRM participates in training, the performance of DNN is stably improved and achieves better results than other DNN-based models. Even DNN alone achieves a high feasibility rate, a negligible degree of constraint violations and a small optimality gap, compared to the state-of-the-art DNN based solvers.
30 September 2020 in IEEE Transactions on Neural Networks and Learning Systems
Nonparametric dimensionality reduction techniques, such as t-distributed Stochastic Neighbor Embedding (t-SNE) and uniform manifold approximation and projection (UMAP), are proficient in providing visualizations for data sets of fixed sizes. However, they cannot incrementally map and insert new data points into an already provided data visualization. We present self-organizing nebulous growths (SONG), a parametric nonlinear dimensionality reduction technique that supports incremental data visualization, i.e., incremental addition of new data while preserving the structure of the existing visualization. In addition, SONG is capable of handling new data increments, no matter whether they are similar or heterogeneous to the already observed data distribution. We test SONG on a variety of real and simulated data sets. The results show that SONG is superior to Parametric t-SNE, t-SNE, and UMAP in incremental data visualization. Especially, for heterogeneous increments, SONG improves over Parametric t-SNE by 14.98% on the Fashion MNIST data set and 49.73% on the MNIST data set regarding the cluster quality measured by the adjusted mutual information scores. On similar or homogeneous increments, the improvements are 8.36% and 42.26%, respectively. Furthermore, even when the abovementioned data sets are presented all at once, SONG performs better or comparable to UMAP and superior to t-SNE. We also demonstrate that the algorithmic foundations of SONG render it more tolerant to noise compared with UMAP and t-SNE, thus providing greater utility for data with high variance, high mixing of clusters, or noise.
30 March 2017 in IEEE Journal of Biomedical and Health Informatics
Quantitative gait analysis is an important tool in objective assessment and management of total knee arthroplasty (TKA) patients. Studies evaluating gait patterns in TKA patients have tended to focus on discrete data such as spatiotemporal information, joint range of motion and peak values of kinematics and kinetics, or consider selected principal components of gait waveforms for analysis. These strategies may not have the capacity to capture small variations in gait patterns associated with each joint across an entire gait cycle, and may ultimately limit the accuracy of gait classification. The aim of this study was to develop an automatic feature extraction method to analyse patterns from high-dimensional autocorrelated gait waveforms. A general linear feature extraction framework was proposed and a hierarchical partial least squares method derived for discriminant analysis of multiple gait waveforms. The effectiveness of this strategy was verified using a dataset of joint angle and ground reaction force waveforms from 43 patients after TKA surgery and 31 healthy control subjects. Compared with principal component analysis and partial least squares methods, the hierarchical partial least squares method achieved generally better classification performance on all possible combinations of waveforms, with the highest classification accuracy 85.14%. The novel hierarchical partial least squares method proposed is capable of capturing virtually all significant differences between TKA patients and the controls, and provides new insights into data visualization. The proposed framework presents a foundation for more rigorous classification of gait, and may ultimately be used to evaluate the effects of interventions such as surgery and rehabilitation.
1 July 2025 in Pattern Recognition