The paper presents a general method of imposing constraints in formal concept analysis of tabular data with fuzzy attributes. The constraints represent a user-defined requirements which are supplied along with the input data table. The main effect is to filter-out conceptual clusters (outputs of the analysis) which are not compatible with the constraint, in a computationally efficient way. Our ...

In this paper a new class of fuzzy sets, namely r-(τi, τj)-θ-generalized fuzzy closed sets is introduced for smooth bitopological spaces. This class falls strictly in between the class of r-(τj, τi)fuzzy θ-closed sets and the class of r-(τi, τj)generalized fuzzy closed sets. Furthermore, by using the class of r-(τi, τj)-θgeneralized fuzzy closed sets we establish a new fuzzy closure operator wh...

We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it is strictly weaker than relative pseudo-complementation, but stronger than pseudo-complementation. Our main result is that if a complete lattice L is meet-continuous, then every closure operator on L admits weak relative pseudo-complements with respect to continuous closure operators on L.

The lack of double negation and de Morgan properties makes fuzzy logic unsymmetrical. This is the reason why fuzzy versions of notions like closure operator or Galois connection deserve attention for both antiotone and isotone cases, since they are not dual. This paper offers them attention, comming to the following conclusions: some kind of hardly describable ”local preduality” still makes pos...

We introduce fuzzy closure systems and fuzzy closure operators as extensions of closure systems and closure operators. We study relationships between fuzzy closure systems and fuzzy closure spaces. In particular, two families F (S) and F (C) of fuzzy closure systems and fuzzy closure operators on X are complete lattice isomorphic.

Nowadays high fuzzy utility based pattern mining is an emerging topic in data mining. It refers to discover all patterns having a high utility meeting a user-specified minimum high utility threshold. It comprises extracting patterns which are highly accessed in mobile web service sequences. Different from the traditional fuzzy approach, high fuzzy utility mining considers not only counts of mob...

This paper is devoted to the study of nondeterministic closure automata, that is, nondeterministic finite automata (nfas) equipped with a strict closure operator on the set of states and continuous transition structure. We prove that for each regular language L there is a unique minimal nondeterministic closure automaton whose underlying nfa accepts L. Here minimality means no proper sub or quo...