Graded LinClosure.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F06%3A00002591" target="_blank" >RIV/61989592:15310/06:00002591 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Graded LinClosure.
Original language description
We present graded extension of the algorithm LinClosure. Graded LinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute implications. It can also be used together with graded extension of Ganter's NextClosure algorithm to compute non-redundant bases of data tables with fuzzy attributes. We present foundations, algorithm, preliminary analysis of its complexity, implementation details, and illustrative examples.
Czech name
Algoritmus LinClosure pracující ve stupních
Czech description
Prezentace výsledků studia algoritmu LinClosure pracující ve stupních.
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1ET101370417" target="_blank" >1ET101370417: Hierarchical analysis of complex data</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of Concept Lattices and Their Applications
ISBN
978-9973-61-481-0
ISSN
—
e-ISSN
—
Number of pages
335
Pages from-to
71-84
Publisher name
Faculté des Sciences de Tunis, Université Centrale
Place of publication
Tunisia
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—