scholarly journals Fault Prognostics for Photovoltaic Inverter Based on Fast Clustering Algorithm and Gaussian Mixture Model

Energies ◽  
2020 ◽  
Vol 13 (18) ◽  
pp. 4901
Author(s):  
Zhenyu He ◽  
Xiaochen Zhang ◽  
Chao Liu ◽  
Te Han
Keyword(s):  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Clustering Algorithm ◽  
Feature Space ◽  
Gaussian Mixture ◽  
Pv System ◽  
Pv Inverter ◽  
Data Clusters ◽  
The Status ◽  
Fault Prognostics

The fault prognostics of the photovoltaic (PV) power generation system is expected to be a significant challenge as more and more PV systems with increasingly large capacities continue to come into existence. The PV inverter is the core component of the PV system, and it is essential to develop approaches that accurately predict the occurrence of inverter faults to ensure the PV system’s safety. This paper proposes a fault prognostics method which makes full use of the similarities between inverter clusters. First, a feature space was constructed using the t-distributed stochastic neighbor embedding (t-SNE) algorithm. Then, the fast clustering algorithm was used to search the center inverter of each sampling time from the feature space. The status of the center inverter was adopted to establish the health baseline. Finally, the Gaussian mixture model was established with two data clusters based on the central inverter and the inverter to be predicted. The divergence of the two clusters could be used to predict the inverter’s fault. The performance of the proposed method was evaluated with real PV monitoring data. The experimental results showed that the proposed method successfully predicted the occurrence of an inverter fault 3 months in advance.

scholarly journals Detecting Clusters in Atom Probe Data with Gaussian Mixture Models

2017 ◽  
Vol 23 (2) ◽  
pp. 269-278 ◽  
Author(s):  
Jennifer Zelenty ◽  
Andrew Dahl ◽  
Jonathan Hyde ◽  
George D. W. Smith ◽  
Michael P. Moody
Keyword(s):  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Expectation Maximization ◽  
Clustering Algorithm ◽  
Simulated Data ◽  
Atom Probe ◽  
Gaussian Mixture ◽  
Separation Method ◽  
Detection Accuracy ◽  
Maximum Separation

AbstractAccurately identifying and extracting clusters from atom probe tomography (APT) reconstructions is extremely challenging, yet critical to many applications. Currently, the most prevalent approach to detect clusters is the maximum separation method, a heuristic that relies heavily upon parameters manually chosen by the user. In this work, a new clustering algorithm, Gaussian mixture model Expectation Maximization Algorithm (GEMA), was developed. GEMA utilizes a Gaussian mixture model to probabilistically distinguish clusters from random fluctuations in the matrix. This machine learning approach maximizes the data likelihood via expectation maximization: given atomic positions, the algorithm learns the position, size, and width of each cluster. A key advantage of GEMA is that atoms are probabilistically assigned to clusters, thus reflecting scientifically meaningful uncertainty regarding atoms located near precipitate/matrix interfaces. GEMA outperforms the maximum separation method in cluster detection accuracy when applied to several realistically simulated data sets. Lastly, GEMA was successfully applied to real APT data.

scholarly journals Hybrid DE-EM Algorithm for Gaussian Mixture Model-Based Wireless Channel Multipath Clustering

2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Yupeng Li ◽  
Jianhua Zhang ◽  
Ruisi He ◽  
Lei Tian ◽  
Hewen Wei
Keyword(s):  
Em Algorithm ◽  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Clustering Algorithm ◽  
Gaussian Mixture ◽  
Wireless Channel ◽  
Model Parameters ◽  
Em Algorithms ◽  
The Em Algorithm ◽  
Searching Ability

In this paper, the Gaussian mixture model (GMM) is introduced to the channel multipath clustering. In the GMM field, the expectation-maximization (EM) algorithm is usually utilized to estimate the model parameters. However, the EM widely converges into local optimization. To address this issue, a hybrid differential evolution (DE) and EM (DE-EM) algorithms are proposed in this paper. To be specific, the DE is employed to initialize the GMM parameters. Then, the parameters are estimated with the EM algorithm. Thanks to the global searching ability of DE, the proposed hybrid DE-EM algorithm is more likely to obtain the global optimization. Simulations demonstrate that our proposed DE-EM clustering algorithm can significantly improve the clustering performance.

Wireless Sensor Network Coverage Hole Localization by Ant Colony Optimized Gaussian Mixture Model Clustering

2020 ◽  
Vol 17 (6) ◽  
pp. 2488-2495
Author(s):  
Shalu ◽  
Amita Malik
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Clustering Algorithm ◽  
Gaussian Mixture ◽  
Wireless Sensor ◽  
Network Graph ◽  
Graph Metrics ◽  
Coverage Hole

Nodes in the wireless sensor network have a minimal power source and they exhaust very quickly in communicating with each other. If any of the nodes die, a coverage hole creates in that region. This coverage hole leads to fast energy depletion of other nodes along with the security issues due to intruder node’s placement at that location. The solution to detection of coverage hole is discussed in our paper and it is experimentally validated. We propose an unsupervised machine learning clustering algorithm to cluster the network graph metrics. An undirected network graph of nodes is created and five graph metrics are extracted. The vector of features is clustered by Ant colony optimized expectation.maximization Gaussian mixture model (ACO-EM GMM) clustering algorithm. Our algorithm is compared with the state of art works based on false detection parameter.

scholarly journals Resident user load classification method based on improved Gaussian mixture model clustering

2022 ◽  
Vol 355 ◽  
pp. 02024
Author(s):  
Haojing Wang ◽  
Yingjie Tian ◽  
An Li ◽  
Jihai Wu ◽  
Gaiping Sun
Keyword(s):  
Principal Component Analysis ◽  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Clustering Algorithm ◽  
Computational Cost ◽  
Principal Component ◽  
Component Analysis ◽  
Gaussian Mixture ◽  
Classification Method ◽  
Mixture Model Clustering

In view of the limitation of “hard assignment” of clusters in traditional clustering methods and the difficulty of meeting the requirements of clustering efficiency and clustering accuracy simultaneously in regard to massive data sets, a load classification method based on a Gaussian mixture model combining clustering and principal component analysis is proposed. The load data are fed into a Gaussian mixture model clustering algorithm after principal component analysis and dimensionality reduction to achieve classification of large-scale load datasets. The method in this paper is used to classify loads in the Canadian AMPds2 public dataset and is compared with K-Means, Gaussian mixed model clustering and other methods. The results show that the proposed method can not only achieve load classification more effectively and finely, but also save computational cost and improve computational efficiency.

Sign in / Sign up

Export Citation Format

Share Document