Fast grouping fusion method of dual carbon monitoring data based on DBSCAN clustering algorithm

Due to the serious redundant interference of dual-carbon monitoring data resources, threshold setting in the fusion process is inaccurate. To realize the sharing and utilization of monitoring data resources, a fast group fusion method of dual-carbon monitoring data based on DBSCAN (Ensity - Based Spatial Clustering of Applications with Noise) clustering algorithm is proposed. After collecting dual-carbon monitoring data through the wireless sensor network, DBSCAN clustering algorithm calculates the neighborhood distance threshold of each data object. Sensor nodes compare the dual-carbon monitoring data and the abnormal data, determine the threshold value, assess whether abnormal data exists and is valid through integrated support, rejecting if invalid. Least squares method realizes fusion of normal data monitored by sensor nodes in the group. Cluster head node determines weight of the normal dual-carbon data monitored by each sensor according to different confidence levels. Variance estimation learning algorithm achieves weighted fusion of data from sensors within the group. The experimental results show that the clustering algorithm has a good clustering effect on the dual-carbon monitoring data and can realize the rapid group fusion. In the complex environment with frequent invalid abnormal data, the mean square error of the fusion results is small.

Authors

Publication Details

Journal
Results in Engineering
Published
2025-04-23
DOI
https://doi.org/10.1016/j.rineng.2025.105057
Citations
4
Primary Topic
Advanced Chemical Sensor Technologies
Type
article
Field-Weighted Citation Impact
2.70
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast grouping fusion method of dual carbon monitoring data based on DBSCAN clustering algorithm

Dongge Zhu, Rui Ma, Jiangbo Sha, Shuang Zhang et al.
4 citations
Results in Engineering
Advanced Chemical Sensor Technologies
2.70
article

Fast grouping fusion method of dual carbon monitoring data based on DBSCAN clustering algorithm

Dongge Zhu, Rui Ma, Jiangbo Sha, Shuang Zhang, Jia Liu, Wenni Kang
article en
4 citations

Abstract

Due to the serious redundant interference of dual-carbon monitoring data resources, threshold setting in the fusion process is inaccurate. To realize the sharing and utilization of monitoring data resources, a fast group fusion method of dual-carbon monitoring data based on DBSCAN (Ensity - Based Spatial Clustering of Applications with Noise) clustering algorithm is proposed. After collecting dual-carbon monitoring data through the wireless sensor network, DBSCAN clustering algorithm calculates the neighborhood distance threshold of each data object. Sensor nodes compare the dual-carbon monitoring data and the abnormal data, determine the threshold value, assess whether abnormal data exists and is valid through integrated support, rejecting if invalid. Least squares method realizes fusion of normal data monitored by sensor nodes in the group. Cluster head node determines weight of the normal dual-carbon data monitored by each sensor according to different confidence levels. Variance estimation learning algorithm achieves weighted fusion of data from sensors within the group. The experimental results show that the clustering algorithm has a good clustering effect on the dual-carbon monitoring data and can realize the rapid group fusion. In the complex environment with frequent invalid abnormal data, the mean square error of the fusion results is small.

Results in EngineeringVol. 26
Openalex Percentile: Top 11%
Advanced Chemical Sensor Technologies
2.70
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.