On minimal sets of graded attribute implications

TL;DR

This paper investigates the structure of minimal graded attribute implications and introduces a polynomial-time algorithm to minimize rule sets, applicable in data analysis and database theory.

Contribution

It presents a novel polynomial-time algorithm for transforming rule sets into minimal equivalent sets in the context of graded attribute implications.

Findings

The algorithm efficiently minimizes rule sets in polynomial time.

Minimal rule sets retain the same informational content as original sets.

The approach applies to data analysis and relational database models.

Abstract

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.