It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Against the backdrop of the rapid development of information technology, the total amount of data has exploded, and efficient association rule mining methods for large-scale datasets have been studied. Conventional rule mining algorithms are subject to electrical constraints when working, and their convergence speed and data noise are currently the main problems they face. In order to accelerate the working process of the algorithm, this study introduces a data warehouse into the K-Means algorithm, and connects the time series and voltage interaction functions with the long-and-short-term memory network for efficient information analysis of power grid data, generating fusion algorithms. The study conducted experiments on the Netloss dataset and simultaneously conducted experiments on three models, including long-and-short-term memory networks, to verify the superiority of the fusion algorithm. Under the same experimental voltage, the circuit power flows of the four models were 0.37, 0.64, 0.79, and 0.82A, respectively, indicating that the algorithm effectively controlled the electrical dataset. Its measurement accuracy was the highest among the four models, at 91.7%. The experimental results show that the fusion algorithm proposed in the study has precise control ability in power grid datasets, and can effectively mine association rules on large-scale datasets.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer