On minimal sets of graded attribute implications

05/27/2014
by   Vilem Vychodil, et al.
0

We explore the structure of non-redundant and minimal sets consisting of graded if-then rules. The rules serve as graded attribute implications in object-attribute incidence data and as similarity-based functional dependencies in a similarity-based generalization of the relational model of data. Based on our observations, we derive a polynomial-time algorithm which transforms a given finite set of rules into an equivalent one which has the least size in terms of the number of rules.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2015

On sets of graded attribute implications with witnessed non-redundancy

We study properties of particular non-redundant sets of if-then rules de...
research
11/05/2015

Computing sets of graded attribute implications with witnessed non-redundancy

In this paper we extend our previous results on sets of graded attribute...
research
05/05/2022

Experimental Study of Concise Representations of Concepts and Dependencies

In this paper we are interested in studying concise representations of c...
research
05/17/2021

Discovery and Contextual Data Cleaning with Ontology Functional Dependencies

Functional Dependencies (FDs) define attribute relationships based on sy...
research
03/06/2013

A Construction of Bayesian Networks from Databases Based on an MDL Principle

This paper addresses learning stochastic rules especially on an inter-at...
research
10/25/2014

Parameterizing the semantics of fuzzy attribute implications by systems of isotone Galois connections

We study the semantics of fuzzy if-then rules called fuzzy attribute imp...
research
02/28/2022

The Complexity of Evaluating nfer

Nfer is a rule-based language for abstracting event streams into a hiera...

Please sign up or login with your details

Forgot password? Click here to reset