Closure structures parameterized by systems of isotone Galois connections

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F17%3A73582746" target="_blank" >RIV/61989592:15310/17:73582746 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Closure structures parameterized by systems of isotone Galois connections

Popis výsledku v původním jazyce

We study properties of classes of closure operators and closure systems parameterized by systems of isotone Galois connections. The parameterizations express stronger requirements on idempotency and monotony conditions of closure operators. The present approach extends previous approaches to fuzzy closure operators which appeared in analysis of object-attribute data with graded attributes and reasoning with if-then rules in graded setting and is also related to analogous results developed in linear temporal logic. In the paper, we present foundations of the operators and include examples of general problems in data analysis where such operators appear.

Název v anglickém jazyce

Closure structures parameterized by systems of isotone Galois connections

Popis výsledku anglicky

We study properties of classes of closure operators and closure systems parameterized by systems of isotone Galois connections. The parameterizations express stronger requirements on idempotency and monotony conditions of closure operators. The present approach extends previous approaches to fuzzy closure operators which appeared in analysis of object-attribute data with graded attributes and reasoning with if-then rules in graded setting and is also related to analogous results developed in linear temporal logic. In the paper, we present foundations of the operators and include examples of general problems in data analysis where such operators appear.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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í

2017

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

International Journal of Approximate Reasoning

ISSN

0888-613X

e-ISSN

—

Svazek periodika

91

Číslo periodika v rámci svazku

DEC

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

21

Strana od-do

1-21

Kód UT WoS článku

000414818500001

EID výsledku v databázi Scopus

2-s2.0-85028926662