Fast mining method of network heterogeneous fault tolerant data based on K-means clustering

被引:2
作者
Huang, Haiyang [1 ]
Shang, Zhanlei [1 ]
机构
[1] Zhengzhou Univ Light Ind, Engn Training Ctr, Zhengzhou 450001, Peoples R China
关键词
K-means clustering; network heterogeneous fault-tolerant data; fast mining; redundancy; unsupervised feature selection algorithm;
D O I
10.3233/WEB-210460
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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%.
引用
收藏
页码:115 / 124
页数:10
相关论文
共 15 条
[11]   Image restoration and fault tolerance of stereo SLAM based on generative adversarial net [J].
Wang K. ;
Yue B.-X. ;
Fu J.-W. ;
Liang J. .
Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science), 2019, 53 (01) :115-125
[12]  
Wu JJ, 2019, LASER J, V40, P68
[13]  
Yang H., 2019, Modern Electronics Technique, V42, P145
[14]  
Zhang C, 2020, COMPUT SIMUL, V37, P258
[15]  
Zhao Y.H., 2017, J SHANDONG U ENG SCI, V47, P71