互联网 qkzz.net
全刊杂志网:首页 > 女性 > 文章正文
刊社推荐

基于邻域迭代最优化算法的网络故障分析


□ 刘培奇 李增智

  摘 要:迭代最优化算法是模式识别中重要的无指导学习方法。算法因随机确定k个聚类中心进行初始划分的原因,存在初始聚类中心选择的盲目性、容易陷入局部极值、忽略样本的聚类趋势等缺点。经过对迭代最优化算法的研究与分析,根据样本的聚类趋势,结合邻域思想,改进了聚类中心的选择方法,设计了基于样本邻域概念的迭代最优化算法,算法总的时间代价为O(n)。该算法已应用于基于SNMP协议的网络故障管理中的故障分析,分析结果与实际故障类型基本一致,并为计算机网络故障分析提供了一种可行的分析方法。

  关键词:迭代最优化; 故障诊断; 知识分类

  中图分类号:TP391.4文献标志码:A

  文章编号:1001-3695(2009)09-3358-03

  doi:10.3969/j.issn.1001-3695.2009.09.044

  Analysis of networks faults based oniterative optimization algorithm in neighborhood

  LIU Pei-qi LI Zeng-zhi2

  (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.

......
很抱歉,暂无全文,若需要阅读全文或喜欢本刊物请联系《计算机应用研究》杂志社购买。
欢迎作者提供全文,请点击编辑
分享:
 

了解更多资讯,请关注“木兰百花园”
分享:
 
精彩图文


关键字
支持中国杂志产业发展,请购买、订阅纸质杂志,欢迎杂志社提供过刊、样刊及电子版。
关于我们 | 网站声明 | 刊社管理 | 网站地图 | 联系方式 | 中图分类法 | RSS 2.0订阅 | IP查询
全刊杂志赏析网 2017