Relational similarity-based model of data part 2: dependencies in data

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F18%3A73588402" target="_blank" >RIV/61989592:15310/18:73588402 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1080/03081079.2017.1357551" target="_blank" >http://dx.doi.org/10.1080/03081079.2017.1357551</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1080/03081079.2017.1357551" target="_blank" >10.1080/03081079.2017.1357551</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Relational similarity-based model of data part 2: dependencies in data

Popis výsledku v původním jazyce

This paper is a sequel to our previous paper on relational similarity-based model of data and its fundamental query systems. The present paper elaborates on the dependency theory in the similarity-based model, focusing mainly on similarity-based functional dependencies, their semantic entailment, model-theoretic properties, complete axiomatizations, characterization of nonredundant bases, computational issues, and related algorithms. The paper shows that various aspects of dependencies in ranked data tables over domains with similarities can be properly formalized using complete residuated lattices as structures for similarities and ranks. In addition to their theoretical importance, the results can be directly applied in the areas of similarity-based constraints, query result analysis, and knowledge discovery from relational data which involves similarity-based reasoning. We assume that readers are acquainted with the prequel of this paper.

Název v anglickém jazyce

Relational similarity-based model of data part 2: dependencies in data

Popis výsledku anglicky

This paper is a sequel to our previous paper on relational similarity-based model of data and its fundamental query systems. The present paper elaborates on the dependency theory in the similarity-based model, focusing mainly on similarity-based functional dependencies, their semantic entailment, model-theoretic properties, complete axiomatizations, characterization of nonredundant bases, computational issues, and related algorithms. The paper shows that various aspects of dependencies in ranked data tables over domains with similarities can be properly formalized using complete residuated lattices as structures for similarities and ranks. In addition to their theoretical importance, the results can be directly applied in the areas of similarity-based constraints, query result analysis, and knowledge discovery from relational data which involves similarity-based reasoning. We assume that readers are acquainted with the prequel of this paper.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/EE2.3.20.0059" target="_blank" >EE2.3.20.0059: Reintegrace českého vědce a vytvoření špičkového týmu v informačních vědách</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

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

INTERNATIONAL JOURNAL OF GENERAL SYSTEMS

ISSN

0308-1079

e-ISSN

—

Svazek periodika

47

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

50

Strana od-do

1-50

Kód UT WoS článku

000415640700001

EID výsledku v databázi Scopus

2-s2.0-85026894377