补偿竞争风险聚合算法研究  

Research of Compensation Competition Risk Aggregation Algorithm

作　　者：王建军[1,2] 李建平[1] 杜仕甫 

机构地区：[1]电子科技大学计算机科学与工程学院,成都610054 [2]湖南第一师范学院信息科学与工程系,长沙410205

出　　处：《小型微型计算机系统》2014年第6期1239-1242,共4页Journal of Chinese Computer Systems

基　　金：湖南省自然科学基金项目(12JJ6056)资助

摘　　要：传统风险聚合计算方法依赖风险分布和风险概率.根据模糊聚类规则,以风险门限为聚类中心,提出补偿竞争风险聚合算法(CCRAA).该算法以风险值与风险门限之间的相对海明距离为基值,按比例对风险值进行补偿,并取补偿后的最大风险值和最小风险值的平均值为聚合风险,使风险聚合计算与风险分布及风险概率无关.使用实例验证了CCRAA的风险聚合效果.The traditional risk aggregation computing methods rely on the risk distribution and risk probability. Accords to the fuzzy clustering rules, tasks the risk threshold as the clustering center~ puts forward a compensation competition risk aggregation algorithm （ CCRAA ）. CCRAA takes the relative Hamming distances between the risk values and risk threshold as the basic values, compensates the risk values proportionally, and takes the mean value of the compensated maximum risk value and minimum risk value as the collective risk, so that the risk aggregation calculation is independent of the risk distribution and risk probability. An example proves the results obtained by CCRAA.

关 键 词：信息安全 风险聚合 补偿竞争 模糊聚类 海明距离 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]