直覺(jué)模糊推理SIS算法的統(tǒng)一形式及其性質(zhì)研究
發(fā)布時(shí)間:2019-01-05 18:28
【摘要】:直覺(jué)模糊集作為模糊集的推廣,它引入了真隸屬度和假隸屬度的概念,可以更廣泛的解釋事物或現(xiàn)象的不確定性.并且與模糊推理研究方法類似,直覺(jué)模糊推理的核心問(wèn)題是求解直覺(jué)模糊取式(簡(jiǎn)稱IFMP)和直覺(jué)模糊拒取式(簡(jiǎn)稱IFMT).目前,模糊推理的CRI算法和三I算法已經(jīng)被成功地推廣到直覺(jué)模糊推理的框架之下,而與CRI算法和三I算法相比,模糊推理的SIS算法具有無(wú)條件還原性的優(yōu)點(diǎn),本文擬將模糊推理的SIS算法推廣到直覺(jué)模糊推理的框架下并研究該算法的相應(yīng)性質(zhì).本文主要研究三部分內(nèi)容,首先,我們?cè)谑S嘈椭庇X(jué)模糊蘊(yùn)涵算子的統(tǒng)一框架下,提出了求解直覺(jué)模糊推理IFMP問(wèn)題及IFMT問(wèn)題的SIS算法并給出了解的統(tǒng)一表達(dá)式,證明了剩余型直覺(jué)模糊推理的SIS算法是不需要附加任何條件的還原算法,并且討論了剩余型直覺(jué)模糊推理SIS算法的-水平解.其次,研究了求解Lukasiewicz型直覺(jué)模糊推理IFMP及IFMT問(wèn)題的SIS算法的連續(xù)性,并證明了該算法關(guān)于兩種直覺(jué)模糊自然距離都是連續(xù)的.最后,研究了求解Lukasiewicz型直覺(jué)模糊推理IFMP及IFMT問(wèn)題的SIS算法關(guān)于兩種直覺(jué)模糊自然距離的魯棒性.
[Abstract]:As a generalization of fuzzy sets, intuitionistic fuzzy sets introduce the concepts of true membership and false membership, which can explain the uncertainty of things or phenomena more widely. And similar to the research method of fuzzy reasoning, the core problems of intuitionistic fuzzy reasoning are solving intuitionistic fuzzy selection (IFMP) and intuitionistic fuzzy rejection (IFMT). At present, the CRI algorithm and the triple I algorithm of fuzzy reasoning have been successfully extended to the framework of intuitionistic fuzzy reasoning. Compared with the CRI algorithm and the triple I algorithm, the SIS algorithm of fuzzy reasoning has the advantage of unconditional reducibility. In this paper, the SIS algorithm of fuzzy reasoning is extended to the framework of intuitionistic fuzzy reasoning and the corresponding properties of the algorithm are studied. In this paper, we mainly study three parts. Firstly, under the unified framework of residual intuitionistic fuzzy implication operator, we propose a SIS algorithm for solving intuitionistic fuzzy reasoning IFMP problem and IFMT problem, and give the unified expression of the solution. It is proved that the SIS algorithm of residual intuitionistic fuzzy reasoning is a reduction algorithm without any conditions, and the horizontal solution of the residual intuitionistic fuzzy reasoning SIS algorithm is discussed. Secondly, the continuity of the SIS algorithm for solving the IFMP and IFMT problems of Lukasiewicz type intuitionistic fuzzy reasoning is studied, and it is proved that the algorithm is continuous for both intuitionistic fuzzy natural distances. Finally, the robustness of the SIS algorithm for solving the IFMP and IFMT problems of Lukasiewicz type intuitionistic fuzzy reasoning is studied on the two kinds of intuitionistic fuzzy natural distances.
【學(xué)位授予單位】:蘭州理工大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2017
【分類號(hào)】:O159
本文編號(hào):2402141
[Abstract]:As a generalization of fuzzy sets, intuitionistic fuzzy sets introduce the concepts of true membership and false membership, which can explain the uncertainty of things or phenomena more widely. And similar to the research method of fuzzy reasoning, the core problems of intuitionistic fuzzy reasoning are solving intuitionistic fuzzy selection (IFMP) and intuitionistic fuzzy rejection (IFMT). At present, the CRI algorithm and the triple I algorithm of fuzzy reasoning have been successfully extended to the framework of intuitionistic fuzzy reasoning. Compared with the CRI algorithm and the triple I algorithm, the SIS algorithm of fuzzy reasoning has the advantage of unconditional reducibility. In this paper, the SIS algorithm of fuzzy reasoning is extended to the framework of intuitionistic fuzzy reasoning and the corresponding properties of the algorithm are studied. In this paper, we mainly study three parts. Firstly, under the unified framework of residual intuitionistic fuzzy implication operator, we propose a SIS algorithm for solving intuitionistic fuzzy reasoning IFMP problem and IFMT problem, and give the unified expression of the solution. It is proved that the SIS algorithm of residual intuitionistic fuzzy reasoning is a reduction algorithm without any conditions, and the horizontal solution of the residual intuitionistic fuzzy reasoning SIS algorithm is discussed. Secondly, the continuity of the SIS algorithm for solving the IFMP and IFMT problems of Lukasiewicz type intuitionistic fuzzy reasoning is studied, and it is proved that the algorithm is continuous for both intuitionistic fuzzy natural distances. Finally, the robustness of the SIS algorithm for solving the IFMP and IFMT problems of Lukasiewicz type intuitionistic fuzzy reasoning is studied on the two kinds of intuitionistic fuzzy natural distances.
【學(xué)位授予單位】:蘭州理工大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2017
【分類號(hào)】:O159
【參考文獻(xiàn)】
相關(guān)期刊論文 前4條
1 李駿;白莉君;;模糊推理SIS算法的統(tǒng)一形式及其還原性[J];計(jì)算機(jī)科學(xué)與探索;2016年10期
2 鄭慕聰;史忠科;劉艷;;剩余型直覺(jué)模糊推理的三Ⅰ方法[J];中國(guó)科學(xué):信息科學(xué);2013年06期
3 鄒祥福;裴道武;;模糊推理的SIS算法[J];模糊系統(tǒng)與數(shù)學(xué);2010年06期
4 徐蔚鴻,謝中科,楊靜宇,葉有培;兩類模糊推理算法的連續(xù)性和逼近性[J];軟件學(xué)報(bào);2004年10期
,本文編號(hào):2402141
本文鏈接:http://sikaile.net/kejilunwen/yysx/2402141.html
最近更新
教材專著