On Consistency of Redundancy Deduction of Linguistic Fuzzy Rules

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F21%3AA2202B4P" target="_blank" >RIV/61988987:17610/21:A2202B4P - isvavai.cz</a>

Výsledek na webu

<a href="https://ieeexplore.ieee.org/document/9648666" target="_blank" >https://ieeexplore.ieee.org/document/9648666</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/KSE53942.2021.9648666" target="_blank" >10.1109/KSE53942.2021.9648666</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On Consistency of Redundancy Deduction of Linguistic Fuzzy Rules

Popis výsledku v původním jazyce

Eliminating the redundant rules in a given system of fuzzy rules is important in fuzzy inference. A high number of seemingly very similar rules can be then reduced and the system is thus simple, comprehensible and adjustable for the users of the rules. This paper focuses on the redundancy of a special type of linguistic fuzzy rules that contain linguistic evaluative expressions. Recently, we have approached to generalize the existing criteria for detecting redundant linguistic fuzzy rules. It is important to mention that the elaboration of the redundancy criteria is initiated by the identification of the so-called investigated pairs, which are the pairs of two rules in which one rule is suspicious from redundancy with respect to another one. Principally, for a given investigated pair, we may use the established criteria to derive the redundancy or non-redundancy of the rule which is suspicious from redundancy. In this paper, we use the most recent generalized criteria and show that the deduction for the redundancy or non-redundancy of a certain rule is consistent when this rule belongs to different investigated pairs.

Název v anglickém jazyce

On Consistency of Redundancy Deduction of Linguistic Fuzzy Rules

Popis výsledku anglicky

Eliminating the redundant rules in a given system of fuzzy rules is important in fuzzy inference. A high number of seemingly very similar rules can be then reduced and the system is thus simple, comprehensible and adjustable for the users of the rules. This paper focuses on the redundancy of a special type of linguistic fuzzy rules that contain linguistic evaluative expressions. Recently, we have approached to generalize the existing criteria for detecting redundant linguistic fuzzy rules. It is important to mention that the elaboration of the redundancy criteria is initiated by the identification of the so-called investigated pairs, which are the pairs of two rules in which one rule is suspicious from redundancy with respect to another one. Principally, for a given investigated pair, we may use the established criteria to derive the redundancy or non-redundancy of the rule which is suspicious from redundancy. In this paper, we use the most recent generalized criteria and show that the deduction for the redundancy or non-redundancy of a certain rule is consistent when this rule belongs to different investigated pairs.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

<a href="/cs/project/GA20-07851S" target="_blank" >GA20-07851S: Fuzzy relační struktury v přibližném usuzování</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

The 2021 13th International Conference on Knowledge and Systems Engineering (KSE)

ISBN

978-1-6654-9975-0

ISSN

—

e-ISSN

2694-4804

Počet stran výsledku

6

Strana od-do

1-6

Název nakladatele

IEEE

Místo vydání

Bangkok

Místo konání akce

Bangkok

Datum konání akce

1. 1. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—