Factor structures and central points by similarity

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F08%3A00005458" target="_blank" >RIV/61989592:15310/08:00005458 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Factor structures and central points by similarity

Popis výsledku v původním jazyce

We present a general framework and results on factorization of systems of fuzzy sets by similarity. The result of such factorization can be regarded as a simplified version of the original system in which we deliberately do not distinguish elements whichare highly similar. We assume that the fuzzy sets are fixed points of some closure operator. Examples of such systems are fuzzy concept lattices, fuzzy sets in a given universe, and complete residuated lattices. The similarity relation we consider is ana-cut of a particular fuzzy equivalence relation with a being a similarity threshold supplied by a user which controls the meaning of "highly similar". We present results describing the factorization including an efficient way to compute the factor structure. In addition, we describe a-central points of a given collection of fixed points of a closure operator, i.e. points which are similar to every point in the collection to degree at least a.

Název v anglickém jazyce

Factor structures and central points by similarity

Popis výsledku anglicky

We present a general framework and results on factorization of systems of fuzzy sets by similarity. The result of such factorization can be regarded as a simplified version of the original system in which we deliberately do not distinguish elements whichare highly similar. We assume that the fuzzy sets are fixed points of some closure operator. Examples of such systems are fuzzy concept lattices, fuzzy sets in a given universe, and complete residuated lattices. The similarity relation we consider is ana-cut of a particular fuzzy equivalence relation with a being a similarity threshold supplied by a user which controls the meaning of "highly similar". We present results describing the factorization including an efficient way to compute the factor structure. In addition, we describe a-central points of a given collection of fixed points of a closure operator, i.e. points which are similar to every point in the collection to degree at least a.

Druh

D - Stať ve sborníku

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

<a href="/cs/project/1ET101370417" target="_blank" >1ET101370417: Hierarchická analýza složitých dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

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

Proceedings of International IEEE Conference on Intelligent Systems 2008

ISBN

978-1-4244-1739-1

ISSN

—

e-ISSN

—

Počet stran výsledku

4

Strana od-do

"15-8"-"15-11"

Název nakladatele

IEEE Computer Society Press

Místo vydání

New York

Místo konání akce

Varna, Bulgaria

Datum konání akce

6. 9. 2008

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

WRD - Celosvětová akce

Kód UT WoS článku

—