Computing Similarity Dependencies with Pattern Structures
Year: 2013
Type: conference-paper
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. 1
Source: HAL
Authors: Jaume Baixeries, Mehdi Kaytoue, Amedeo Napoli
Institution: Universitat Politècnica de Catalunya
Language: English
Topic: Rough Sets and Fuzzy Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W46102903
