Derivation digraphs for dependencies in ordinal and similarity-based data
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F14%3A33150775" target="_blank" >RIV/61989592:15310/14:33150775 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S002002551300902X" target="_blank" >http://www.sciencedirect.com/science/article/pii/S002002551300902X</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ins.2013.12.046" target="_blank" >10.1016/j.ins.2013.12.046</a>
Alternative languages
Result language
angličtina
Original language name
Derivation digraphs for dependencies in ordinal and similarity-based data
Original language description
We present graph-based method of reasoning with if-then rules describing dependencies between attributes in ordinal and similarity-based data. The rules we consider have two basic interpretations as attribute implications in object-attribute incidence data where objects are allowed to have attributes (features) to degrees and as similarity-based functional dependencies in an extension of the Codd model of data. Main results in this paper show that degrees to which if-then rules are semantically entailedfrom sets (or graded sets) of other if-then rules can be characterized by existence of particular directed acyclic graphs with vertices labeled by attributes and degrees coming from complete residuated lattices. In addition, we show that the construction of directed acyclic graphs can be used to compute closures of sets of attributes and normalized proofs.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
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
Information Sciences
ISSN
0020-0255
e-ISSN
—
Volume of the periodical
268
Issue of the periodical within the volume
JUN
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
16
Pages from-to
381-396
UT code for WoS article
000335110700026
EID of the result in the Scopus database
—