OU Portal
Log In
Welcome
Applicants
Z6_60GI02O0O8IDC0QEJUJ26TJDI4
Error:
Javascript is disabled in this browser. This page requires Javascript. Modify your browser's settings to allow Javascript to execute. See your browser's documentation for specific instructions.
{}
Zavřít
Publikační činnost
Probíhá načítání, čekejte prosím...
publicationId :
tempRecordId :
actionDispatchIndex :
navigationBranch :
pageMode :
tabSelected :
isRivValid :
Typ záznamu:
stať ve sborníku (D)
Domácí pracoviště:
Ústav pro výzkum a aplikace fuzzy modelování (94410)
Název:
On the generalization of redundancy criteria for linguistic fuzzy rules
Citace
Cao, T. H. N., Štěpnička, M. a Valášek, R. On the generalization of redundancy criteria for linguistic fuzzy rules.
In:
IEEE International Conference on Knowledge and System Engineering: The 2020 12th International Conference on Knowledge and Systems Engineering (KSE) 2020 Can Tho.
Can Tho City: IEEE, 2020. s. 136-141. ISBN 978-172814510-5.
Podnázev
Rok vydání:
2020
Obor:
Obecná matematika
Počet stran:
6
Strana od:
136
Strana do:
141
Forma vydání:
Tištená verze
Kód ISBN:
978-172814510-5
Kód ISSN:
2164-2508
Název sborníku:
The 2020 12th International Conference on Knowledge and Systems Engineering (KSE)
Sborník:
Mezinárodní
Název nakladatele:
IEEE
Místo vydání:
Can Tho City
Stát vydání:
Sborník vydaný v zahraničí
Název konference:
IEEE International Conference on Knowledge and System Engineering
Místo konání konference:
Can Tho
Datum zahájení konference:
Typ akce podle státní
příslušnosti účastníků akce:
Celosvětová akce
Kód UT WoS:
EID:
2-s2.0-85099585394
Klíčová slova anglicky:
fuzzy linguistic IF-THEN rules; linguistic description; perception-based logical deduction; redundancy; canceling rules
Popis v původním jazyce:
The aim of this paper is to generalize existing criteria for determining redundant fuzzy linguistic rules, i.e., fuzzy IF-THEN rules that use evaluative linguistic expressions, and that can be freely omitted from a given rule-base without any impact Perception-based logical deduction (PbLD) is a specific inference method tailored to the linguistic fuzzy rules with linguistic expressions and it has been shown that this setting enables the investigation of redundant rules from a theoretical point of view. First of all, rules suspicious from redundancy are identified. Secondly, their elimination has to be checked as the suspicion can be canceled by a presence of a so-called canceling rule. However, the situation is complicated as even the impact of the canceling rule can be eliminated by another rule. The previous studies considered theoretical results and the final algorithm under the assumption of at most a single canceling rule.This paper generalizes the investigation to a more general case when even sets of rules that cancel a single suspicion can be found. We elaborate new criteria for such a purpose that enable to construct an algorithm for an automatic detection of redundant fuzzy linguistic rules. The elimination of redundant rules in a given system is an important step towards simplicity, clarity, and explainability, that moreover, decreases computational costs.
Popis v anglickém jazyce:
Seznam ohlasů
Ohlas
R01:
RIV/61988987:17610/20:A21025JW
Complementary Content
Deferred Modules
${title}
${badge}
${loading}
Deferred Modules