Research on Multidimensional Power Big Data Clustering Algorithm Based on Graph Mode

Power system data possess many characteristics and indicators, having certain high dimensions and redundant information, which can easily increase the calculation and storage overhead. To reduce the dimension of power data, eliminate redundant information, and reduce the delay time, a data clustering algorithm is proposed. Firstly, an algorithm based on PCA and kernel local Fisher identification is used to reduce the dimension of large multidimensional samples and enhance the accuracy of subsequent clustering. Thereafter, the redundant data are processed after dimension reduction is processed to optimize the data quality by introducing a bloom filter structure. In the graph model, data clustering is completed based on the parallel processing of redundant data. Simulation results show that the correctness and stability of this method are over 85%, and the delay time is decreased, representing good application prospects.

Authors

Institutions

Publication Details

Journal
Journal of Advanced Computational Intelligence and Intelligent Informatics
Published
2025-03-19
DOI
https://doi.org/10.20965/jaciii.2025.p0358
Primary Topic
Power Systems and Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Multidimensional Power Big Data Clustering Algorithm Based on Graph Mode

Xue Han, Yue Zhang, Sheng Gao
Journal of Advanced Computational Intelligence and Intelligent Informatics
Power Systems and Technologies
article

Research on Multidimensional Power Big Data Clustering Algorithm Based on Graph Mode

Xue Han, Yue Zhang, Sheng Gao
article en

Abstract

Power system data possess many characteristics and indicators, having certain high dimensions and redundant information, which can easily increase the calculation and storage overhead. To reduce the dimension of power data, eliminate redundant information, and reduce the delay time, a data clustering algorithm is proposed. Firstly, an algorithm based on PCA and kernel local Fisher identification is used to reduce the dimension of large multidimensional samples and enhance the accuracy of subsequent clustering. Thereafter, the redundant data are processed after dimension reduction is processed to optimize the data quality by introducing a bloom filter structure. In the graph model, data clustering is completed based on the parallel processing of redundant data. Simulation results show that the correctness and stability of this method are over 85%, and the delay time is decreased, representing good application prospects.

Journal of Advanced Computational Intelligence and Intelligent InformaticsVol. 29(2)
Inner Mongolia Electric Power (China) (CN), Shenyang Institute of Computing Technology (China) (CN)
Openalex Percentile: Top 96%
Power Systems and Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.