A Novel Algorithm for Distributed Data Stream Using Big Data Classification Model

A Novel Algorithm for Distributed Data Stream Using Big Data Classification Model

Yongxiao Qiu, Guanghui Du, Song Chai
DOI: 10.4018/IJITWE.2020100101
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In order to solve the problem of real-time detection of power grid equipment anomalies, this paper proposes a data flow classification model based on distributed processing. In order to realize distributed processing of power grid data flow, a local node mining method and a global mining mode based on uneven data flow classification are designed. A data stream classification model based on distributed processing is constructed, then the corresponding data sequence is selected and formatted abstractly, and the local node mining method and global mining mode under this model are designed. In the local node miner, the block-to-block mining strategy is implemented by acquiring the current data blocks. At the same time, the expression and real-time maintenance of local mining patterns are completed by combining the clustering algorithm, thus improving the transmission rate of information between each node and ensuring the timeliness of the overall classification algorithm.
Article Preview
Top

1. Introduction

With the vigorous promotion of smart power grid and the application and popularization of data acquisition and transmission technology and intelligent data processing technology in power system, various data acquisition systems in the power grid produce a large amount of data all the time (Peng Wu & Jing Tan, 2019). Such data gradually show the characteristics of big data flow, such as fast data flow speed and large data volume (B. Rakhmetulayeva et al., 2018). And it hides a lot of data information about abnormal state of power grid equipment. Therefore, it is possible to make efficient use of such data flow to timely discover the hidden risks in power grid equipment. However, how to build a low-latency and high-precision data flow processing model for power grid equipment is a key problem faced by smart power grid at present (Honarvar, Ali Reza, et al., 2016).

From the perspective of distributed processing of big data flow, this paper, based on the data flow cleaning method for power grid equipment, solves the problem of local node mining in distributed processing of online monitoring data flow for power grid equipment. First need to select to clear representation of equipment state and easy access to the data sequence, and then with the help of the existing concept of distributed data stream to complete power equipment on-line monitoring data formatting of the abstract, distributed processing technology, based on large data flow is presented based on the large distributed data stream classification model of the basic definitions, and puts forward the efficient expression of the local node mining mode structure, and the block of data to the data block in the local node local incremental mining strategy (Zhixiang Wang.etal.,2018). In order to realize the local node to its local mining mode of real-time maintenance, and the grid equipment all sequences of the data in the data stream clustering, coarse to reduce the impact on power grid equipment data stream classification concept drift, and ensure that the local node and the center of information interaction between efficiency, in order to improve the integrated classifier in the center node of data stream classification accuracy and efficiency, thus to achieve the requirements of real-time risk identification for grid equipment (Bouhafs, Faycal, et al., 2014).

Complete Article List

Search this Journal:
Reset
Volume 19: 1 Issue (2024)
Volume 18: 1 Issue (2023)
Volume 17: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 16: 4 Issues (2021)
Volume 15: 4 Issues (2020)
Volume 14: 4 Issues (2019)
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing