Isotone fuzzy Galois connections with hedges

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F11%3A10225432" target="_blank" >RIV/61989592:15310/11:10225432 - isvavai.cz</a>
Výsledek na webu
<a href="http://dx.doi.org/10.1016/j.ins.2010.11.011" target="_blank" >http://dx.doi.org/10.1016/j.ins.2010.11.011</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ins.2010.11.011" target="_blank" >10.1016/j.ins.2010.11.011</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Isotone fuzzy Galois connections with hedges
Popis výsledku v původním jazyce
We study isotone fuzzy Galois connections and concept lattices parameterized by particular unary operators. The operators represent linguistic hedges such as "very", "rather", "more or less", etc. Isotone fuzzy Galois connections and concept lattices provide an alternative to their antitone counterparts which are the fundamental structures behind formal concept analysis of data with fuzzy attributes. We show that hedges enable us to control the number of formal concepts in the associated concept lattice. We also describe the structure of the concept lattice and provide a counterpoint to the main theorem of concept lattices.
Název v anglickém jazyce
Isotone fuzzy Galois connections with hedges
Popis výsledku anglicky
We study isotone fuzzy Galois connections and concept lattices parameterized by particular unary operators. The operators represent linguistic hedges such as "very", "rather", "more or less", etc. Isotone fuzzy Galois connections and concept lattices provide an alternative to their antitone counterparts which are the fundamental structures behind formal concept analysis of data with fuzzy attributes. We show that hedges enable us to control the number of formal concepts in the associated concept lattice. We also describe the structure of the concept lattice and provide a counterpoint to the main theorem of concept lattices.

Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
IN - Informatika
OECD FORD obor
—

Projekt
<a href="/cs/project/GAP202%2F10%2F0262" target="_blank" >GAP202/10/0262: Rozklady matic s binárními a ordinálními daty: teorie, algoritmy, složitost</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2011
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ů

Podobné výsledky(10)