Basic algorithm for attribute implications and functional dependencies in graded setting
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F08%3A00005375" target="_blank" >RIV/61989592:15310/08:00005375 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Basic algorithm for attribute implications and functional dependencies in graded setting
Original language description
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure 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'sNextClosure algorithm to compute non-redundant bases of data tables with fuzzy attributes. We present foundations, the algorithm, analysis of its complexity, implementation details, and illustrative examples.
Czech name
Základní algoritmus pro atributové implikace a funkční závislosti ve stupních
Czech description
V práci je navržen algoritmus, který se používá při výpočtu atributových implikací v datech, která obsahují fuzzy atributy, a funkční závislosti v datech s relacemi podobnosti na domenách.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
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
Name of the periodical
International Journal of Foundations of Computer Science
ISSN
0129-0541
e-ISSN
—
Volume of the periodical
19
Issue of the periodical within the volume
2
Country of publishing house
SG - SINGAPORE
Number of pages
21
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—