Abstract

Data modeling and dimensionality reduction are important research points in the field of big data. At present, there is no effective model to realize the consistent representation and fusion of different types of data of students in unstructured campus big data. In addition, in the process of big data processing, the amount of data is too large and the intermediate results are too complex, which seriously affects the efficiency of big data dimension reduction. To solve the above problems, this paper proposes an incremental high order singular value decomposition dimensionality (icHOSVD) reduction algorithm for unstructured campus big data. In this algorithm, the characteristics of audio, video, image and text data in unstructured campus student data are tensioned to form a sub-tensor model, and the semi-tensor product is used to fuse the sub-tensor model into a unified model as the individual student tensor model. On the basis of individual model fusion, the campus big data fusion model was segmented, and each segmented small tensor model was dimensioned by icHOSVD reduction to obtain an approximate tensor as the symmetric tensor that could replace the original tensor, so as to solve the problem of large volume of tensor fusion model and repeated calculation of intermediate results in data processing. The experimental results show that the proposed algorithm can effectively reduce the computational complexity and improve the performance compared with traditional data dimension reduction algorithms. The research results can be applied to campus big data analysis and decision-making.

Highlights

  • With the continuous penetration of information technology, the type and size of campus data is growing at an unprecedented rate

  • This algorithm mainly consists of two parts: one part is a tensor partitioning after data fusion; another part is the incremental high order singular value decomposition dimensionality (icHOSVD) algorithm that is used to form the high quality core tensor of the original tensor

  • The main idea of the icHOSVD dimensionality reduction algorithm is to obtain the core tensor by decomposing the original tensor first, and to combine the core tensor with the left unitary matrix updated by the recursive High Order Singular Value Decomposition (HOSVD), and to form an approximate tensor that can be substituted for the original tensor

Read more

Summary

A Dimensionality Reduction Algorithm for Unstructured

Reduction algorithm for unstructured campus big data In this algorithm, the characteristics of audio, video, image and text data in unstructured campus student data are tensioned to form a sub-tensor model, and the semi-tensor product is used to fuse the sub-tensor model into a unified model as the individual student tensor model. On the basis of individual model fusion, the campus big data fusion model was segmented, and each segmented small tensor model was dimensioned by icHOSVD reduction to obtain an approximate tensor as the symmetric tensor that could replace the original tensor, so as to solve the problem of large volume of tensor fusion model and repeated calculation of intermediate results in data processing. The experimental results show that the proposed algorithm can effectively reduce the computational complexity and improve the performance compared with traditional data dimension reduction algorithms.

Introduction
Related
I represent the three dimensions
Framework of the icHOSVD Algorithm
Fusion of Unstructured
A Tensor Space Fusion Method Based on Semi-Tensor Product
An icHOSVD Algorithm Based on Tensor
Tensor Segmentation
Experiment Analysis
Summary
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call