Revisiting Karnik-Mendel Algorithms in the framework of Linear Fractional Programming

详细信息    查看全文

• 作者：Tufan Kumbasar ^{kumbasart@itu.edu.tr}
• 关键词：Type-2 fuzzy sets and systems ; Type reduction ; Centroid calculation ; Karnik&ndash ; Mendel Algorithms ; Linear Fractional Programming ; Dinkelbach's Algorithm
• 刊名：International Journal of Approximate Reasoning
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：82
• 期：Complete
• 页码：1-21
• 全文大小：493 K
• 卷排序：82

文摘

Centroid Calculation (CC) and Type Reduction (TR) methods based on Linear Fractional Programming are presented for Type-2 Fuzzy Logic. Theoretical explanations are provided to connect LFP theory and Karnik Mendel Algorithms (KMAs). Linear Fractional Programming based CC/TR methods are proposed. An efficient implementation of the Dinkelbach's Algorithm (DA) based TR/CC is presented. It has been revealed that the KMAs can be seen as an implementation of the DA based method.