An Efficient Reasoning Method for Dependencies over Similarity and Ordinal Data

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F12%3A33141693" target="_blank" >RIV/61989592:15310/12:33141693 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-34620-0_36" target="_blank" >http://dx.doi.org/10.1007/978-3-642-34620-0_36</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-34620-0_36" target="_blank" >10.1007/978-3-642-34620-0_36</a>

Result language
angličtina
Original language name
An Efficient Reasoning Method for Dependencies over Similarity and Ordinal Data
Original language description
We present a new axiomatization of logic for dependencies in data with grades, including ordinal data and data in an extension of Codd's model that takes into account similarity relations on domains. The axiomatization makes possible an efficient methodfor automated reasoning for such dependencies that is presented in the paper. The presented method of automatic reasoning is based on a new simplification equivalence which allows to simplify sets of dependencies while retaining their semantic closures.We include two algorithms for computing closures and checking semantic entailment from sets of dependencies and present experimental comparison showing that the algorithms based on the new axiomatization outperform the algorithms proposed in the past.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GAP103%2F11%2F1456" target="_blank" >GAP103/11/1456: Foundations of Similarity-Based Data Processing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)