Using KD-Tree and DBSCAN to clean hydropower units monitoring data

To improve the poor quality of hydropower units monitoring data, a data cleaning approach using K-Dimensional Tree (KD-Tree) and Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is proposed. Firstly, KD-Tree is constructed with the input data, and then DBSCAN is used to scan and complete the clustering of the nearest neighbour samples. After the clustering of the nearest neighbour samples, the noise points of hydropower units monitoring data are separated and removed. To validate the proposed approach, 1088 pieces of hydropower units monitoring data are selected, and 100 random data are inserted at the same time interval. The highest recognition accuracy of the proposed approach is 97.78%, and the lowest time consumption is 0.007 seconds. Compared with conventional data cleaning algorithms, the data cleaning effect of the proposed approach is improved, and the time consumption is significantly reduced.

Authors

Institutions

Publication Details

Published
2025-04-25
DOI
https://doi.org/10.1117/12.3062679
Primary Topic
Water Systems and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Using KD-Tree and DBSCAN to clean hydropower units monitoring data

Chao Hu, Yi Yang, Mengyue Xu, Xiang Li et al.
Water Systems and Optimization
article

Using KD-Tree and DBSCAN to clean hydropower units monitoring data

Chao Hu, Yi Yang, Mengyue Xu, Xiang Li, Han Zhou, Lei Kuang
article en

Abstract

To improve the poor quality of hydropower units monitoring data, a data cleaning approach using K-Dimensional Tree (KD-Tree) and Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is proposed. Firstly, KD-Tree is constructed with the input data, and then DBSCAN is used to scan and complete the clustering of the nearest neighbour samples. After the clustering of the nearest neighbour samples, the noise points of hydropower units monitoring data are separated and removed. To validate the proposed approach, 1088 pieces of hydropower units monitoring data are selected, and 100 random data are inserted at the same time interval. The highest recognition accuracy of the proposed approach is 97.78%, and the lowest time consumption is 0.007 seconds. Compared with conventional data cleaning algorithms, the data cleaning effect of the proposed approach is improved, and the time consumption is significantly reduced.

Hubei Provincial Water Resources and Hydropower Planning Survey and Design Institute (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 91%
Water Systems and Optimization
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.