zbMATH — the first resource for mathematics

Generalizations of rough set tools inspired by graph theory. (English) Zbl 1388.03045
Summary: We introduce and study new generalizations of some rough set tools. Namely, the extended core, the generalized discernibility function, the discernibility space and the maximum partitioner. All these concepts where firstly introduced during the application of rough set theory to graphs, here we show that they have an interesting and useful interpretation also in the general setting. Indeed, among other results, we prove that reducts can be computed in incremental polynomial time, we give some conditions in order that a partition coincides with an indiscernibility partition of a given information table and we give the conditions such that a discernibilitymatrix corresponds to an information table.

03E72 Theory of fuzzy sets, etc.
Full Text: DOI