Computing Similarity Dependencies with Pattern Structures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Computing Similarity Dependencies with Pattern Structures


Functional dependencies provide valuable knowledge on the relations between the attributes of a data table. To extend their use, generalizations have been proposed, among which purity and approximate dependencies. After discussing those generalizations, we provide an alternative definition, the similarity dependencies, to handle a similarity relation between data-values, hence un-crisping the basic definition of functional dependencies. This work is rooted in formal concept analysis, and we show that similarity dependencies can be easily characterized and computed with pattern structures.
Fichier principal
Vignette du fichier
jb_mk_an-cla2013.pdf (248.88 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00922592 , version 1 (28-12-2013)


  • HAL Id : hal-00922592 , version 1


Jaume Baixeries, Mehdi Kaytoue, Amedeo Napoli. Computing Similarity Dependencies with Pattern Structures. The Tenth International Conference on Concept Lattices and their Applications - CLA 2013,, Karell Bertet, 2013, La Rochelle, France, France. pp.33-44. ⟨hal-00922592⟩
412 View
171 Download


Gmail Facebook X LinkedIn More