关键词:迭代最优化; 故障诊断; 知识分类
Analysis of networks faults based oniterative optimization algorithm in neighborhood
LIU Pei-qi LI Zeng-zhi2
(1.School of Information & Control Engineering, Xi’an University of Architecture & Technology, Xi’an 710055, China; 2.School of Electro-nics & Information Engineering, Xi’an Jiaotong University, Xi’an 710049, China)
Abstract:The iterative optimization algorithm is an important method of the unsupervised pattern classification. The center of classes that will be elementary classified in original phases is defined by random method in this algorithm. Because of this reason, the iterative optimization algorithm has some serious defects. The defects were selected samples blindly, presented a local extremum in iterative optimization and didn’t pay attention to clustering tendency of samples. By the researching and analyzing, the newly algorithm, designed iterative optimization algorithm based on neighborhood of samples, according to the conception of the clustering tendency and neighborhood of patterns. The time complexity of the newly algorithm was O(n) and n was a number of samples in sets. is Applied this algorithm in the faults analysis in network management based on SNMP protocol. The analysis results are consistent with faults type and it provides a feasible method for network faults analysis.......