Computing Similarity Dependencies with Pattern Structures

Jaume Baixeries 1 Mehdi Kaytoue 2, 3 Amedeo Napoli 4
1 Departament de Llenguatges i Sistemes Informatics
LSI - Llenguatges i Sistemes Informàtics
2 DM2L - Data Mining and Machine Learning
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
4 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00922592
Contributor : Amedeo Napoli <>
Submitted on : Saturday, December 28, 2013 - 4:07:31 PM
Last modification on : Wednesday, November 20, 2019 - 2:51:34 AM
Long-term archiving on: Friday, March 28, 2014 - 10:06:07 PM

File

jb_mk_an-cla2013.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00922592, version 1

Citation

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⟩

Share

Metrics

Record views

877

Files downloads

341