Topic models (e.g., pLSA, LDA, SLDA) have been widely used for segmenting imagery. These models are confined to crisp segmentation. Yet, there are many images in which some regions cannot be assigned a crisp label (e.g., transition regions between a foggy sky and the ground or between sand and water at a beach). In these cases, a visual word is best represented with partial memberships across m...

The inverse problem of general rough sets, considered by the present author in some of her earlier papers, in one of its manifestations is essentially the question of when an agent’s view about crisp and non crisp objects over a set of objects has a rough evolution. In this research the nature of the problem is examined from number-theoretic and combinatorial perspectives under very few assumpt...

This paper is concerned with deriving necessary and sufficient optimality conditions for a fuzzy linear programming problem. Toward this end, an equivalence between fuzzy and crisp linear programming problems is established by means of a specific ranking function. Under this setting, a main theorem gives optimality conditions which do not seem to be in conflict with the so-called Karush-Kuhn-Tu...

We present a fuzzy version of the crisp spatial logic developed by Randell et al., which takes the single relation connected−with as primitive. Membership functions are defined for each spatial relation defined in the crisp theory. Furthermore, principles are presented for defining linguistic variables whose linguistic values are spatial relations. The work reported here addresses spatial reaso...

In this paper, we investigate the fuzzy logic based system characteristics of M/G/1 retrial queuing system with Bernoulli vacation schedule. The service time and vacation time are assumed to be generally distributed. It is found in many practical situations that the queuing models with fuzzy parameters are much more realistic than the classical crisp parameters based queuing models. We have cho...

Optimizing jobshop-scheduling problems (JSSPs), in wh ich imprecise processing times are modeled as fuzzy numbers, results in more flexible solution. That is, the produced schedule is flexible; it stays valid and can cope with all possible durations within the specified range. In this paper, we present evidences that support the claim that solving JSSPs with fuzzy processing times would produce...

Relationships between proto-fuzzy concepts, crisply generated fuzzy concepts, and pattern structures are considered. It is shown that proto-fuzzy concepts are closely related to crisply generated fuzzy concepts in the sense that the mappings involved in the definitions coincide for crisp subsets of attributes. Moreover, a proto-fuzzy concept determines a crisp subset of attributes, which genera...

In this paper we consider a decision maker who shows his/her preferences for different alternatives through a finite set of ordinal values. We analyze the problem of consistency taking into account some transitivity properties within this framework. These properties are based on the very general class of conjunctors on the set of ordinal values. Each reciprocal preference relation on a finite o...

The goal of this paper is to present a logic model with very good properties for the representation and evaluation of fuzzy association rules. For that we are going to combine two approaches. The first one is a model for the representation and evaluation of crisp association rules. The second one is a new proposal for the representation of imprecise properties (in particular for fuzzy sets) by ...

Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. Fuzzy Description Logics were born to represent the former type of knowledge, but they require an appropriate fuzzy language to be agreed and an important number of available resources to be adapted. An alternative is to use classical ontologies to represent fuzzy ontologies. To date, all of the wo...