Soft set theory is a new mathematical approach to vagueness introduced by Molodtsov. This is a parameterized family of subsets defined over a universal set associated with a set of parameters. In this paper, we define membership function for fuzzy soft sets. Like the soft sets, fuzzy soft set is a notion which allows fuzziness over a soft set model. So far, more than one attempt has been made to define this concept. Maji et al. defined fuzzy soft sets and several operations on them. In this paper we followed the definition of soft sets provided by Tripathy et al. through characteristic functions in 2015. Many related concepts like complement of a fuzzy soft set, null fuzzy soft set, absolute fuzzy soft set, intersection of fuzzy soft sets and union of fuzzy soft sets are redefined. We provide an application of fuzzy soft sets in decision making which substantially improve and is more realistic than the algorithm proposed earlier by Maji et al. © Springer India 2016.

Balakrushna Tripathy

Department of Analytics

School of Computer Science and Engineering

Vellore Campus

Sooraj T.R

Mohanty R.K.

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

A New Approach to Fuzzy Soft Set Theory and Its Application in Decision Making

Advances in Intelligent Systems and Computing Computational Intelligence in Data Mining—Volume 2

As seed selection is a challenging task due to the presence of hundreds of varieties of seeds of each kind, some homework is necessary for selecting suitable seeds as new varieties and kinds of seeds are introduced in the market every year having their own strengths and weaknesses. The complexities involved in the characteristics in the form of parameters results in uncertainties and as a result some uncertainty based model or hybrid models of more than is required to model the scenario and come out with a decision. Soft sets have enough of parameterization tools to support and hence is the most suitable one for such a study. However, as hybrid models are more efficient, the authors select a model called the interval valued fuzzy soft set (IVFSS) and propose a decision-making algorithm for the selection of seeds. A real database of seeds is used for experimental verification of the efficiency of the algorithm. This is the first attempt for such a study. The use of signed priorities and intervals for the membership of values for entities makes the study more efficient and realistic.

Fulltext

International Journal of Fuzzy System Applications

An Interval Valued Fuzzy Soft Set Based Optimization Algorithm for High Yielding Seed Selection

There are several models of uncertainty found in the literature like fuzzy set (FS), rough set, intuitionistic fuzzy set, soft set, and hesitant fuzzy set. Also, several hybrid models have come up as a combination of these models and have been found to be more useful than the individual models. In everyday life, we make many decisions. Making efficient decisions under uncertainty needs better techniques. Many such techniques have been developed in the recent past. These techniques involve soft sets (SS) and intuitionistic fuzzy sets. It is well known that intuitionistic hesitant fuzzy sets are more general than intuitionistic fuzzy sets. In this paper, we redefine interval-valued intuitionistic hesitant fuzzy soft sets (IVIHFSS) and also propose a decision-making technique which extends some of the recently developed algorithms. We also provide an application from real-life situations which illustrates the working of the algorithm and its efficiency over the other algorithms. © Springer Nature Singapore Pte Ltd. 2018.

Smart Computing and Informatics Smart Innovation, Systems and Technologies

A New Approach to Interval-Valued Intuitionistic Hesitant Fuzzy Soft Sets and Their Application in Decision Making

Decision making has become a common feature in day-to-day activities. Uncertainty-based models are more efficient in handling such problems. In this chapter, we propose an algorithm in this direction by using a hybrid model formed by combining the two models of soft set (SS) and the intuitionistic fuzzy set (IFS). We follow the characteristic function approach used by Tripathy et al. for the purpose. The illustrative real-life example shows the efficiency of our algorithm over other such models. © Springer Nature Singapore Pte Ltd. 2018.

Improved Decision Making Through IFSS

Molodtsov introduced soft set theory in 1999 to handle uncertainty. It has been found that hybrid models are more useful than that of individual components. Yang et al. introduced the concept of interval valued fuzzy soft set (IVFSS) by combining the interval valued fuzzy sets (IVFS) and soft set model. In this paper we extend it by introducing interval valued hesitant fuzzy soft sets (IVHFSS) through the membership function approach introduced by Tripathy et al. in 2015. To illustrate the application of the new model, we provide a decision making algorithm and use it in stock market analysis. © Springer Nature Singapore Pte Ltd. 2017.

Advances in Intelligent Systems and Computing Artificial Intelligence and Evolutionary Computations in Engineering Systems

Interval Valued Hesitant Fuzzy Soft Sets and Its Application in Stock Market Analysis

There are several models of uncertainty found in the literature like fuzzy set, rough set, soft set and hesitant fuzzy set. Also, several hybrid models have come up as a combination of these models and have been found to be more useful than the individual models. In everyday life we make many decisions. Making efficient decisions under uncertainty needs better techniques. Many such techniques have been developed in the recent past. These techniques involve soft sets and fuzzy sets. In this paper we redefined the hesitant fuzzy soft sets (HFSS) with the help of membership function. We also provide a decision making algorithm. © Springer Nature Singapore Pte Ltd. 2017.

Hesitant Fuzzy Soft Set Theory and Its Application in Decision Making

Uncertainty is an inherent characteristic of modern day databases. In order to handle such databases with uncertainty, several new models have been introduced in the literature. Some new models like fuzzy sets introduced by Zadeh (1965), rough sets invented by Z. Pawlak (1982) and intuitionistic fuzzy sets extended by K.T. Atanassov (1986). All these models have their own pros and cons. However, one of the major problems with these models is the lack of sufficient number of parameters to deal with uncertainty. In order to add adequate number of parameters, soft set theory was introduced by Molodtsov in 1999. Since then the theoretical developments on soft set theory has attracted the attention of researchers. However, the practical applications of any theory are of enough importance to make use of it. In this chapter, the basic definitions of soft set, operations and properties are discussed. Also, the aim in this chapter is to discuss on the different applications of soft sets; like decision making, parameter reduction, data clustering and data dealing with incompleteness.

Handbook of Research on Generalized and Hybrid Set Structures and Applications for Soft Computing Advances in Computational Intelligence and Robotics

Soft Sets and Its Applications

Data clustering has been playing important roles in many areas like pattern recognition, image segmentation, social networks and database anonymisation. Since most of the data available in real life situation are imprecise by nature, many imprecision based data clustering algorithms are found in literature using individual imprecise models as well as their hybrids. It was observed by Krishnapuram and Keller that the possibilistic approach to the basic clustering algorithms is more efficient as the drawbacks of the basic algorithms are removed. This approach was used to develop the possibilistic versions of fuzzy, rough and rough fuzzy C-Means algorithms to develop their corresponding possibilistic versions. In this paper, we extend these algorithms further by proposing a possibilistic rough intuitionistic fuzzy C-Means algorithm (PRIFCM) and compare its efficiency with other possibilistic algorithms and the RIFCM. Experimental analysis is carried out by taking both numeric as well as the image data. Also, DB and the D indices are used for the comparison which establishes the superiority of PRIFCM. © 2015 IEEE.

2015 IEEE International Advance Computing Conference (IACC)

On PRIFCM algorithm for data clustering, image segmentation and comparative analysis

Soft set theory is a new mathematical approach to vagueness introduced by Molodtsov (1999). This is a parameterised family of subsets defined over a universal set using a set of parameters. In this paper, we introduce the notion of characteristic function of a soft set, which helps us in defining the basic operations on soft sets concisely; several concepts associated with it efficiently and make the proofs of properties more elegant. We rectified the definition of complement of a soft set and the earlier definition of complement is now called as the negation of a multiset. Like the crisp multisets, soft multiset is a notion which allows multiple occurrences of elements in a model. So far, more than one attempt has been made to define this concept. Out of these the one put forth by Majumdar (2012) is the most appropriate one and so we use it in this paper. We redefined the concepts of complement of a soft multiset, null soft multiset and absolute soft multiset and introduced many operations on soft multisets like the union and intersection of soft multisets and cardinality of soft multisets. Also, we defined the concepts of addition and deletion of elements from a soft multiset. Two new operations, called the addition and difference of two soft multisets are introduced. We establish several properties of these operations on soft multisets including the De Morgan's Law, associative and distributive properties. A real life example is being used for the purpose of illustration of the notions and concepts. © 2015 Inderscience Enterprises Ltd.

International Journal of Reasoning-based Intelligent Systems

A new approach to soft sets, soft multisets and their properties

Several data clustering techniques have been developed in literature. It has been observed that the algorithms developed by using imprecise models like rough sets, fuzzy sets and intuitionistic fuzzy sets have been better than the crisp algorithms. Also, the hybrid models provide far better clustering algorithms than the individual models. Several such models have been developed by using a combination of fuzzy set introduced by Zadeh, the rough set introduced by Pawlak and the intuitionistic fuzzy introduced by Atanassov. Notable among them being the Rough Fuzzy C-Means (RFCM) introduced by Mitra et al and the rough intuitionistic fuzzy c-means algorithm (RIFCM) introduced and studied by Tripathy et al Krishnapuram and Keller observed that the basic clustering algorithms have the probabilistic flavour; for example due to the presence of the constraint on the memberships used in the fuzzy C-Means (FCM) algorithm. So, they introduced the concept of possibilistic approach and developed a possibilistic fuzzy C-means (PFCM) algorithm. Another approach to PFCM is due to Pal et al. In this paper, we improve a possibilistic rough C-Means (PRCM) algorithm introduced by Anuradha et, al. and introduce a new algorithm, which we call as possibilistic rough fuzzy C-Means (PRFCM) and compare its efficiency with the improved PRCM and the basic PRFCM algorithm to establish experimentally that this algorithm is comparatively better than PRCM and the corresponding RCM algorithm. We perform the experimental analysis by taking different types of numerical datasets and images as inputs and using standard accuracy measures like the DB and the D-index. © 2014 IEEE.

2014 IEEE International Conference on Computational Intelligence and Computing Research

Possibilistic rough fuzzy C-means algorithm in data clustering and image segmentation

Several models have been introduced to capture impreciseness in data. Fuzzy sets introduced by Zadeh and Rough sets introduced by Pawlak are two of the most popular such models. In addition, the notion of intuitionistic fuzzy sets introduced by Atanassov and the hybrid models obtained thereof have been very fruitful from the application point of view. The introduction of fuzzy logic and the approximate reasoning obtained through it are more realistic as they are closer to human reasoning. Equality of sets in crisp mathematics is too restricted from the application point of view. Therefore, extending these concepts, three types of approximate equalities were introduced by Novotny and Pawlak using rough sets. These notions were found to be restrictive in the sense that they again boil down to equality of sets and also the lower approximate equality is artificial. Keeping these points in view, three other types of approximate equalities were introduced by Tripathy in several papers. These approximate equalities were further generalised to cover the approximate equalities of fuzzy sets and intuitionistic fuzzy sets by him. In addition, considering the generalisations of basic rough sets like the covering-based rough sets and multigranular rough sets, the study has been carried out further. In this chapter, the authors provide a comprehensive study of all these forms of approximate equalities and illustrate their applicability through several examples. In addition, they provide some problems for future work.

Journal	Data powered by TypesetAdvances in Intelligent Systems and Computing Computational Intelligence in Data Mining—Volume 2
Publisher	Data powered by TypesetSpringer India
ISSN	2194-5357
Open Access	0