On sets of graded attribute implications with witnessed non-redundancy

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F16%3A33160393" target="_blank" >RIV/61989592:15310/16:33160393 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.sciencedirect.com/science/article/pii/S0020025515006994" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0020025515006994</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ins.2015.09.044" target="_blank" >10.1016/j.ins.2015.09.044</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On sets of graded attribute implications with witnessed non-redundancy

Popis výsledku v původním jazyce

We study properties of particular non-redundant sets of if-then rules describing dependencies between graded attributes. The semantics of the considered rules is parameterized by linguistic hedges. In the setting of general idempotent truth-stressing hedges, we introduce notions of saturation and witnessed non-redundancy of sets of graded attribute implications. Furthermore, we show that bases of graded attribute implications given by systems of pseudo-intents correspond to non-redundant sets of graded attribute implications with saturated consequents where the non-redundancy is witnessed by antecedents of the contained graded attribute implications. For the special case of graded attribute implications parameterized by globalization, we introduce an algorithm which transforms any complete set of if-then rules into a base given by pseudo-intents. Experimental evaluation is provided to compare the method of obtaining bases with earlier graph-based approaches.

Název v anglickém jazyce

On sets of graded attribute implications with witnessed non-redundancy

Popis výsledku anglicky

We study properties of particular non-redundant sets of if-then rules describing dependencies between graded attributes. The semantics of the considered rules is parameterized by linguistic hedges. In the setting of general idempotent truth-stressing hedges, we introduce notions of saturation and witnessed non-redundancy of sets of graded attribute implications. Furthermore, we show that bases of graded attribute implications given by systems of pseudo-intents correspond to non-redundant sets of graded attribute implications with saturated consequents where the non-redundancy is witnessed by antecedents of the contained graded attribute implications. For the special case of graded attribute implications parameterized by globalization, we introduce an algorithm which transforms any complete set of if-then rules into a base given by pseudo-intents. Experimental evaluation is provided to compare the method of obtaining bases with earlier graph-based approaches.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA14-11585S" target="_blank" >GA14-11585S: Relační podobnostní databáze</a><br>

Návaznosti

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

Rok uplatnění

2016

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 periodika

Information Sciences

ISSN

0020-0255

e-ISSN

—

Svazek periodika

329

Číslo periodika v rámci svazku

FEB

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

13

Strana od-do

434-446

Kód UT WoS článku

000367485000027

EID výsledku v databázi Scopus

2-s2.0-84983191348