About: Completeness of inference and efficient computation of attribute-dependency formulas for tabular data     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • The present paper contributes to dependencies among attributes in relational data. We continue our previous study of so-called attribute dependency formulas, called AD-formulas. AD-formulas were introduced to serve as constraints to be defined by a user to limit the number of clusters extracted from data. This way, only %22interesting clusters'' are extracted in that the clusters are compatible with the information about relative importance of attributes expressed by a collection of AD-formulas supplied by a user. On the other hand, AD-formulas describe particular dependencies in data. As previously shown, several problems for AD-formulas such as deciding semantic entailment and computing a minimal non-redundant basis of a given set of AD-formulas, are computationally tractable. The aim of the present paper is to present further results on AD-formulas, the inference of AD-formulas, and their relationship to other data dependencies. In particular, we present Armstrong-like rules and a c
  • The present paper contributes to dependencies among attributes in relational data. We continue our previous study of so-called attribute dependency formulas, called AD-formulas. AD-formulas were introduced to serve as constraints to be defined by a user to limit the number of clusters extracted from data. This way, only %22interesting clusters'' are extracted in that the clusters are compatible with the information about relative importance of attributes expressed by a collection of AD-formulas supplied by a user. On the other hand, AD-formulas describe particular dependencies in data. As previously shown, several problems for AD-formulas such as deciding semantic entailment and computing a minimal non-redundant basis of a given set of AD-formulas, are computationally tractable. The aim of the present paper is to present further results on AD-formulas, the inference of AD-formulas, and their relationship to other data dependencies. In particular, we present Armstrong-like rules and a c (en)
Title
  • Completeness of inference and efficient computation of attribute-dependency formulas for tabular data
  • Completeness of inference and efficient computation of attribute-dependency formulas for tabular data (en)
skos:prefLabel
  • Completeness of inference and efficient computation of attribute-dependency formulas for tabular data
  • Completeness of inference and efficient computation of attribute-dependency formulas for tabular data (en)
skos:notation
  • RIV/61989592:15310/07:00003619!RIV10-MSM-15310___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET101370417), P(GA201/05/0079), Z(MSM6198959214)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 414507
http://linked.open...ai/riv/idVysledku
  • RIV/61989592:15310/07:00003619
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • attribute-dependency formulas; completeness (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [39FE98122AA2]
http://linked.open...i/riv/mistoVydani
  • Singapore
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 10th Joint Conference on Information Sciences
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Bělohlávek, Radim
  • Vychodil, Vilém
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • World Scientific Publishing Company
https://schema.org/isbn
  • 978-981-270-967-7
http://localhost/t...ganizacniJednotka
  • 15310
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 117 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software