On minimal sets of graded attribute implications
This work provides a method for optimizing rule sets in data analysis, but it appears incremental as it builds on existing graded rule frameworks without introducing a new paradigm.
The paper addresses the problem of finding minimal sets of graded attribute implications in object-attribute data, presenting a polynomial-time algorithm that transforms a given set into an equivalent one with the fewest rules.
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.