2020
DOI: 10.1109/access.2020.2992089
|View full text |Cite
|
Sign up to set email alerts
|

Reliability Assessment of Wind Power Converter Considering SCADA Multistate Parameters Prediction Using FP-Growth, WPT, K-Means and LSTM Network

Abstract: In order to cooperate the wind farm operators with grasping the operation status of wind power converter, a novel reliability assessment strategy is proposed based on supervisory control and data acquisition (SCADA) multistate parameters prediction of permanent magnet synchronous generator (PMSG) wind turbine. The strategy considers ''off-line training, on-line matching and assessment''. The operation reliability of wind power converter is obtained via the analysis and weight computing of confidence level, pre… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 24 publications
0
8
0
Order By: Relevance
“…In the process of mining frequent itemsets, scan data, customer service will be a frequent itemsets, and then according to the setting of threshold platform security coefficient, will not satisfy the operation of the platform delete data sets, then get the new data set, and according to the new standard data set of frequent items, support count of descending order. In the actual application process, in order to improve the defect of scanning customer service database times, the improved FP-growth algorithm is used to adjust the arrangement of customer service data [12,13,14]. At the same time, according to the algorithm only need to traverse the characteristics of the database, separate from the original database for secondary mining, do not need to mining platform database again.…”
Section: Improve Fp-growth Algorithm To Build Rule Configuration Modelmentioning
confidence: 99%
“…In the process of mining frequent itemsets, scan data, customer service will be a frequent itemsets, and then according to the setting of threshold platform security coefficient, will not satisfy the operation of the platform delete data sets, then get the new data set, and according to the new standard data set of frequent items, support count of descending order. In the actual application process, in order to improve the defect of scanning customer service database times, the improved FP-growth algorithm is used to adjust the arrangement of customer service data [12,13,14]. At the same time, according to the algorithm only need to traverse the characteristics of the database, separate from the original database for secondary mining, do not need to mining platform database again.…”
Section: Improve Fp-growth Algorithm To Build Rule Configuration Modelmentioning
confidence: 99%
“…Promotion (a → b) = confidence (a → b) / (support a) (9) For example, we have calculated the confidence level of milk and eggs (confidence) = 2 / 4. If the support of milk is 3 / 5, then we can calculate the support of milk and eggs: lift = 0.83.…”
Section: Chinese Word Segmentationmentioning
confidence: 99%
“…It can improve the performance of nearest neighbor classification, overcome the influence of outliers on the classification performance of small sample data set, and improve the classification accuracy of classification algorithm [8]. When the number of samples is large or tends to be infinite, the nearest neighbor classification has higher classification accuracy, but when the sample size is limited, the nearest neighbor classification may produce larger classification error [9]. The classification performance of KNN classifier is very sensitive to the neighborhood size k value.…”
Section: Introductionmentioning
confidence: 99%
“…The mining algorithms of frequent itemset can generally be divided into two types, namely accurate and heuristic algorithms. The most classical accurate algorithms include Apriori [6], FP-Growth [7], and many derived algorithms [8][9][10][11][12][13][14][15][16][17][18][19][20]. The theory of accurate algorithms seems to be perfect.…”
Section: Introductionmentioning
confidence: 99%