Optimizing redundant-data clustering for interactive walkthrough applications

In the traditional network heterogeneous fault-tolerant data mining process, there are some problems such as low accuracy and slow speed. This paper proposes a fast mining method based on K-means clustering for network heterogeneous fault-tolerant data. The confidence space of heterogeneous fault-tolerant data is determined, and the range of motion of fault-tolerant data is obtained; Singular value decomposition (SVD) method is used to construct the classified data model to obtain the characteristics of heterogeneous fault-tolerant data; The redundant data in fault-tolerant data is deleted by unsupervised feature selection algorithm, and the square sum and Euclidean distance of fault-tolerant data clustering center are determined by K-means algorithm. The discrete data clustering space is constructed, and the objective optimal function of network heterogeneous fault-tolerant data clustering is obtained, Realize fault-tolerant data fast mining. The results show that the mining accuracy of the proposed method can reach 97%.

Download Full-text

Error-Aware Data Clustering for In-Network Data Reduction in Wireless Sensor Networks

Sensors ◽

10.3390/s20041011 ◽

2020 ◽

Vol 20 (4) ◽

pp. 1011 ◽

Cited By ~ 1

Author(s):

M. K. Alam ◽

Azrina Abd Aziz ◽

S. A. Latif ◽

Azlan Awang

Keyword(s):

Data Reduction ◽

Data Clustering ◽

Large Scale ◽

Temporal Correlation ◽

Correlated Data ◽

Sensor Nodes ◽

Wireless Sensor ◽

Network Data ◽

Spatial Correlations ◽

Redundant Data

A wireless sensor network (WSN) deploys hundreds or thousands of nodes that may introduce large-scale data over time. Dealing with such an amount of collected data is a real challenge for energy-constraint sensor nodes. Therefore, numerous research works have been carried out to design efficient data clustering techniques in WSNs to eliminate the amount of redundant data before transmitting them to the sink while preserving their fundamental properties. This paper develops a new error-aware data clustering (EDC) technique at the cluster-heads (CHs) for in-network data reduction. The proposed EDC consists of three adaptive modules that allow users to choose the module that suits their requirements and the quality of the data. The histogram-based data clustering (HDC) module groups temporal correlated data into clusters and eliminates correlated data from each cluster. Recursive outlier detection and smoothing (RODS) with HDC module provides error-aware data clustering, which detects random outliers using temporal correlation of data to maintain data reduction errors within a predefined threshold. Verification of RODS (V-RODS) with HDC module detects not only random outliers but also frequent outliers simultaneously based on both the temporal and spatial correlations of the data. The simulation results show that the proposed EDC is computationally cheap, able to reduce a significant amount of redundant data with minimum error, and provides efficient error-aware data clustering solutions for remote monitoring environmental applications.

Download Full-text