Haiyan Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haiyan Jiang has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
Jianzhou Wang
2 shared publicationsQingping Zhou
2 shared publications- Qingping Zhou
School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, China
2 shared publications Shanshan Qin
School of Statistics Tianjin University of Finance and Economics Tianjin China
2 shared publications- Bohui Han
School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, China
1 shared publication - Bowen Tang
Hubei Engineering Research Center for Safety Monitoring of New Energy and Power Grid Equipment, Hubei University of Technology 1 , 430068 Wuhan
1 shared publication
Latest Publications
- 20 June 2024
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 38 (5) , 2084-2107
Tracking Nonstationary Streaming Data via Exponentially Weighted Moving Average Stochastic Gradient Descent
- 20 June 2024
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 38 (5) , 2084-2107
Tracking Nonstationary Streaming Data via Exponentially Weighted Moving Average Stochastic Gradient Descent
Feature grouping and sparse principal component analysis with truncated regularization
We propose a new method for principal component analysis (PCA) called feature grouping and sparse principal component analysis (FGSPCA). This method is designed to capture both grouping and sparsity structures in factor loadings simultaneously. To achieve this, we use a non‐convex truncated regularization that can adjust for sparsity and grouping effects automatically. This regularization encourages factor loadings with similar values to be either grouped together for feature grouping or be zero for feature selection, helping to reduce model complexity and improve interpretation. While other structured PCA methods often require prior knowledge to construct the regularization term, FGSPCA can capture grouping and sparsity structures without any prior information. We solve the resulting non‐convex optimization problem using an alternating algorithm that combines difference‐of‐convex programming, the augmented Lagrange method, and coordinate descent method. Our experiments show that FGSPCA performs well and efficiently on both synthetic and real‐world datasets. An implementation of FGSPCA is available on GitHub https://github.com/HaiyanJiang/FGSPCA.
Feature grouping and sparse principal component analysis with truncated regularization
We propose a new method for principal component analysis (PCA) called feature grouping and sparse principal component analysis (FGSPCA). This method is designed to capture both grouping and sparsity structures in factor loadings simultaneously. To achieve this, we use a non‐convex truncated regularization that can adjust for sparsity and grouping effects automatically. This regularization encourages factor loadings with similar values to be either grouped together for feature grouping or be zero for feature selection, helping to reduce model complexity and improve interpretation. While other structured PCA methods often require prior knowledge to construct the regularization term, FGSPCA can capture grouping and sparsity structures without any prior information. We solve the resulting non‐convex optimization problem using an alternating algorithm that combines difference‐of‐convex programming, the augmented Lagrange method, and coordinate descent method. Our experiments show that FGSPCA performs well and efficiently on both synthetic and real‐world datasets. An implementation of FGSPCA is available on GitHub https://github.com/HaiyanJiang/FGSPCA.
- 14 November 2022
- Published by Elsevier in Artificial Intelligence
- Vol. 314, 103823
-LIME: Statistical learning for local interpretations of deep neural networks using global priors- 14 November 2022
- Published by Elsevier in Artificial Intelligence
- Vol. 314, 103823
-LIME: Statistical learning for local interpretations of deep neural networks using global priors- Open Access
Feature Grouping and Sparse Principal Component Analysis with Truncated Regularization
In this paper, we consider a new variant for principal component analysis (PCA), aiming to capture the grouping and/or sparse structures of factor loadings simultaneously. To achieve these goals, we employ a non-convex truncated regularization with naturally adjustable sparsity and grouping effects, and propose the Feature Grouping and Sparse Principal Component Analysis (FGSPCA). The proposed FGSPCA method encourages the factor loadings with similar values to collapse into disjoint homogeneous groups for feature grouping or into a special zero-valued group for feature selection, which in turn helps reducing model complexity and increasing model interpretation. Usually, existing structured PCA methods require prior knowledge to construct the regularization term. However, the proposed FGSPCA can simultaneously capture the grouping and/or sparse structures of factor loadings without any prior information. To solve the resulting non-convex optimization problem, we propose an alternating algorithm that incorporates the difference-of-convex programming, augmented Lagrange method and coordinate descent method. Experimental results demonstrate the promising performance and efficiency of the new method on both synthetic and real-world datasets. An R implementation of FGSPCA can be found on github {https://github.com/higeeks/FGSPCA}.
Open AccessFeature Grouping and Sparse Principal Component Analysis with Truncated Regularization
In this paper, we consider a new variant for principal component analysis (PCA), aiming to capture the grouping and/or sparse structures of factor loadings simultaneously. To achieve these goals, we employ a non-convex truncated regularization with naturally adjustable sparsity and grouping effects, and propose the Feature Grouping and Sparse Principal Component Analysis (FGSPCA). The proposed FGSPCA method encourages the factor loadings with similar values to collapse into disjoint homogeneous groups for feature grouping or into a special zero-valued group for feature selection, which in turn helps reducing model complexity and increasing model interpretation. Usually, existing structured PCA methods require prior knowledge to construct the regularization term. However, the proposed FGSPCA can simultaneously capture the grouping and/or sparse structures of factor loadings without any prior information. To solve the resulting non-convex optimization problem, we propose an alternating algorithm that incorporates the difference-of-convex programming, augmented Lagrange method and coordinate descent method. Experimental results demonstrate the promising performance and efficiency of the new method on both synthetic and real-world datasets. An R implementation of FGSPCA can be found on github {https://github.com/higeeks/FGSPCA}.
- 1 January 2021
- Published by Springer Nature
- p. 695-704
Renewable Energy Integration in Suzhou City Based on EnergyPLAN Model
- 1 January 2021
- Published by Springer Nature
- p. 695-704
Renewable Energy Integration in Suzhou City Based on EnergyPLAN Model
Determining the number of change‐point via high‐dimensional cross‐validation
In multiple change‐point analysis, one of the major challenges is the determination of the number of change points, which is usually cast as a model selection problem. However, for model selection methods based on the Schwarz information criterion (SIC), it is typical that different penalization terms are required for different change‐point problems and the optimal penalization magnitude usually varies with the model and error distributions. In order to estimate the number of change points in high dimension, we develop a high‐dimensional data‐driven cross‐validation selection criterion. First, we define a goodness‐of‐fit measure by incorporating the dimensionality into the quadratic prediction error function. Second, the high‐dimensional cross‐validation (hCV) procedure is applied based on an order‐preserved sample‐splitting strategy. Simulation studies show that the proposed hCV criterion has more robust performance compared with a high‐dimensional SIC criterion tailored for the high‐dimensional change‐point problem. The selection property is also established under some mild conditions.
Determining the number of change‐point via high‐dimensional cross‐validation
In multiple change‐point analysis, one of the major challenges is the determination of the number of change points, which is usually cast as a model selection problem. However, for model selection methods based on the Schwarz information criterion (SIC), it is typical that different penalization terms are required for different change‐point problems and the optimal penalization magnitude usually varies with the model and error distributions. In order to estimate the number of change points in high dimension, we develop a high‐dimensional data‐driven cross‐validation selection criterion. First, we define a goodness‐of‐fit measure by incorporating the dimensionality into the quadratic prediction error function. Second, the high‐dimensional cross‐validation (hCV) procedure is applied based on an order‐preserved sample‐splitting strategy. Simulation studies show that the proposed hCV criterion has more robust performance compared with a high‐dimensional SIC criterion tailored for the high‐dimensional change‐point problem. The selection property is also established under some mild conditions.
- Open Access
- 23 February 2018
- Published by Institution of Engineering and Technology (IET) in IET Generation, Transmission & Distribution
- Vol. 12 (7) , 1606-1620
Dynamic reserve demand estimation model and cost‐effectivity oriented reserve allocation strategy for multi‐area system integrated with wind power
Optimisation of reserve purchased in advance becomes increasingly essential to hedge against the growing level of power unbalance brought by the integration of large‐scale wind power. Moreover, due to the centralised integration mode of wind farms, cross‐region reserve sharing strategy becomes quite imperative. Therefore, this study presents a dynamic reserve demand estimation (DRDE) model, which synthetically considers N − 1 contingency along with load and wind forecast error. In the proposed approach, historical data is rearranged by a two‐dimensional binning technique and fitted by the versatile probability distribution model, which assisting the model reacts to different prediction level in each dispatch period dynamically. Furthermore, a cost‐effectivity oriented reserve allocation strategy for the multi‐area system is developed based on the DRDE model. The efficiency of the proposed method is tested in both 6‐bus test system and IEEE 118‐bus test system. The results show that, whether in the scenario of self‐sufficient reserve supplying or cross‐region reserve sharing strategy, the proposed estimation model effectively reduces the expectation of both load shedding and wind curtailment. Moreover, the proposed strategy improves the economy of system operation on the premise of ensuring system reliability.
- 23 February 2018
- Published by Institution of Engineering and Technology (IET) in IET Generation, Transmission & Distribution
- Vol. 12 (7) , 1606-1620
Open AccessDynamic reserve demand estimation model and cost‐effectivity oriented reserve allocation strategy for multi‐area system integrated with wind power
Optimisation of reserve purchased in advance becomes increasingly essential to hedge against the growing level of power unbalance brought by the integration of large‐scale wind power. Moreover, due to the centralised integration mode of wind farms, cross‐region reserve sharing strategy becomes quite imperative. Therefore, this study presents a dynamic reserve demand estimation (DRDE) model, which synthetically considers N − 1 contingency along with load and wind forecast error. In the proposed approach, historical data is rearranged by a two‐dimensional binning technique and fitted by the versatile probability distribution model, which assisting the model reacts to different prediction level in each dispatch period dynamically. Furthermore, a cost‐effectivity oriented reserve allocation strategy for the multi‐area system is developed based on the DRDE model. The efficiency of the proposed method is tested in both 6‐bus test system and IEEE 118‐bus test system. The results show that, whether in the scenario of self‐sufficient reserve supplying or cross‐region reserve sharing strategy, the proposed estimation model effectively reduces the expectation of both load shedding and wind curtailment. Moreover, the proposed strategy improves the economy of system operation on the premise of ensuring system reliability.
- 1 January 2016
- Published by Elsevier in Renewable and Sustainable Energy Reviews
- Vol. 53, 1149-1167
China’s natural gas production and consumption analysis based on the multicycle Hubbert model and rolling Grey model
- 1 January 2016
- Published by Elsevier in Renewable and Sustainable Energy Reviews
- Vol. 53, 1149-1167
China’s natural gas production and consumption analysis based on the multicycle Hubbert model and rolling Grey model
- Open Access
- 1 January 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-13
An Experimental Investigation of FNN Model for Wind Speed Forecasting Using EEMD and CS
With depletion of traditional energy and increasing environmental problems, wind energy, as an alternative renewable energy, has drawn more and more attention internationally. Meanwhile, wind is plentiful, clean, and environmentally friendly; moreover, its speed is a very important piece of information needed in the operations and planning of the wind power system. Therefore, choosing an effective forecasting model with good performance plays a quite significant role in wind power system. A hybrid CS-EEMD-FNN model is firstly proposed in this paper for multistep ahead prediction of wind speed, in which EEMD is employed as a data-cleaning method that aims to remove the high frequency noise embedded in the wind speed series. CS optimization algorithm is used to select the best parameters in the FNN model. In order to evaluate the effectiveness and performance of the proposed hybrid model, three other short-term wind speed forecasting models, namely, FNN model, EEMD-FNN model, and CS-FNN model, are carried out to forecast wind speed using data measured at a typical site in Shandong wind farm, China, over three seasons in 2011. Experimental results demonstrate that the developed hybrid CS-EEMD-FNN model outperforms other models with more accuracy, which is suitable to wind speed forecasting in this area.
- 1 January 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-13
Open AccessAn Experimental Investigation of FNN Model for Wind Speed Forecasting Using EEMD and CS
With depletion of traditional energy and increasing environmental problems, wind energy, as an alternative renewable energy, has drawn more and more attention internationally. Meanwhile, wind is plentiful, clean, and environmentally friendly; moreover, its speed is a very important piece of information needed in the operations and planning of the wind power system. Therefore, choosing an effective forecasting model with good performance plays a quite significant role in wind power system. A hybrid CS-EEMD-FNN model is firstly proposed in this paper for multistep ahead prediction of wind speed, in which EEMD is employed as a data-cleaning method that aims to remove the high frequency noise embedded in the wind speed series. CS optimization algorithm is used to select the best parameters in the FNN model. In order to evaluate the effectiveness and performance of the proposed hybrid model, three other short-term wind speed forecasting models, namely, FNN model, EEMD-FNN model, and CS-FNN model, are carried out to forecast wind speed using data measured at a typical site in Shandong wind farm, China, over three seasons in 2011. Experimental results demonstrate that the developed hybrid CS-EEMD-FNN model outperforms other models with more accuracy, which is suitable to wind speed forecasting in this area.
- 1 October 2014
- Published by Elsevier in Science of The Total Environment
- Vol. 496, 264-274
A hybrid model for PM 2.5 forecasting based on ensemble empirical mode decomposition and a general regression neural network
- 1 October 2014
- Published by Elsevier in Science of The Total Environment
- Vol. 496, 264-274
A hybrid model for PM 2.5 forecasting based on ensemble empirical mode decomposition and a general regression neural network