Dimension Reduction Algorithm Based on Adaptive Maximum Linear Neighborhood Selection in Edge Computing

Abstract

With the rapid development of the Internet of Things (IoT), large quantities of data have been generated. Due to the limitation of the network bandwidth, the time and energy consumption of data transmission are increased. Data feature information can be extracted in real-time by the deployment of a data processing center. In this article, a novel dimension reduction approach is proposed in edge computing. First, a four-layer data processing framework is designed for data acquisition. A task assignment algorithm (TAA) is used for the condition when the edge node stops working due to an accident. Second, a threshold strategy is proposed to filter the data and reduce the dimension. Finally, the dimension reduction algorithm based on adaptive maximum linear neighborhood selection (AMLNS) is proposed. The harmonic geodesic distance is introduced to avoid the deformation of the manifold structure in AMLNS algorithm. Particularly, multiple weights are used to construct linear structure, which has a better embedding effect than single weight. The maximum linear neighborhood error weight is used to calculate the data coordinates. Experimental results show that the TAA improves the task completion rate about 15% and 36% over the random assignment method in mobile layer and edge layer, respectively. Compared with the local linear embedding (LLE), the points distribution of AMLNS is more uniform and regular, the execution time of AMLNS is reduced by about 17%. Furthermore, the embedding errors are less than those of LLE.