Graded LinClosure and its role in relational data analysis
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F08%3A00005388" target="_blank" >RIV/61989592:15310/08:00005388 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Graded LinClosure and its role in relational data analysis
Original language description
We present graded extension of the algorithm textsc{LinClosure}. Graded textsc{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 textsc{NextClosure} algorithm to compute non-redundant bases of data tables with fuzzy attributes. We present foundations, the algorithm, and illustrative examples.
Czech name
Algoritmus LinClosure a jeho role v relační datové analýze
Czech description
Článek představuje algoritmus LinClosure pro neurčitá data.
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
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
4923
Issue of the periodical within the volume
N
Country of publishing house
DE - GERMANY
Number of pages
16
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—