检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:唐学军 周达谋 李慧莲[1] Tang Xuejun;Zhou Damou;Li Huilian(China Unicom Guangdong Branch,Guangzhou 510627,China)
出 处:《邮电设计技术》2024年第9期63-67,共5页Designing Techniques of Posts and Telecommunications
摘 要:传统信令分析方法需要专业人员找出可能与失败码相关的聚集的信令字段值或值组合及其导致失败的概率,并定位网络问题,操作复杂且效率低。通过改进Apriori关联规则算法,将探寻聚集的字段值或其组合的过程转换成发现失败码和相关信令字段值的关联规则。在计算频繁项集时,通过设置最小支持度阈值找出包含失败码的频繁项,将待分析失败码作为后项,减少了算法的复杂度和算力要求,并通过置信度和提升度找出与后项强关联的属性,实现了对失败码集中属性的快速高效识别。Traditional signaling analysis methods require professionals to identify clustered signaling field values or combinations of values that may be related to failure codes and the probability of causing failure codes.Based on this,network problems can be located,which is complex and inefficient to operate.It improves the Apriori association rule algorithm to transform the process of exploring aggregated field values or their combinations into association rules for discovering failure codes and related signaling field values.When calculating the frequent itemset,the minimum support threshold is set to identify the frequent items containing failure codes.The failure codes to be analyzed are treated as the subsequent items,which reduces the complexity and computational power requirements of the algorithm,and the attributes strongly associated with the subsequent items are identified through confidence and enhancement,achieving fast and efficient identification of attributes in the failure code set.
分 类 号:TN915[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.226.47