Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
61.640 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Ponències/Comunicacions de congressos
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Ponències/Comunicacions de congressos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Characterizing covers of functional dependencies using FCA

Thumbnail
View/Open
paper23.pdf (726,6Kb)
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/123063

Show full item record
Codocedo, Victor
Baixeries i Juvillà, JaumeMés informacióMés informacióMés informació
Kaytoue, Mehdi
Napoli, Amedeo
Document typeConference report
Defense date2018
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
Functional dependencies (FDs) can be used for various important operations on data, for instance, checking the consistency and the quality of a database (including databases that contain complex data). Consequently, a generic framework that allows mining a sound, complete, non-redundant and yet compact set of FDs is an important tool for many different applications. There are different definitions of such sets of FDs (usually called cover). In this paper, we present the characterization of two different kinds of covers for FDs in terms of pattern structures. The convenience of such a characterization is that it allows an easy implementation of efficient mining algorithms which can later be easily adapted to other kinds of similar dependencies. Finally, we present empirical evidence that the proposed approach can perform better than state-ofthe-art FD miner algorithms in large databases.
CitationCodocedo, V., Baixeries, J., Kaytoue, M., Napoli, A. Characterizing covers of functional dependencies using FCA. A: International Conference on Concept Lattices and Their Applications. "CEUR Workshop Proceedings". 2018, p. 279-290. 
URIhttp://hdl.handle.net/2117/123063
ISBN1613-0073
Publisher versionhttp://ceur-ws.org/Vol-2123/paper23.pdf
Other identifiershttps://hal.archives-ouvertes.fr/hal-01856516/document
Collections
  • Departament de Ciències de la Computació - Ponències/Comunicacions de congressos [1.250]
  • LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge - Ponències/Comunicacions de congressos [119]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
paper23.pdf726,6KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina