Characterizing trees in concept lattices

Kód výsledku v IS VaVaI

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

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Characterizing trees in concept lattices

Popis výsledku v původním jazyce

Concept lattices are systems of conceptual clusters, called formal concepts, which are partially ordered by the subconcept/superconcept relationship. Concept lattices are basic structures used in formal concept analysis. In general, a concept lattice maycontain overlapping clusters and need not be a tree. On the other hand, tree-like classification schemes are appealing and are produced by several clustering methods. In this paper, we present necessary and sufficient conditions on input data for the output concept lattice to form a tree after one removes its least element. We present these conditions for input data with yes/no attributes as well as for input data with fuzzy attributes. In addition, we show how Lindig's algorithm for computing conceptlattices gets simplified when applied to input data for which the associated concept lattice is a tree after removing the least element. The paper also contains illustrative examples.

Název v anglickém jazyce

Characterizing trees in concept lattices

Popis výsledku anglicky

Concept lattices are systems of conceptual clusters, called formal concepts, which are partially ordered by the subconcept/superconcept relationship. Concept lattices are basic structures used in formal concept analysis. In general, a concept lattice maycontain overlapping clusters and need not be a tree. On the other hand, tree-like classification schemes are appealing and are produced by several clustering methods. In this paper, we present necessary and sufficient conditions on input data for the output concept lattice to form a tree after one removes its least element. We present these conditions for input data with yes/no attributes as well as for input data with fuzzy attributes. In addition, we show how Lindig's algorithm for computing conceptlattices gets simplified when applied to input data for which the associated concept lattice is a tree after removing the least element. The paper also contains illustrative examples.

Druh

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

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

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 periodika

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems

ISSN

0218-4885

e-ISSN

—

Svazek periodika

16

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

SG - Singapurská republika

Počet stran výsledku

15

Strana od-do

1-15

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—