On sets of graded attribute implications with witnessed non-redundancy

05/18/2015
by   Vilem Vychodil, et al.
0

We study properties of particular non-redundant sets of if-then rules describing dependencies between graded attributes. We introduce notions of saturation and witnessed non-redundancy of sets of graded attribute implications are show that bases of graded attribute implications given by systems of pseudo-intents correspond to non-redundant sets of graded attribute implications with saturated consequents where the non-redundancy is witnessed by antecedents of the contained graded attribute implications. We introduce an algorithm which transforms any complete set of graded attribute implications parameterized by globalization into a base given by pseudo-intents. Experimental evaluation is provided to compare the method of obtaining bases for general parameterizations by hedges with earlier graph-based approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

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/27/2014

On minimal sets of graded attribute implications

We explore the structure of non-redundant and minimal sets consisting of...
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
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
02/23/2010

Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules

Association rules are among the most widely employed data analysis metho...
research
02/24/2021

CoreDiag: Eliminating Redundancy in Constraint Sets

Constraint-based environments such as configuration systems, recommender...
research
10/09/2017

Efficient mining of maximal biclusters in mixed-attribute datasets

This paper presents a novel enumerative biclustering algorithm to direct...

Please sign up or login with your details

Forgot password? Click here to reset