31 July 2018 in IEEE Transactions on Fuzzy Systems
The existing definition of generalized intuitionistic fuzzy soft sets (GIFSSs) is clarified and reformulated as a combination of an IFSS over the universe of discourse and an intuitionistic fuzzy set in the parameter set. With this new perspective, two different types of generalized intuitionistic fuzzy soft subsets and various new operations are developed for GIFSSs. The upper and lower substitutions for both intuitionistic fuzzy sets and GIFSSs are defined as well. Some existing notions and results are improved by virtue of these new concepts. Using the expectation score function, two binary relations are proposed for comparing intuitionistic fuzzy values. An algorithm is designed for coping with multiattribute decision making (MADM) problems with a combined use of the GIFSS, the extended intersection operation, the intuitionistic fuzzy weighted averaging operator, and other related notions. A case study concerning a faculty appointment problem is conducted to illustrate the proposed algorithm. Moreover, a comparative analysis between our approach and other related works is given to demonstrate the effectiveness and advantages of the newly proposed method.
29 November 2021 in Journal of Mathematics
Traditional association rule extraction may run into some difficulties due to ignoring the temporal aspect of the collected data. Particularly, it happens in many cases that some item sets are frequent during specific time periods, although they are not frequent in the whole data set. In this study, we make an effort to enhance conventional rule mining by introducing temporal soft sets. We define temporal granulation mappings to induce granular structures for temporal transaction data. Using this notion, we define temporal soft sets and their Q -clip soft sets to establish a novel framework for mining temporal association rules. A number of useful characterizations and results are obtained, including a necessary and sufficient condition for fast identification of strong temporal association rules. By combining temporal soft sets with NegNodeset-based frequent item set mining techniques, we develop the negFIN-based soft temporal association rule mining (negFIN-STARM) method to extract strong temporal association rules. Numerical experiments are conducted on commonly used data sets to show the feasibility of our approach. Moreover, comparative analysis demonstrates that the newly proposed method achieves higher execution efficiency than three well-known approaches in the literature.
20 July 2014 in The Scientific World Journal
Interval-valued fuzzy soft sets realize a hybrid soft computing model in a general framework. Both Molodtsov’s soft sets and interval-valued fuzzy sets can be seen as special cases of interval-valued fuzzy soft sets. In this study, we first compare four different types of interval-valued fuzzy soft subsets and reveal the relations among them. Then we concentrate on investigating some nonclassical algebraic properties of interval-valued fuzzy soft sets under the soft product operations. We show that some fundamental algebraic properties including the commutative and associative laws do not hold in the conventional sense, but hold in weaker forms characterized in terms of the relation. We obtain a number of algebraic inequalities of interval-valued fuzzy soft sets characterized by interval-valued fuzzy soft inclusions. We also establish the weak idempotent law and the weak absorptive law of interval-valued fuzzy soft sets using interval-valued fuzzy softJ-equal relations. It is revealed that the soft product operationsandof interval-valued fuzzy soft sets do not always have similar algebraic properties. Moreover, we find that only distributive inequalities described by the interval-valued fuzzy softL-inclusions hold for interval-valued fuzzy soft sets.