基于直觉相似度的反向三I算法的鲁棒性  

Robustness of Reverse Triple I AlgorithmBased on Intuitionistic Similarity

作　　者：袁一丹 惠小静[1] 王前 YUAN Yidan;HUI Xiaojing;WANG Qian(School of Mathematics and Computer Science,Yan’an University,Yan’an 716000,Shaanxi Province,China)

机构地区：[1]延安大学数学与计算机科学学院,陕西延安716000

出　　处：《吉林大学学报(理学版)》2025年第2期391-398,共8页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:12261090,12301456)。

摘　　要：以直觉相似度为扰动参数,对直觉模糊取式(IFMP)、直觉模糊拒取式(IFMT)问题的反向三I支持算法和反向三I约束算法进行鲁棒性估计,结果表明,输出的结果不会因为输入的微小改变而产生显著变化,即两种算法均具有良好的鲁棒性.By using the intuitionistic similarity as a perturbation parameter,we estimated the robustness of the reverse triple I sustaining algorithm and reverse triple I restriction algorithm for IFMP and IFMT problems.The results show that the output results will not significantly change due to small changes in the input,indicating that both algorithms have good robustness.

关 键 词：直觉模糊推理 相似度 反向三I支持算法 反向三I约束算法 鲁棒性 

分 类 号：O159[理学—数学]