Data Mining Algorithm for Power User Network Based on Multi-Information Fusion
In order to solve the problem of accurately mining the power consumption characteristic data of power users, this paper proposes a research on power user network data mining algorithms based on multi-information fusion. In the past, the mining methods based on neural networks and cure algorithms wer...
Gespeichert in:
Veröffentlicht in: | International transactions on electrical energy systems 2022-09, Vol.2022, p.1-6 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In order to solve the problem of accurately mining the power consumption characteristic data of power users, this paper proposes a research on power user network data mining algorithms based on multi-information fusion. In the past, the mining methods based on neural networks and cure algorithms were affected by noise data, resulting in low mining accuracy. To solve this problem, this paper proposes a user-complex power consumption feature mining method based on the K-means clustering algorithm. In the K-means clustering algorithm, the principle of mining complex power consumption characteristics of users is studied, and the data are cleaned, integrated, and preprocessed by protocol transformation to avoid noise interference. The information entropy principle is used to cluster the matrix to regularize the feature points. According to the complex power consumption characteristics, the power consumption feature points are determined through the cluster, the distance between the clusters is calculated, the power consumption feature information gain is obtained, and the user complex power consumption feature mining is completed. The experimental results show that the mining accuracy of this method is up to 99%, providing users with better quality services. Conclusion. The automatic control performance of the system is good, and the acquisition results are accurate and reliable. |
---|---|
ISSN: | 2050-7038 2050-7038 |
DOI: | 10.1155/2022/2337460 |