Derivation digraphs for dependencies in ordinal and similarity-based data

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Derivation digraphs for dependencies in ordinal and similarity-based data

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Derivation digraphs for dependencies in ordinal and similarity-based data

Popis výsledku anglicky

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.

Druh

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

CEP obor

IN - Informatika

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)

Rok uplatnění

2014

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

Information Sciences

ISSN

0020-0255

e-ISSN

—

Svazek periodika

268

Číslo periodika v rámci svazku

JUN

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

16

Strana od-do

381-396

Kód UT WoS článku

000335110700026

EID výsledku v databázi Scopus

—