区间值三I算法的鲁棒性  

Robustness of Interval-valued Triple I Algorithms

作　　者：罗敏霞[1] 程泽[1] LUO Min-xia CHENG Ze(College of Science,China Jiliang University, Hangzhou 310018 ,China)

机构地区：[1]中国计量学院理学院,杭州310018

出　　处：《计算机科学》2016年第10期277-281,共5页Computer Science

基　　金：基金项目(61273018;61302190)资助

摘　　要：基于正规Minkowski距离研究了区间值三I算法的鲁棒性。首先,给出区间值模糊连接词的最大灵敏度和区间值模糊集扰动的定义;其次,基于正规Minkowski距离分别讨论了区间值Godel蕴涵、Lukasiewize蕴涵、Goguen蕴涵以及它们各自对应的区间值三角范数的灵敏度;最后,研究了区间值模糊推理全蕴涵三I算法的鲁棒性。In this paper, the robustness of interval-valued triple I algorithms based on normalized Minkowski distance was investigated. Firstly, the concepts of maximum sensitivity of interval-valued fuzzy connectives and perturbation of interval-valued fuzzy sets are proposed. Secondly,based on the normalized Minkowski distance, the sensitivity of inter- val-valued GOdel implication, Lukasiewize implication, Goguen implication and their corresponding t-norms are dis- cussed. Finally, we investigated the robustness of interval-valued fuzzy inference full implication triple I algorithm.

关 键 词：区间值三角范数 区间值剩余蕴涵 区间值三I算法 模糊连接词的灵敏度 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程]