1 Introduction

Ranking alternatives, going for the best option available and making predictions based on available information are all concerned by decision-makers as important aspects of the decision sciences. But these scenarios become more problematic when dealing with uncertainties. Many researchers have developed numerous mathematical tools and algorithms to deal with such situations following the invention of modern probability theory in the 16th century. These models are used widely in different areas ranging from social sciences to medical sciences and engineering, from artificial intelligence to commerce and economics. As a revolution in decision sciences, Zadeh (1965) introduced the concept of fuzzy sets capable of dealing with situations not solvable by crisp set theory. A fuzzy set allowed membership degrees for elements ranging in the closed interval [0, 1], thus handling partial truth between absolute false and absolute truth. This concept was later used to solve many decision-making situations concerning uncertain and vague information (Alcantud 2016).

One limitation of fuzzy set theory is that it restricts the non-membership degree \( \nu (u) \) of the element ‘u’ to the condition \( \nu (u)=1-\mu (u) \) where \( \mu (u) \) is the membership degree. To overcome this limitation, Atanassov (1986) introduced the idea of intuitionistic fuzzy sets (IFSs) as a generalization of fuzzy sets by considering two aspects, i.e., the membership degree \( \mu (u) \) and the non-membership degree \( \nu (u) \) of the element ‘u’ with the condition \( 0\le \mu (u)+\nu (u)\le 1. \) Later, extensions to this like interval-valued intuitionistic fuzzy sets (Atanassov and Gargov 1989) were developed. These models were found to be restricted by the limitation that they cannot solve problems, where the sum of membership and non-membership degrees exceeds 1. This limitation led Atanassov (1999) to develop an extended version of IFSs called ‘IFSs of second type’ with the condition \( 0\le \mu ^2(u)+\nu ^2(u)\le 1 \). Later, Yager (2013) presented the idea of Pythagorean fuzzy sets (PyFSs) which is equivalent to IFSs of second type. This generalization of IFSs proved to be more applicable in many problems as compared to the previous models (Peng and Selvachandran 2019; Zhang et al. 2020).

Even with the high applicability, IFSs and PyFSs are not applicable in situations concerning neutral membership degrees. For example, when considering a voter’s opinion about a candidate, it can turn out to be satisfactory, dissatisfactory, or neutral (neither satisfactory nor dissatisfactory). Moreover, the public’s views about the role of social mediaFootnote 1 in a country vary widely by political affiliation and ideology, that is, positive, negative, and neutral opinions (see Fig. 1). To overcome this limitation, the concept of picture fuzzy sets (PFSs) was developed by Cuong (2013a, 2013b) introducing three indices, i.e., positive membership degree \( \mu (u)\), neutral membership degree \( \tau (u) \), and negative membership degree \( \nu (u) \) of an element ‘u’ with the condition \( 0\le \mu (u)+\tau (u)+\nu (u)\le 1. \) This concept proved to be very helpful in dealing situations concerning positive, negative and neutral aspects. Peng and Luo (2021) presented a decision-making model for China’s stock market bubble warning under picture fuzzy information. Lin et al. (2021b) developed certain picture fuzzy aggregation operators based on interactional partitioned Heronian mean and applied them to solve a decision-making problem. Despite their high applicability, they fail to be used in situations where the sum of these three degrees exceeds 1. This situation led to the introduction of spherical fuzzy sets (SFSs) by Kahraman and Gündoğdu (2018) as a powerful extension of PFSs with the condition \( 0\le \mu ^2(u)+\tau ^2(u)+\nu ^2(u)\le 1. \) Later, Gündogdu and Kahraman (2019) presented generalized SFSs and TOPSIS method based on SFSs together with decision-making application. This concept allows us to deal with situations too complex to be dealt with the models discussed above (see Akram et al. 2021f, g).

A common limitation of all the above methods is their inefficiency in dealing with situations containing different parameters. To solve this lack of parameterization, Molodtsov (1999) was the first who initiated the concept of soft sets. His method is different from the pre-existing methods, which allows handling situations concerning different parameters. The soft set theory has proved to be applicable in numerous problems from various scientific domains like medicine, economics, engineering, computer sciences, etc. Maji et al. (2002) offered an application of soft sets in their work. Ali et al. (2009) investigated several properties of soft sets. The powerful parameterization capability led many researchers to find extensions of the model and the development of hybrid models combining the strength of soft sets with the already existing models. These include picture fuzzy soft sets (Yang et al. 2015), interval-valued m-polar fuzzy soft sets (Akram et al. 2021e), spherical fuzzy soft sets (Perveen et al. 2019), and many more.

These decision-making tools proved to be quite handy in their respective domains. However, there exist situations in many real-life problems and decisive scenarios where the opinion of more than one expert is needed. For example, in selecting the best candidate for a high-rank job, the selection committee needs to take multiple judges’ opinions about the candidate’s suitability. Similarly, in the circumstances where a questionnaire is to be distributed, it is better to have a model carrying all experts’ opinions in one place, rather than applying different operations to combine results using single expert models. Considering this need, Alkhazaleh and Salleh (2011) introduced the idea of soft expert sets (SESs). This model allows users to handle multiple expert’s opinions in one model without performing any operations. Later, the same authors combined their model with fuzzy set theory introducing fuzzy SESs (Alkhazaleh and Salleh 2014). Many other researchers also extended the previously existing models to the multiple expert approaches. Bashir and Salleh (2012a) introduced the concept of fuzzy parameterized SESs. Perveen et al. (2020) developed spherical fuzzy SESs. Many other similar hybrid models involving SESs as their component have been proposed (Akram et al. 2021a; Bashir and Salleh 2012b).

Fig. 1
figure 1

Survey report result of United States (U.S.) public views about impact of social media by Pew research center

All the above models used binary grading procedures in dealing with uncertainties. However, in daily-life, we often encounter non-binary evaluations in many areas. For instance, Alcantud and Laruelle (2014) studied ternary voting situations in a social choice environment. We often encounter non-binary or multinary evaluations in ranking or rating systems. Some real-life examples include rating an app on the play-store or app-store, rating a hotel, or rating services of a telecommunication company using multinary evaluations. These ratings may adopt the form of the number of stars or hearts (like three stars, two stars, etc.) by numbers as labels (0 for bad, 1 for average, 2 for good). In such situations, a model is needed to deal efficiently with multinary information. For this, Fatimah et al. (2018) introduced the notion of N-soft sets (NSSs), which deals with situations concerning multinary information in the forms of ratings and grades. Many hybrid models have also been developed with NSSs to allow applicability to the already existing tools outside the binary evaluations. These include intuitionistic fuzzy N-soft rough sets (Akram et al. 2019), N-SESs and fuzzy N-SESs (Ali and Akram 2020), etc. For more useful terminologies and an overview of the recent advances, referred to Akram et al. (2021b, 2021c, 2021d), Ali et al. (2020), Ashraf et al. (2019), Aydogdu and Gül (2020), Fatimah and Alcantud (2021), Gündogdu (2020), Gündogdu and Kahraman (2020a, 2020b, 2021), Huang et al. (2020), Kahraman and Gündogdu (2020), Kamaci and Petchimuthu (2020), Lin et al. (2020, 2021a, 2021c), Liu et al. (2021a), Mahmood et al. (2019) and Cuong and Kreinovich (2014).

In this paper, we develop a novel hybrid model called spherical fuzzy N-soft expert sets by combining spherical fuzzy soft expert sets (SFSESs) (Perveen et al. 2020) and NSSs (Fatimah et al. 2018). The motivations of the paper are described as follows:

  1. 1.

    The inability of existing models like intuitionistic fuzzy NSSs (Akram et al. 2019), Pythagorean fuzzy NSSs (Zhang et al. 2020), and fuzzy N-SESs (Ali and Akram 2020) in dealing with situations concerning positive, negative, and neutral behavior of the experts.

  2. 2.

    The restriction of SFSESs (Perveen et al. 2020) to binary evaluations.

  3. 3.

    Further, the role of SFSs is very significant in sentiment analysisFootnote 2 (or opinion mining) to find whether data is positive, neutral, or negative. Sentiment analysis is often executed on textual data to support businesses monitor brand and product sentiment in customer response and understand customer requirements (see Fig. 2).

Fig. 2
figure 2

Sentiment analysis

The contributions of this paper are described as follows:

  1. 1.

    The highly applicable and powerful model of SFSESs is merged with the multinary evaluation skills of NSSs to develop a model with higher applicability and better handling of multinary information.

  2. 2.

    The operations, properties, and results of the proposed model are provided and supported with illustrative examples.

  3. 3.

    A real-world application based on the MAGDM scenario, i.e., prediction of local election results using survey reports before the election, is modeled and solved with the proposed model.

  4. 4.

    An efficient algorithm to solve MAGDM problems under SFNSESs is provided.

  5. 5.

    The advantages and limitations of the model; and comparison with the existing models are provided in the comparative analysis.

The remaining paper is organized in the following manner: Sect. 2 recalls some necessary definitions and results to be used afterward in the paper. Section 3 presents a new hybrid model, namely, SFNSESs, and discusses its operations and properties, including subset relation, complements, unions, intersections, agree-SFNSES, disagree-SFNSES, AND operation and OR operation. In Sect. 4, two real-world applications are modeled and solved using SFNSESs. An algorithm is also developed. In Sect. 5, a comparative analysis of the newly developed SFNSES model with pre-existing SFSES and NSS models is provided. Finally, in Sect. 6, some concluding remarks and future directions are provided.

2 Preliminaries

In this section, we recall some definitions and results that will be used throughout the paper. We first go through the notion of a SFS, which is a direct generalization of PFSs.

Definition 1

(Kahraman and Gündoğdu 2018) A spherical fuzzy set or SFS \({\mathcal {S}}\) on a universe \( {\mathcal {U}} \) is an object of the form

$$\begin{aligned} {\mathcal {S}}=\{(u,\mu _{\mathcal {S}}(u),\tau _{\mathcal {S}}(u), \nu _{\mathcal {S}}(u))|u\in {\mathcal {U}}\} \end{aligned}$$

where \(\mu _{\mathcal {S}}(u),\tau _{\mathcal {S}}(u),\nu _{\mathcal {S}}(u)\in [0,1]\) are called the positive membership degree, neutral membership degree and negative membership degree of \( u\in {\mathcal {U}} \), respectively, following the condition,

$$\begin{aligned} \mu ^2_{\mathcal {S}}(u)+\tau ^2_{\mathcal {S}}(u)+\nu ^2_{\mathcal {S}}(u)\le 1,\;\forall \,u\in {\mathcal {U}}. \end{aligned}$$

We denote the set of all SFSs on \({\mathcal {U}}\) by \({\textit{SFS}}({\mathcal {U}})\).

Since SFS model acts as a basic component in constructing the proposed model, most of the operations and properties of the proposed model are based on the properties of SFSs, which are given below:

Definition 2

(Kahraman and Gündoğdu 2018) For any two SFSs \( {\mathcal {A}} \) and \( {\mathcal {B}} \) over the universe \( {\mathcal {U}} \), we have the following:

  1. 1.

    \({\mathcal {A}}\subseteq {\mathcal {B}}\) if \(\forall u\in {\mathcal {U}} \), \( \mu _{\mathcal {A}}(u)\le \mu _{\mathcal {B}}(u),\tau _{\mathcal {A}}(u)\le \tau _{\mathcal {B}}(u) \) and \( \nu _{\mathcal {A}}(u)\ge \nu _{\mathcal {B}}(u). \)

  2. 2.

    \({\mathcal {A}}={\mathcal {B}}\) iff \( {\mathcal {A}}\subseteq {\mathcal {B}} \) and \( {\mathcal {B}}\subseteq {\mathcal {A}}. \)

  3. 3.

    \( {\mathcal {A}}\cup {\mathcal {B}}=\{(u,\max \{\mu _{\mathcal {A}}(u),\mu _{\mathcal {B}}(u)\},\min \{\tau _{\mathcal {A}}(u),\tau _{\mathcal {B}}(u)\},\min \{\nu _{\mathcal {A}}(u), \nu _{\mathcal {B}}(u)\})|u\in {\mathcal {U}}\}. \)

  4. 4.

    \( {\mathcal {A}}\cap {\mathcal {B}}=\{(u,\min \{\mu _{\mathcal {A}}(u),\mu _{\mathcal {B}}(u)\},\min \{\tau _{\mathcal {A}}(u),\tau _{\mathcal {B}}(u)\},\max \{\nu _{\mathcal {A}}(u), \nu _{\mathcal {B}}(u)\})|u\in {\mathcal {U}}\}. \)

  5. 5.

    \(({\mathcal {A}})^c=\{(u,\nu _{\mathcal {A}}(u),\tau _{\mathcal {A}}(u),\mu _{\mathcal {A}}(u))|u\in {\mathcal {U}}\}. \)

To deal with problems considering multiple parameters, the notion of SFSSs is given below.

Definition 3

(Perveen et al. 2019) Let \( {\mathcal {U}} \) be the universe, P a set of parameters and \( X\subseteq P \). A pair \( ({\mathcal {F}},X) \) is called a spherical fuzzy soft set (or SFSS) over \({\mathcal {U}}\), if \({\mathcal {F}}: X\rightarrow {\textit{SFS}}({\mathcal {U}})\) is a mapping defined as

$$\begin{aligned} {\mathcal {F}}(x)=\{(u,\mu _{{\mathcal {F}}(x)}(u),\tau _{{\mathcal {F}}(x)}(u), \nu _{{\mathcal {F}}(x)}(u))|u\in {\mathcal {U}},x\in X\} \end{aligned}$$

where \(\mu _{{\mathcal {F}}(x)}(u),\tau _{{\mathcal {F}}(x)}(u),\nu _{{\mathcal {F}}(x)}(u) \) are positive membership degree, neutral membership degree and negative membership degree, respectively, with the condition, \( \mu ^2_{{\mathcal {F}}(x)}(u)+\tau ^2_{{\mathcal {F}}(x)}(u)+\nu ^2_{{\mathcal {F}}(x)}(u)\le 1. \)

Some more useful notions like level sets and the threshold functions for SFSSs are provided below.

Definition 4

(Perveen et al. 2019) Suppose \( \varpi =({\mathcal {F}},X) \) is a SFSS over the universe \({\mathcal {U}}\). Let \(\lambda :X\rightarrow [0,1]^3\) be a function, such that \( \lambda (x)=({\mathfrak {p}}(x),{\mathfrak {q}}(x),{\mathfrak {r}}(x))\,\forall \,x\in X \), where \( {\mathfrak {p}}(x),{\mathfrak {q}}(x),{\mathfrak {r}}(x)\in [0,1] \). Then, the level soft set of \(\varpi \) with respect to \(\lambda \) is a crisp set \( {\mathcal {L}}(\varpi ,\lambda )=({\mathcal {F}}_\lambda ,X)\), defined by

$$\begin{aligned} {\mathcal {F}}_\lambda (x)=\{u\in {\mathcal {U}}|\mu _{{\mathcal {F}}(x)}(u)\ge {\mathfrak {p}}(x), \tau _{{\mathcal {F}}(x)}(u)\le {\mathfrak {q}}(x),\nu _{{\mathcal {F}}(x)}(u) \le {\mathfrak {r}}(x)\},\;\forall \,x\in X. \end{aligned}$$

Definition 5

(Perveen et al. 2019) Let \(\varpi =({\mathcal {F}},X)\) be a SFSS over \({\mathcal {U}}\), then following are the four well-known threshold functions for \(\varpi \) defined as:

  1. 1.

    Mid-level Threshold Function (\({\textit{mid}}_\varpi \)):

    For \( \varpi =({\mathcal {F}},X) \), the function \({\textit{mid}}_\varpi :X\rightarrow [0,1]^3 \) is defined as

    $$\begin{aligned} {\textit{mid}}_\varpi (x)=\big ({\mathfrak {p}}_{{\textit{mid}}_\varpi }(x), {\mathfrak {q}}_{{\textit{mid}}_\varpi }(x),{\mathfrak {r}}_{{\textit{mid}}_\varpi }(x)\big )\quad \forall \, x\in X, \end{aligned}$$

    such that

    $$\begin{aligned} {\mathfrak {p}}_{{\textit{mid}}_\varpi }(x)=\frac{1}{|{\mathcal {U}}|}\sum _{u\in {\mathcal {U}}}\mu _{{\mathcal {F}}(x)}(u);\; {\mathfrak {q}}_{{\textit{mid}}_\varpi }(x)=\frac{1}{|{\mathcal {U}}|}\sum _{u\in {\mathcal {U}}}\tau _{{\mathcal {F}}(x)}(u);\; {\mathfrak {r}}_{{\textit{mid}}_\varpi }(x)=\frac{1}{|{\mathcal {U}}|}\sum _{u\in {\mathcal {U}}}\nu _{{\mathcal {F}}(x)}(u). \end{aligned}$$

    The corresponding level soft set \( {\mathcal {L}}(\varpi ,{\textit{mid}}_\varpi (x)) \) is termed as the mid-level soft set of \(\varpi \).

  2. 2.

    Top-bottom-bottom-level Threshold Function (\({\textit{tbb}}_\varpi \)):

    For \( \varpi =({\mathcal {F}},X) \), the function \({\textit{tbb}}_\varpi :X\rightarrow [0,1]^3 \) is defined as

    $$\begin{aligned} {\textit{tbb}}_\varpi (x)=\big ({\mathfrak {p}}_{tbb_\varpi }(x), {\mathfrak {q}}_{tbb_\varpi }(x),{\mathfrak {r}}_{tbb_\varpi }(x)\big )\quad \forall \,x\in X, \end{aligned}$$

    such that

    $$\begin{aligned} {\mathfrak {p}}_{{\textit{tbb}}_\varpi }(x)=\mathop {\textit{max}}\limits _{u\in {\mathcal {U}}}\,\mu _{{\mathcal {F}}(x)}(u);\;{\mathfrak {q}}_{{\textit{tbb}}_\varpi }(x)=\mathop {\textit{min}}\limits _{u\in {\mathcal {U}}}\,\tau _{{\mathcal {F}}(x)}(u);\; {\mathfrak {r}}_{{\textit{tbb}}_\varpi }(x)=\mathop {\textit{min}}\limits _{u\in {\mathcal {U}}}\,\nu _{{\mathcal {F}}(x)}(u). \end{aligned}$$

    The corresponding level soft set \( {\mathcal {L}}(\varpi ,{\textit{tbb}}_\varpi (x)) \) is termed as the tbb-level soft set of \(\varpi \).

  3. 3.

    Bottom-bottom-bottom-level Threshold Function (\({\textit{bbb}}_\varpi \)):

    For \( \varpi =({\mathcal {F}},X) \), the function \({\textit{bbb}}_\varpi :X\rightarrow [0,1]^3 \) is defined as

    $$\begin{aligned} {\textit{bbb}}_\varpi (x)=\big ({\mathfrak {p}}_{{\textit{bbb}}_\varpi }(x), {\mathfrak {q}}_{{\textit{bbb}}_\varpi }(x),{\mathfrak {r}}_{{\textit{bbb}}_\varpi }(x)\big )\quad \forall \;x\in X, \end{aligned}$$

    such that

    $$\begin{aligned} {\mathfrak {p}}_{{\textit{bbb}}_\varpi }(x)=\mathop {\textit{min}}\limits _{u\in {\mathcal {U}}}\,\mu _{{\mathcal {F}}(x)}(u);\; {\mathfrak {q}}_{{\textit{bbb}}_\varpi }(x)=\mathop {\textit{min}}\limits _{u\in {\mathcal {U}}}\,\tau _{{\mathcal {F}}(x)}(u);\; {\mathfrak {r}}_{{\textit{bbb}}_\varpi }(x)=\mathop {\textit{min}}\limits _{u\in {\mathcal {U}}}\,\nu _{{\mathcal {F}}(x)}(u). \end{aligned}$$

    The corresponding level soft set \( {\mathcal {L}}(\varpi ,{\textit{bbb}}_\varpi (x)) \) is termed as the bbb-level soft set of \(\varpi \).

  4. 4.

    Med Threshold Function (\({\textit{med}}_\varpi \)):

    For \( \varpi =({\mathcal {F}},X) \), the function \({\textit{med}}_\varpi :X\rightarrow [0,1]^3 \) is defined as

    $$\begin{aligned} {\textit{med}}_\varpi (x)=\big ({\mathfrak {p}}_{{\textit{med}}_\varpi }(x),{\mathfrak {q}}_{{\textit{med}}_\varpi } (x),{\mathfrak {r}}_{{\textit{med}}_\varpi }(x)\big )\quad \forall \,x\in X, \end{aligned}$$

    such that

    $$\begin{aligned} {\mathfrak {p}}_{{\textit{med}}_\varpi }(x)&= \left\{ \begin{array}{ll} \mu _{{\mathcal {F}}(x)}\left( u_{\left( \frac{|{\mathcal {U}}|+1}{2}\right) }\right) , &{}\quad {\textit{if}}\;|{\mathcal {U}}|\;{\textit{is odd}}, \\ \dfrac{\mu _{{\mathcal {F}}(x)}\left( u_{\left( \frac{|{\mathcal {U}}|}{2}\right) } \right) +\mu _{{\mathcal {F}}(x)}\left( u_{\left( \frac{|{\mathcal {U}}|}{2}+1\right) }\right) }{2}, &{}\quad {\textit{if}}\;|{\mathcal {U}}|\;{\textit{is even}}. \end{array} \right. \\ {\mathfrak {q}}_{{\textit{med}}_\varpi }(x)&= \left\{ \begin{array}{ll} \tau _{{\mathcal {F}}(x)}\left( u_{\left( \frac{|{\mathcal {U}}|+1}{2}\right) }\right) , &{}\quad {\textit{if}}\;|{\mathcal {U}}|\;{\textit{is odd}}, \\ \dfrac{\tau _{{\mathcal {F}}(x)}\left( u_{\left( \frac{|{\mathcal {U}}|}{2} \right) }\right) +\tau _{{\mathcal {F}}(x)}\left( u_{\left( \frac{|{\mathcal {U}}|}{2} +1\right) }\right) }{2}, &{}\quad {\textit{if}}\;|{\mathcal {U}}|\;{\textit{is even}}. \end{array} \right. \\ {\mathfrak {r}}_{{\textit{med}}_\varpi }(x)&= \left\{ \begin{array}{ll} \nu _{{\mathcal {F}}(x)}\left( u_{\left( \frac{|{\mathcal {U}}|+1}{2}\right) }\right) , &{}\quad {\textit{if}}\;|{\mathcal {U}}|\;{\textit{is odd}}, \\ \dfrac{\nu _{{\mathcal {F}}(x)}\left( u_{\left( \frac{|{\mathcal {U}}|}{2}\right) }\right) +\nu _{{\mathcal {F}}(x)}\left( u_{\left( \frac{|{\mathcal {U}}|}{2}+1\right) }\right) }{2}, &{}\quad {\textit{if}}\;|{\mathcal {U}}|\;{\textit{is even}}. \end{array} \right. \end{aligned}$$

    Here \( {\mathfrak {p}}_{{\textit{med}}_\varpi }(x),{\mathfrak {q}}_{{\textit{med}}_\varpi }(x),{\mathfrak {r}}_{{\textit{med}}_\varpi }(x) \) are the medians by ranking the positive, neutral and negative membership degrees, respectively, arranged from large to small (or small to large). The corresponding level soft set \( {\mathcal {L}}(\varpi ,{\textit{med}}_\varpi (x)) \) is termed as the med-level soft set of \(\varpi \).

Following is the definition of SFSESs capable of dealing with situations in a soft expert framework.

Definition 6

(Perveen et al. 2020) Let \({\mathcal {U}}\) be the universal set, P be the set of parameters, E be the set of experts and \( {\mathcal {O}}=\{1={\textit{agree}},0={\textit{disagree}}\} \) be the set of opinions. Let \( Z=P\times E\times {\mathcal {O}} \) and \( X\subseteq Z \). A pair \( ({\mathcal {F}},X) \) is said to be a spherical fuzzy soft expert set (or SFSES) over \({\mathcal {U}}\), if \( {\mathcal {F}} \) is a mapping, given by \( {\mathcal {F}}:X\rightarrow {\textit{SFS}}({\mathcal {U}}) \).

We now recall the definition of NSS as follows.

Definition 7

(Fatimah et al. 2018) Let \({\mathcal {U}}\) be the universe of objects, P the set of parameters and \({\mathcal {A}}\subseteq P\). Let \( G=\{0,1,2,\ldots ,N-1\} \) be the set of grades where \( N\in \{2,3,\ldots \} \). Then \( ({\mathcal {F}},{\mathcal {A}},N) \) is said to be an N-soft set or NSS if \( {\mathcal {F}}:{\mathcal {A}}\rightarrow 2^{{\mathcal {U}}\times G}, \) where for each \(\alpha \in {\mathcal {A}}\), \( \exists \) a unique \( (u,g_\alpha ) \in {\mathcal {U}}\times G\) such that \( (u,g_\alpha ) \in {\mathcal {F}}(\alpha ),\,u\in {\mathcal {U}},\,g_\alpha \in G. \)

3 Spherical fuzzy N-soft expert sets

In this section, we first present the main notion of this study and then investigate some of its basic properties and important results with numerical examples.

Let \({\mathcal {U}}\) be a non-empty universal set of objects, P a set of parameters and E a set of experts. Let \({\mathcal {O}}=\{1=\hbox {agree}, 0=\hbox {disagree}\}\) be the set of expert’s opinions and \( G=\{0, 1, 2, 3,\ldots , N-1\} \) be the set of evaluation grades where \( N\in \{2,3,\ldots \} \). Let \( R=P\times E\times {\mathcal {O}} \) and \( X\subseteq R \).

Definition 8

A triple \( (\gamma , X, N) \) is said to be a spherical fuzzy N-soft expert set or SFNSES, where \(\gamma \) is a function given as follows:

$$\begin{aligned} \gamma : X\rightarrow {\textit{SFS}}({\mathcal {U}}\times G), \end{aligned}$$

where \({\textit{SFS}}({\mathcal {U}}\times G) \) represents the set of all spherical fuzzy subsets of \( {\mathcal {U}}\times G \) in such a way that for each \( x \in X \) and \( {\mathfrak {u}}\in {\mathcal {U}} \), \(\exists \) a unique pair \( ({\mathfrak {u}},g_x)\in {\mathcal {U}}\times G \), such that \(\gamma (x)=\langle ({\mathfrak {u}},g_x),\kappa ({\mathfrak {u}},g_x)\rangle \) for \( g_x\in G \) and \( \kappa ({\mathfrak {u}},g_x)\in SFS({\mathcal {U}}\times G) \) where

$$\begin{aligned} \kappa ({\mathfrak {u}},g_x)=\Big (\mu _{\gamma (x)}({\mathfrak {u}},g_x), \tau _{\gamma (x)}({\mathfrak {u}},g_x),\nu _{\gamma (x)}({\mathfrak {u}},g_x)\Big ), \end{aligned}$$

with the condition \( \mu ^2_{\gamma (x)}({\mathfrak {u}},g_x)+\tau ^2_{\gamma (x)}({\mathfrak {u}},g_x)+\nu ^2_{\gamma (x)}({\mathfrak {u}},g_x)\le 1 \).

Here \( g_x \) denotes the grade of the objects with respect to parameters, \(\mu _{\gamma (x)}({\mathfrak {u}},g_x)\) denotes the positive membership degree, \(\tau _{\gamma (x)}({\mathfrak {u}},g_x)\) denotes neutral membership degree, and \(\nu _{\gamma (x)}({\mathfrak {u}},g_x)\) denotes the negative membership degree. The condition \(\mu ^2_{\gamma (x)}({\mathfrak {u}},g_x)+\tau ^2_{\gamma (x)}({\mathfrak {u}},g_x)+\nu ^2_{\gamma (x)}({\mathfrak {u}},g_x)\le 1\) \(\forall \,x \in X \) and \( ({\mathfrak {u}},g_x)\in {\mathcal {U}}\times G \) is kept as a consistency constraint for dealing with the spherical fuzzy soft data.

The following example illustrates our proposed idea of SFNSESs.

Example 1

In a book awards contest, multiple novels are nominated for the “Best Novel of the Year” title on the basis of reader’s ratings. The four most top-rated novels are shortlisted, comprising the set \({\mathcal {U}}=\{{\mathfrak {u}}_1,{\mathfrak {u}}_2,{\mathfrak {u}}_3,{\mathfrak {u}}_4\}\) for the selection of the best novel. The reader’s ratings (0–4 stars) on the basis of parameters \( P=\{p_1=\) innovative \(,p_2=\) strong story-line \(, p_3=\) lengthy \(, p_4=\) entertaining \(\} \) are provided in Table 1.

Table 1 Novel ratings

These star ratings can be interpreted as natural numbers making a 5-soft set as shown in Table 2, where

  • \(\bullet \)’: 0 stands for ‘Bad’,

  • \(\star \)’: 1 stands for ‘Below average’,

  • \(\star \,\star \)’: 2 stands for ‘Average’,

  • \(\star \star \star \)’: 3 stands for ‘Above average’,

  • \(\star \star \star \,\star \)’: 4 stands for ‘Outstanding’

Table 2 5-soft set corresponding to Table 1

Consider there are three judges (experts) comprising the set \( E=\{r,s,t\} \) to declare the final decision using the above star ratings. The extraction of data as grades is easier in this case, but due to the uncertainty in ratings by multiple users, the experts decide to interpret the data in terms of positive membership, neutral membership, and negative membership as defined in Definition 8. The following criteria are used for integrating the provided star ratings with spherical fuzzy data by the experts:

$$\begin{aligned} \begin{array}{ll} -1.0\le S_x< -0.6, &{}\quad {\textit{if}}\;g_x=0, \\ -0.6\le S_x< -0.2, &{}\quad {\textit{if}}\;g_x=1, \\ -0.2\le S_x< 0.2, &{}\quad {\textit{if}}\;g_x=2, \\ 0.2\le S_x < 0.6, &{}\quad {\textit{if}}\;g_x=3, \\ 0.6\le S_x \le 1.0, &{}\quad {\textit{if}}\;g_x=4, \end{array} \end{aligned}$$

where \( S_x=\mu _{\gamma (x)}^2-\tau _{\gamma (x)}^2-\nu _{\gamma (x)}^2 \), such that \( S_x\in [-1,1] \).

Based upon the above criteria, we get Table 3 as below:

Table 3 Rating criteria

Finally, using Table 3 and Definition 8, the spherical fuzzy 5-soft expert set is provided as follows:

$$\begin{aligned} \gamma (p_1,r,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.55,0.09,0.40)\rangle , &{}\langle ({\mathfrak {u}}_2,1),(0.33,0.11,0.75)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.75,0.01,0.30)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.50,0.10,0.50)\rangle . \end{array} \right\} ,\\ \gamma (p_1,s,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.59,0.10,0.41)\rangle , &{}\langle ({\mathfrak {u}}_2,1),(0.20,0.12,0.60)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.7,0.015,0.25)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.45,0.08,0.55)\rangle . \end{array} \right\} ,\\ \gamma (p_1,t,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.57,0.05,0.43)\rangle , &{}\langle ({\mathfrak {u}}_2,1),(0.35,0.10,0.75)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.75,0.015,0.2)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.50,0.09,0.40)\rangle . \end{array} \right\} ,\\ \gamma (p_2,r,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.70,0.01,0.30)\rangle , &{}\langle ({\mathfrak {u}}_2,4),(0.90,0.01,0.10)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.55,0.10,0.45)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.50,0.10,0.50)\rangle . \end{array} \right\} ,\\ \gamma (p_2,s,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.65,0.015,0.3)\rangle , &{}\langle ({\mathfrak {u}}_2,4),(0.95,0.00,0.09)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.50,0.09,0.50)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.55,0.01,0.45)\rangle . \end{array} \right\} ,\\ \gamma (p_2,t,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.70,0.01,0.35)\rangle , &{}\langle ({\mathfrak {u}}_2,4),(0.80,0.01,0.15)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.50,0.10,0.55)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.52,0.05,0.45)\rangle . \end{array} \right\} ,\\ \gamma (p_3,r,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.50,0.10,0.55)\rangle , &{}\langle ({\mathfrak {u}}_2,3),(0.65,0.01,0.35)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.79,0.005,0.3)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.60,0.01,0.39)\rangle . \end{array} \right\} ,\\ \gamma (p_3,s,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.55,0.05,0.55)\rangle , &{}\langle ({\mathfrak {u}}_2,3),(0.75,0.015,0.2)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.60,0.01,0.39)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.70,0.01,0.39)\rangle . \end{array} \right\} ,\\ \gamma (p_3,t,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.50,0.10,0.50)\rangle , &{}\langle ({\mathfrak {u}}_2,3),(0.70,0.01,0.30)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.65,0.01,0.35)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.70,0.01,0.30)\rangle . \end{array} \right\} ,\\ \gamma (p_4,r,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.70,0.01,0.39)\rangle , &{}\langle ({\mathfrak {u}}_2,2),(0.55,0.10,0.45)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.45,0.10,0.55)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.75,0.01,0.35)\rangle . \end{array} \right\} ,\\ \gamma (p_4,s,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.75,0.001,0.2)\rangle , &{}\langle ({\mathfrak {u}}_2,2),(0.45,0.10,0.59)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.50,0.01,0.59)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.75,0.01,0.30)\rangle . \end{array} \right\} ,\\ \gamma (p_4,t,1)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.60,0.01,0.39)\rangle , &{}\langle ({\mathfrak {u}}_2,2),(0.59,0.10,0.55)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.40,0.10,0.55)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.70,0.01,0.35)\rangle . \end{array} \right\} , \end{aligned}$$
$$\begin{aligned} \gamma (p_1,r,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.55,0.10,0.55)\rangle , &{}\langle ({\mathfrak {u}}_2,1),(0.39,0.12,0.60)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.75,0.01,0.35)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.55,0.10,0.40)\rangle . \end{array} \right\} ,\\ \gamma (p_1,s,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.50,0.10,0.55)\rangle , &{}\langle ({\mathfrak {u}}_2,1),(0.00,0.12,0.75)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.60,0.01,0.35)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.55,0.10,0.50)\rangle . \end{array} \right\} ,\\ \gamma (p_1,t,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.40,0.10,0.55)\rangle , &{}\langle ({\mathfrak {u}}_2,1),(0.20,0.10,0.60)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.65,0.01,0.35)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.50,0.10,0.50)\rangle . \end{array} \right\} ,\\ \gamma (p_2,r,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.60,0.01,0.39)\rangle , &{}\langle ({\mathfrak {u}}_2,4),(1.0,0.005,0.20)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.45,0.10,0.55)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.50,0.10,0.50)\rangle . \end{array} \right\} ,\\ \gamma (p_2,s,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.79,0.01,0.20)\rangle , &{}\langle ({\mathfrak {u}}_2,4),(0.80,0.00,0.19)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.50,0.10,0.50)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.40,0.01,0.50)\rangle . \end{array} \right\} ,\\ \gamma (p_2,t,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.60,0.01,0.25)\rangle , &{}\langle ({\mathfrak {u}}_2,4),(1.0,0.005,0.05)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.50,0.10,0.50)\rangle , &{}\langle ({\mathfrak {u}}_4,2),(0.40,0.10,0.55)\rangle . \end{array} \right\} ,\\ \gamma (p_3,r,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.50,0.10,0.50)\rangle , &{}\langle ({\mathfrak {u}}_2,3),(0.79,0.01,0.30)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.60,0.01,0.39)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.75,0.01,0.25)\rangle . \end{array} \right\} ,\\ \gamma (p_3,s,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.45,0.10,0.40)\rangle , &{}\langle ({\mathfrak {u}}_2,3),(0.65,0.01,0.39)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.75,0.01,0.20)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.65,0.01,0.39)\rangle . \end{array} \right\} ,\\ \gamma (p_3,t,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,2),(0.50,0.10,0.50)\rangle , &{}\langle ({\mathfrak {u}}_2,3),(0.60,0.01,0.39)\rangle ,\\ \langle ({\mathfrak {u}}_3,3),(0.70,0.01,0.30)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.60,0.01,0.39)\rangle . \end{array} \right\} ,\\ \gamma (p_4,r,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.75,0.01,0.30)\rangle , &{}\langle ({\mathfrak {u}}_2,2),(0.45,0.10,0.55)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.55,0.10,0.40)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.79,0.01,0.30)\rangle . \end{array} \right\} ,\\ \gamma (p_4,s,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.65,0.01,0.39)\rangle , &{}\langle ({\mathfrak {u}}_2,2),(0.59,0.10,0.45)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.50,0.10,0.50)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.60,0.01,0.39)\rangle . \end{array} \right\} ,\\ \gamma (p_4,t,0)&= \left\{ \begin{array}{ll} \langle ({\mathfrak {u}}_1,3),(0.70,0.01,0.30)\rangle , &{}\langle ({\mathfrak {u}}_2,2),(0.45,0.10,0.55)\rangle ,\\ \langle ({\mathfrak {u}}_3,2),(0.55,0.10,0.45)\rangle , &{}\langle ({\mathfrak {u}}_4,3),(0.60,0.01,0.25)\rangle . \end{array} \right\} . \end{aligned}$$

Here it can be seen how different experts have given different membership values for the same ratings. For example, expert ‘r’ gives positive membership 0.33, neutral membership 0.11, and negative membership 0.75 for the novel \( {\mathfrak {u}}_2 \) to be innovative; whereas for the same, expert ‘s’ considers positive membership 0.20, neutral membership 0.12, and negative membership 0.60 more suitable for the novel \({\mathfrak {u}}_2\) to be innovative. This means that under the same ratings, experts’ judgments about the novels vary. This provides a more efficient framework in dealing with uncertain situations as compared to dealing with the ratings directly.

For a finite number of objects \( {\mathfrak {u}}_i\in {\mathcal {U}} \) and parameter-based opinions \( x_i\in P\times E\times {\mathcal {O}} \), the general tabular representation of a SFNSES \( (\gamma ,X,N) \) is shown in Table 4.

Table 4 General tabular representation of the SFNSES \( (\gamma ,X,N) \)

The tabular representation of the SF5SES in Example 1 is provided in Table 5.

Table 5 SF5SES \( (\gamma ,X,5) \) in Example 1

Now we define the subset relation on SFNSESs as follows.

Definition 9

Consider two SFNSESs \( (\gamma ,X,N) \) and \( (\delta ,Y,N) \) over the universe \({\mathcal {U}}\). Then \( (\gamma ,X,N) \) is said to be a spherical fuzzy N-soft expert subset of \( (\delta ,Y,N) \) if

  1. 1.

    \( X\subseteq Y, \)

  2. 2.

    \( \forall \,x\in X,\,\gamma (x)\subseteq \delta (x) \), that is \( \forall \langle ({\mathfrak {u}},g_x^1),\kappa ({\mathfrak {u}},g_x^1) \rangle \in \gamma (x) \) and \( \forall \langle ({\mathfrak {u}},g_x^2),\kappa ({\mathfrak {u}},g_x^2) \rangle \in \delta (x) \), we have \( g_x^1\le g_x^2 \) and \( \kappa ({\mathfrak {u}},g_x^1) \) as spherical fuzzy subset of \( \kappa ({\mathfrak {u}},g_x^2) \) for \( {\mathfrak {u}}\in {\mathcal {U}} \), \( g_x^1,g_x^2\in G. \)

We denote this subset relation by \( (\gamma ,X,N) {\bar{\subseteq }} (\delta ,Y,N) \). Moreover, \( (\delta ,Y,N) \) is said to be a spherical fuzzy N-soft expert superset of \( (\gamma ,X,N) \). This superset relation is denoted by \( (\delta ,Y,N) {\bar{\supseteq }} (\gamma ,X,N) \).

The following example investigates the concept of spherical fuzzy N-soft expert subset.

Example 2

Reconsider Example 1, suppose that \( Y=\{(p_1,r,1),(p_2,s,1),(p_3,t,1),(p_4,r,0),(p_4,t,0)\} \), and \( Z=\{(p_1,r,1),(p_1,t,1),(p_2,s,1),(p_3,t,1),(p_3,t,0),(p_4,r,0),(p_4,t,0)\} \).

It is clearly visible, that \( Y\subset Z \). Let \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) be two SF5SESs as shown in Tables 6 and 7, respectively.

Table 6 SF5SES \((\gamma ,Y,5)\) in Example 2
Table 7 SF5SES \((\delta ,Z,5)\) in Example 2

Hence, \( (\gamma ,Y,5){\bar{\subseteq }}(\delta ,Z,5). \)

Definition 10

Any two SFNSESs \( (\gamma ,X,N) \) and \( (\delta ,Y,N) \) over the universe \({\mathcal {U}}\) are said to be equal if \( (\gamma ,X,N) \) is a spherical fuzzy N-soft expert subset of \( (\delta ,Y,N) \), and \( (\delta ,Y,N) \) is a spherical fuzzy N-soft expert subset of \( (\gamma ,X,N) \). It is denoted by \( (\gamma ,X,N)=(\delta ,Y,N) \).

We now give some algebraic properties and operations, including complements, extended (and restricted) union, extended (and restricted) intersection, AND, OR operations, and illustrate them with respective examples.

The following definition gives the idea of weak complement of a SFNSES:

Definition 11

Let \( (\gamma ,X,N) \) be a SFNSES on \({\mathcal {U}}\), where \( \gamma (x)=\langle ({\mathfrak {u}},g_x),\kappa ({\mathfrak {u}},g_x)\rangle \). Then the SFNSES \( (\gamma ,X,N)_{\mathfrak {w}}= (\gamma _{\mathfrak {w}},X,N) \) with \( \gamma _{\mathfrak {w}}(x)=\langle ({\mathfrak {u}},g^{\mathfrak {w}}_x),\kappa ({\mathfrak {u}},g^{\mathfrak {w}}_x)\rangle \) is said to be the weak complement of \( (\gamma ,X,N) \), if and only if

$$\begin{aligned} g_x\ne g^{\mathfrak {w}}_x\quad \forall \, x\in X \;{{\mathrm{and}}}\; {\mathfrak {u}}\in {\mathcal {U}}. \end{aligned}$$

As we know that the spherical fuzzy complement of \( \kappa =(\mu _x({\mathfrak {u}}),\tau _x({\mathfrak {u}}),\nu _x({\mathfrak {u}}))\in {\textit{SFS}}({\mathcal {U}}) \) is the spherical fuzzy number \( \kappa ^c=(\nu _x({\mathfrak {u}}),\tau _x({\mathfrak {u}}),\mu _x({\mathfrak {u}}))\in {\textit{SFS}}({\mathcal {U}}) \) where \( x \in X \).

We now define the spherical fuzzy complement of SFNSESs as follows:

Definition 12

Let \( (\gamma ,X,N) \) be a SFNSES on \({\mathcal {U}}\), where \( \gamma (x)=\langle ({\mathfrak {u}},g_x),\kappa ({\mathfrak {u}},g_x)\rangle \). Then the SFNSES \( (\gamma ,X,N)^c = (\gamma ^c,X,N) \) with \( \gamma ^c(x)=\langle ({\mathfrak {u}},g_x),\kappa ^c({\mathfrak {u}},g_x)\rangle \) is said to be the spherical fuzzy complement of \( (\gamma ,X,N) \), if \( \kappa ^c({\mathfrak {u}},g_x) \) is the complement of spherical fuzzy set \( \kappa ({\mathfrak {u}},g_x) \), where \( \kappa , \kappa ^c \in {\textit{SFS}}({\mathcal {U}}\times G). \)

Example 3

Reconsider the SF5SES \( (\gamma ,X,5) \) in Example 1. Then, its spherical fuzzy complement \( (\gamma ,X,5)^c \) is provided in Table 8.

Table 8 Spherical fuzzy complement of the SF5SES \( (\gamma ,X,5) \)

Definition 13

A SFNSES \( (\gamma ,X,N)^c_{\mathfrak {w}} = (\gamma ^c_{\mathfrak {w}},X,N) \) is said to be the spherical fuzzy weak complement of the SFNSES \( (\gamma ,X,N) \), if for each \( \langle ({\mathfrak {u}},g_x),\kappa ({\mathfrak {u}},g_x)\rangle \in \gamma (x) \) and \( \langle ({\mathfrak {u}},g^{\mathfrak {w}}_x),\kappa ^c({\mathfrak {u}},g^{\mathfrak {w}}_x)\rangle \in \gamma ^c_{\mathfrak {w}}(x) \), we have \( g_x\ne g^{\mathfrak {w}}_x \) and \( \kappa ^c \) is a spherical fuzzy complement of \( \kappa \), \( \forall \,x\in X \), \( {\mathfrak {u}}\in {\mathcal {U}} \) and \( \kappa ^c, \kappa \in {\textit{SFS}}({\mathcal {U}}\times G). \)

Example 4

Reconsider the SF5SES \( (\gamma ,Y,5) \) in Example 2. Then, its weak complement \( (\gamma ,Y,5)_{\mathfrak {w}} \) and spherical fuzzy weak complement \( (\gamma ,Y,5)^c_{\mathfrak {w}} \) are provided in Tables 9 and 10, respectively.

Table 9 Weak complement of the SF5SES \( (\gamma ,Y,5) \)
Table 10 Spherical fuzzy weak complement of the SF5SES \( (\gamma ,Y,5) \)

The following definitions give the idea of top (and bottom respectively) weak and spherical fuzzy weak complements of the SFNSESs.

Definition 14

For a SFNSES \( (\gamma ,X,N) \), the top weak complement of \( (\gamma ,X,N) \) is the SFNSES \( ({\bar{\gamma }}_{\mathfrak {w}},X,N) \) such that

$$\begin{aligned} {\bar{g}}^{\mathfrak {w}}_x&= \left\{ \begin{array}{ll} 0, &{}\quad {\textit{if}}\; g_x = \hbox {N}-1, \\ \hbox {N}-1, &{}\quad {\textit{if}}\; g_x < \hbox {N}-1. \end{array} \right. \end{aligned}$$

Similarly, the top spherical fuzzy weak complement of \( (\gamma ,X,N) \) is the SFNSES \( ({\bar{\gamma }}^c_{\mathfrak {w}},X,N) \) with \( \kappa ^c({\mathfrak {u}},{\bar{g}}^{\mathfrak {w}}_x) \) as the spherical fuzzy complement of \( \kappa ({\mathfrak {u}},g_x). \)

Example 5

Consider the SF5SES \( (\gamma ,Y,5) \) as in Example 2. Its top weak complement \( ({\bar{\gamma }}_{\mathfrak {w}},Y,5) \) and top spherical fuzzy weak complement \( ({\bar{\gamma }}^c_{\mathfrak {w}},Y,5) \) are represented by Tables 11 and 12, respectively.

Table 11 Top weak complement of the SF5SES \( (\gamma ,Y,5) \)
Table 12 Top spherical fuzzy weak complement of the SF5SES \( (\gamma ,Y,5) \)

Definition 15

For a SFNSES \( (\gamma ,X,N) \), the bottom weak complement of \( (\gamma ,X,N) \) is the SFNSES (\(\underline{\gamma }_{\mathfrak {w}},X,N) \) such that

$$\begin{aligned} \underline{g}^{\mathfrak {w}}_x =\left\{ \begin{array}{ll} \hbox {N}-1, &{}\quad {\textit{if}}\; g_x = 0, \\ 0, &{}\quad {\textit{if}}\; g_x > 0, \end{array} \right. \end{aligned}$$

Similarly, the bottom spherical fuzzy weak complement of \( (\gamma ,X,N) \) is the SFNSES (\(\underline{\gamma }^c_{\mathfrak {w}},X,N) \) with \( \kappa ^c({\mathfrak {u}},\underline{g}^{\mathfrak {w}}_x) \) as the spherical fuzzy complement of \( \kappa ({\mathfrak {u}},g_x).\)

Example 6

Consider the SF5SES \( (\gamma ,Y,5) \) in Example 2. Its bottom weak complement (\(\underline{\gamma }_{\mathfrak {w}},Y,5) \) and bottom spherical fuzzy weak complement (\(\underline{\gamma }^c_{\mathfrak {w}},Y,5) \) are represented by Tables 13 and 14, respectively.

Table 13 Bottom weak complement of the SF5SES \( (\gamma ,Y,5) \)
Table 14 Bottom spherical fuzzy weak complement of the SF5SES \( (\gamma ,Y,5) \)

Proposition 1

Let \( (\gamma ,X,N) \) be a SFNSES over the universe \({\mathcal {U}},\) then

  1. 1.

    \( ((\gamma ,X,N)^c)^c=(\gamma ,X,N) \)

Proof

  1. 1.

    By Definition 12, we have \( (\gamma ,X,N)^c=(\gamma ^c,X,N) \) with \( \gamma ^c=\langle ({\mathfrak {u}},g_x),\kappa ^c({\mathfrak {u}},g_x)\rangle \), such that \( \forall \alpha \in {\mathcal {U}}\times G \),

    $$\begin{aligned} \kappa ^c(\alpha )=\Big (\mu (\alpha ),\tau (\alpha ),\nu (\alpha )\Big )^c =\Big (\nu (\alpha ),\tau (\alpha ),\mu (\alpha )\Big ), \end{aligned}$$

    which implies that

    $$\begin{aligned} \big (\kappa ^c(\alpha )\big )^c=\Big (\nu (\alpha ),\tau (\alpha ),\mu (\alpha )\Big )^c =\Big (\mu (\alpha ),\tau (\alpha ),\nu (\alpha )\Big ). \end{aligned}$$

    Thus \( (\gamma ^c)^c(x)=\gamma (x)=\langle ({\mathfrak {u}},g_x),\kappa ({\mathfrak {u}},g_x)\rangle \,\forall \, x\in X \), which proves that

    $$\begin{aligned} \big ((\gamma ,X,N)^c\big )^c=(\gamma ,X,N). \end{aligned}$$

\(\square \)

Definition 16

Consider a SFNSES \( (\gamma ,X,N) \) over the universe \({\mathcal {U}}\). Then, the agree-SFNSES \( (\gamma ,X,N)_1 \) is a spherical fuzzy N-soft expert subset of \( (\gamma ,X,N) \) defined as

$$\begin{aligned} (\gamma ,X,N)_1=\{\gamma (x):x\in P\times E\times \{1\}\}. \end{aligned}$$

Definition 17

Consider a SFNSES \( (\gamma ,X,N) \) over the universe \({\mathcal {U}}\). Then, the disagree-SFNSES \( (\gamma ,X,N)_0 \) is a spherical fuzzy N-soft expert subset of \( (\gamma ,X,N) \) defined as

$$\begin{aligned} (\gamma ,X,N)_0=\{\gamma (x):x\in P\times E\times \{0\}\}. \end{aligned}$$

Example 7

Reconsider Example 1. Then the agree SF5SES \( (\gamma ,X,5)_1 \) and the disagree SF5SES \( (\gamma ,X,5)_0 \) of the SF5SES \( (\gamma ,X,5) \) over \( {\mathcal {U}} \) are represented by Tables 15 and 16, respectively.

Table 15 Agree-SF5SES of \( (\gamma ,X,5) \) in Example 7
Table 16 Disagree-SF5SES of \( (\gamma ,X,5) \) in Example 7

Definition 18

The restricted intersection of two SFNSESs \( (\gamma ,X,N) \) and \( (\delta ,Y,N) \) over the universe \({\mathcal {U}}\) is again a SFNSES \( (H_R,A,N) \) over \({\mathcal {U}}\) denoted by \( (\gamma ,X,N) {\bar{\cap }}_R (\delta ,Y,N) \), where \( A=X\cap Y\ne \emptyset \) and \( H_R(x)=\gamma (x)\cap \delta (x) \forall x \in A \) is defined as

$$\begin{aligned} H_R(x)=\left\{ \langle ({\mathfrak {u}},\min (g_x^1,g_x^2)), \kappa ({\mathfrak {u}},g_x^1)\cap _S \kappa ({\mathfrak {u}},g_x^2) \rangle :({\mathfrak {u}},g_x^1)\in \gamma (x), ({\mathfrak {u}},g_x^2)\in \delta (x)\right\} , \end{aligned}$$

here \( \kappa ({\mathfrak {u}},g_x^1)\cap _S \kappa ({\mathfrak {u}},g_x^2) \) represents spherical fuzzy intersection of \( \kappa ({\mathfrak {u}},g_x^1) \) and \( \kappa ({\mathfrak {u}},g_x^2) \).

Definition 19

The restricted union of two SFNSESs \( (\gamma ,X,N) \) and \( (\delta ,Y,N) \) over the universe \({\mathcal {U}}\) is again a SFNSES \( (J_R,A,N) \) over \({\mathcal {U}}\) denoted by \( (\gamma ,X,N) {\bar{\cup }}_R (\delta ,Y,N) \), where \( A=X\cap Y\ne \emptyset \) and \( J_R(x)=\gamma (x)\cup \delta (x) \forall x \in A \) is defined as

$$\begin{aligned} J_R(x)=\left\{ \langle ({\mathfrak {u}},\max (g_x^1,g_x^2)), \kappa ({\mathfrak {u}},g_x^1)\cup _S \kappa ({\mathfrak {u}},g_x^2) \rangle :({\mathfrak {u}},g_x^1)\in \gamma (x), ({\mathfrak {u}},g_x^2)\in \delta (x)\right\} , \end{aligned}$$

here \( \kappa ({\mathfrak {u}},g_x^1)\cup _S \kappa ({\mathfrak {u}},g_x^2) \) represents spherical fuzzy union of \( \kappa ({\mathfrak {u}},g_x^1) \) and \( \kappa ({\mathfrak {u}},g_x^2)\).

Example 8

Considering Example 1 again and suppose that \(Y=\{(p_1,r,1),(p_2,r,1),(p_3,s,1),(p_4,t,1),(p_1,s,0),(p_3,t,0)\},\) and \(Z=\{(p_1,r,1),(p_2,s,1),(p_3,s,1),(p_4,t,1),(p_2,r,0),(p_3,t,0)\}.\)

Consider Tables 17 and 18 represent the SF5SESs \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) corresponding to the sets Y and Z respectively. Let \( A=Y\cap Z. \) Then using Definition 18, their restricted intersection \( (H_R,A,5) \) is given in the Table 19.

Similarly, using Definition 19, Table 20 represents the restricted union \( (J_R,A,5) \) of the SF5SESs \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \).

Table 17 SF5SES \( (\gamma ,Y,5) \) in Example 8
Table 18 SF5SES \( (\delta ,Z,5) \) in Example 8
Table 19 Restricted intersection of SF5SESs \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) in Example 8
Table 20 Restricted union of SF5SESs \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) in Example 8

Proposition 2

If \( (\gamma ,X,N),\) \( (\delta ,Y,N) \) and \( (\psi ,Z,N) \) are three SFNSESs over a common universe \( {\mathcal {U}},\) then

  1. 1.

    \((\gamma ,X,N)\,{\bar{\cup }}_R\,(\delta ,Y,N)=(\delta ,Y,N)\,{\bar{\cup }}_R\,(\gamma ,X,N) \).

  2. 2.

    \((\gamma ,X,N)\,{\bar{\cap }}_R\,(\delta ,Y,N)=(\delta ,Y,N)\,{\bar{\cap }}_R\,(\gamma ,X,N) \).

  3. 3.

    \((\gamma ,X,N)\,{\bar{\cup }}_R\,((\delta ,Y,N)\,{\bar{\cup }}_R\,(\psi ,Z,N))=((\gamma ,X,N)\,{\bar{\cup }}_R\,(\delta ,Y,N))\,{\bar{\cup }}_R\,(\psi ,Z,N) \).

  4. 4.

    \((\gamma ,X,N)\,{\bar{\cap }}_R\,((\delta ,Y,N)\,{\bar{\cap }}_R\,(\psi ,Z,N))=((\gamma ,X,N)\,{\bar{\cap }}_R\,(\delta ,Y,N))\,{\bar{\cap }}_R\,(\psi ,Z,N) \).

Proof

  1. 1.

    Let \( ({\mathfrak {u}},g_x^1)\in \gamma (x) \) and \( ({\mathfrak {u}},g_x^2)\in \delta (x)\,\forall \, x\in X\cap Y \), then by Definition 19,

    $$\begin{aligned} (\gamma ,X,N)\,{\bar{\cup }}_R\,(\delta ,Y,N)&=\left\{ \langle \big ({\mathfrak {u}}, \max (g_x^1,g_x^2)\big ),\kappa ({\mathfrak {u}},g_x^1)\cup _S \kappa ({\mathfrak {u}},g_x^2)\rangle |{\mathfrak {u}}\in {\mathcal {U}}\right\} ,\\&=\left\{ \langle \big ({\mathfrak {u}},\max (g_x^2,g_x^1)\big ), \kappa ({\mathfrak {u}},g_x^2)\cup _S\kappa ({\mathfrak {u}},g_x^1) \rangle |{\mathfrak {u}}\in {\mathcal {U}}\right\} ,\\&=(\delta ,Y,N)\,{\bar{\cup }}_R\,(\gamma ,X,N), \end{aligned}$$

    where \( \kappa ({\mathfrak {u}},g_x^1)\cup _S\kappa ({\mathfrak {u}},g_x^2)=\kappa ({\mathfrak {u}},g_x^2)\cup _S\kappa ({\mathfrak {u}},g_x^1). \) Hence \( (\gamma ,X,N)\,{\bar{\cup }}_R\,(\delta ,Y,N)=(\delta ,Y,N)\,{\bar{\cup }}_R\,(\gamma ,X,N) \).

The remaining parts can be proved similarly. \(\square \)

Definition 20

The extended intersection of two SFNSESs \( (\gamma ,X,N) \) and \( (\delta ,Y,N) \) over the universe \({\mathcal {U}}\) is the SFNSES \( (H_{\mathcal {E}},A,N) \) over \({\mathcal {U}}\), where \( A=X\cup Y \) and \( \forall \, x \in A, \)

$$\begin{aligned} H_{\mathcal {E}}(x)&= \left\{ \begin{array}{ll} \gamma (x), &{}\quad {\textit{if}}\; x \in X-Y, \\ \delta (x), &{}\quad {\textit{if}}\; x \in Y-X, \\ \gamma (x)\cap \delta (x), &{}\quad {\textit{if}}\; x \in X\cap Y, \end{array} \right. \end{aligned}$$

such that \( \forall \, x \in X\cap Y \)

$$\begin{aligned} \gamma (x)\cap \delta (x)=\left\{ \langle ({\mathfrak {u}},\max (g_x^1,g_x^2)),\kappa ({\mathfrak {u}},g_x^1)\cup _S \kappa ({\mathfrak {u}},g_x^2)\rangle :({\mathfrak {u}},g_x^1)\in \gamma (x),\,({\mathfrak {u}},g_x^2)\in \delta (x)|{\mathfrak {u}}\in {\mathcal {U}}\right\} \end{aligned}$$

with \( \kappa ({\mathfrak {u}},g_x^1)\cap _S \kappa ({\mathfrak {u}},g_x^2) \) as the spherical fuzzy intersection of \( \kappa ({\mathfrak {u}},g_x^1) \) and \(\kappa ({\mathfrak {u}},g_x^2) \). This relation is denoted by \((\gamma ,X,N) {\bar{\cap }}_{\mathcal {E}} (\delta ,Y,N)\).

Example 9

Reconsider Example 8 and two SF5SESs \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) in Tables 17 and 18, respectively. Then, by Definition 20, the extended intersection \( (H_{\mathcal {E}},A,5) \) of the SF5SESs \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) is given in Table 21.

Table 21 Extended intersection

Definition 21

The extended union of two SFNSESs \( (\gamma ,X,N) \) and \( (\delta ,Y,N) \) over the universe \({\mathcal {U}}\) is the SFNSES \( (J_{\mathcal {E}},A,N) \) over \({\mathcal {U}}\), where \( A=X\cup Y \) and \( \forall \,x \in A, \)

$$\begin{aligned} J_{\mathcal {E}}(x)&= \left\{ \begin{array}{ll} \gamma (x), &{}\quad {\textit{if}}\; x \in X-Y, \\ \delta (x), &{}\quad {\textit{if}}\; x \in Y-X, \\ \gamma (x)\cup \delta (x), &{}\quad {\textit{if}}\; x \in X\cap Y, \end{array} \right. \end{aligned}$$

such that \( \forall \, x \in X\cap Y \)

$$\begin{aligned} \gamma (x)\cup \delta (x)=\left\{ \langle ({\mathfrak {u}},\max (g_x^1,g_x^2)),\kappa ({\mathfrak {u}},g_x^1)\cup _S \kappa ({\mathfrak {u}},g_x^2)\rangle :({\mathfrak {u}},g_x^1)\in \gamma (x),\,({\mathfrak {u}},g_x^2)\in \delta (x)|{\mathfrak {u}}\in {\mathcal {U}}\right\} , \end{aligned}$$

with \( \kappa ({\mathfrak {u}},g_x^1)\cup _S \kappa ({\mathfrak {u}},g_x^2) \) as the spherical fuzzy union of \( \kappa ({\mathfrak {u}},g_x^1) \) and \( \kappa ({\mathfrak {u}},g_x^2) \). This relation is denoted by \( (\gamma ,X,N) {\bar{\cup }}_{\mathcal {E}} (\delta ,Y,N). \)

Example 10

Reconsider Example 8 and two SF5SESs \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) in Tables 17 and 18, respectively. Then, by Definition 21, the extended union \( (J_{\mathcal {E}},A,5) \) of SF5SESs \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) is given in Table 22.

Table 22 Extended union

Proposition 3

If \( (\gamma ,X,N),\) \( (\delta ,Y,N) \) and \( (\psi ,Z,N) \) are three SFNSESs over a common universe \( {\mathcal {U}},\) then

  1. 1.

    \( (\gamma ,X,N)\,{\bar{\cup }}_{\mathcal {E}}\,(\delta ,Y,N)=(\delta ,Y,N)\,{\bar{\cup }}_{\mathcal {E}}\,(\gamma ,X,N) \).

  2. 2.

    \( (\gamma ,X,N)\,{\bar{\cap }}_{\mathcal {E}}\,(\delta ,Y,N)=(\delta ,Y,N)\,{\bar{\cap }}_{\mathcal {E}}\,(\gamma ,X,N) \).

  3. 3.

    \( (\gamma ,X,N)\,{\bar{\cup }}_{\mathcal {E}}\,((\delta ,Y,N)\,{\bar{\cup }}_{\mathcal {E}}\,(\psi ,Z,N))=((\gamma ,X,N)\,{\bar{\cup }}_{\mathcal {E}}\,(\delta ,Y,N))\,{\bar{\cup }}_{\mathcal {E}}\,(\psi ,Z,N) \).

  4. 4.

    \( (\gamma ,X,N)\,{\bar{\cap }}_{\mathcal {E}}\,((\delta ,Y,N)\,{\bar{\cap }}_{\mathcal {E}}\,(\psi ,Z,N))=((\gamma ,X,N)\,{\bar{\cap }}_{\mathcal {E}}\,(\delta ,Y,N))\,{\bar{\cap }}_{\mathcal {E}}\,(\psi ,Z,N) \).

Proof

  1. 1.

    Let \( (\zeta , X\cup Y,N)=(\gamma ,X,N)\,{\bar{\cup }}_{\mathcal {E}}\,(\delta ,Y,N), \) then from Definition 21, \( \forall \,x\in X\cup Y \), we have

    $$\begin{aligned} \zeta (x)&= \left\{ \begin{array}{ll} \gamma (x), &{}\quad {\textit{if}}\; x \in X-Y, \\ \delta (x), &{}\quad {\textit{if}}\; x \in Y-X, \\ \gamma (x)\cup \delta (x), &{}\quad {\textit{if}}\; x \in X\cap Y. \end{array} \right. \end{aligned}$$

    Considering only non-trivial case when \( x \in X\cap Y \), we have

    $$\begin{aligned} \zeta (x)&=\gamma (x)\cup \delta (x)=\langle \big ({\mathfrak {u}},\max (g_x^1,g_x^2)\big ),\kappa ({\mathfrak {u}},g_x^1) \cup _S\kappa ({\mathfrak {u}},g_x^2)\rangle ,\\&=\langle \big ({\mathfrak {u}},\max (g_x^2,g_x^1)\big ), \kappa ({\mathfrak {u}},g_x^2)\cup _S\kappa ({\mathfrak {u}},g_x^1)\rangle ,\\&=\delta (x)\cup \gamma (x). \end{aligned}$$

    Here \( \kappa ({\mathfrak {u}},g_x^1)\cup _S\kappa ({\mathfrak {u}},g_x^2)=\kappa ({\mathfrak {u}},g_x^2)\cup _S\kappa ({\mathfrak {u}},g_x^1). \) Hence it proves that

    $$\begin{aligned} (\gamma ,X,N)\,{\bar{\cup }}_{\mathcal {E}}\,(\delta ,Y,N)=(\delta ,Y,N) \,{\bar{\cup }}_{\mathcal {E}}\,(\gamma ,X,N). \end{aligned}$$

The remaining parts can be proved similarly. \(\square \)

Proposition 4

Let \( (\gamma ,X,N) \) and \( (\delta ,X,N) \) be two SFNSESs over \({\mathcal {U}},\) we have

  1. 1.

    \( (\gamma ,X,N)\,{\bar{\cup }}_{\mathcal {E}}\,(\delta ,X,N)=(\gamma ,X,N)\,{\bar{\cup }}_R\,(\delta ,X,N) \).

  2. 2.

    \( (\gamma ,X,N)\,{\bar{\cap }}_{\mathcal {E}}\,(\delta ,X,N)=(\gamma ,X,N)\,{\bar{\cap }}_R\,(\delta ,X,N) \).

  3. 3.

    \( (\gamma ,X,N)\,{\bar{\cup }}_{\mathcal {E}}\,(\gamma ,X,N)=(\gamma ,X,N) \).

  4. 4.

    \( (\gamma ,X,N)\,{\bar{\cap }}_{\mathcal {E}}\,(\gamma ,X,N)=(\gamma ,X,N) \).

Proof

  1. 1.

    For all \( x\in X\cup X=X\cap X \), we have

    $$\begin{aligned} (\gamma \,{\bar{\cup }}_{\mathcal {E}}\,\delta )(x)&=\langle \big ({\mathfrak {u}}, \max (g_x^1,g_x^2)\big ),\kappa ({\mathfrak {u}},g_x^1)\cup _S \kappa ({\mathfrak {u}},g_x^2)\rangle ,\\&=(\gamma \,{\bar{\cup }}_R\,\delta )(x). \end{aligned}$$

    Hence, it is proved that

    $$\begin{aligned} (\gamma ,X,N)\,{\bar{\cup }}_{\mathcal {E}}\,(\delta ,X,N)=(\gamma ,X,N)\, {\bar{\cup }}_R\,(\delta ,X,N). \end{aligned}$$

The remaining parts can be proved similarly. \(\square \)

Definition 22

Let \( (\gamma ,X,N) \) and \( (\delta ,Y,N) \) be two SFNSESs over \({\mathcal {U}}\). Then the ‘AND’ operation between them denoted by \( (\gamma ,X,N) \barwedge (\delta ,Y,N) \), is defined as

$$\begin{aligned} (\gamma ,X,N) \barwedge (\delta ,Y,N) = (\rho ,X\times Y,N), \end{aligned}$$

where \( \rho (\alpha ,\beta )=\gamma (\alpha )\cap \delta (\beta ),\,\forall \,(\alpha ,\beta ) \in X\times Y. \)

Example 11

Reconsider Example 1. Assume \( Y=\{(p_1,s,1),(p_2,r,1),(p_4,t,0)\} \) and \( Z=\{(p_1,s,1),(p_3,t,1)\} \), and the SF5SESs \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) are defined on them as shown in Tables 23 and 24, respectively.

Using Definition 22, the AND operation \( (\rho ,Y\times Z,5) \) between these SF5SESs is shown in Table 25.

Table 23 SF5SES \( (\gamma ,Y,5) \) in Example 11
Table 24 SF5SES \( (\delta ,Z,5) \) in Example 11
Table 25 AND operation between \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) in Example 11

Definition 23

Let \( (\gamma ,X,N) \) and \( (\delta ,Y,N) \) be two SFNSESs over \({\mathcal {U}}\). Then the ‘OR’ operation between them denoted by \( (\gamma ,X,N) \veebar (\delta ,Y,N) \), is defined as

$$\begin{aligned} (\gamma ,X,N) \veebar (\delta ,Y,N) = (\varrho ,X\times Y,N), \end{aligned}$$

where \( \varrho (\alpha ,\beta )=\gamma (\alpha )\cup \delta (\beta ),\,\forall \,(\alpha ,\beta ) \in X\times Y. \)

Example 12

Reconsider Example 11 and two SF5SESs \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) in Tables 23 and 24, respectively. Then by Definition 23, the OR operation \( (\varrho ,Y\times Z,5) \) between them is shown in Table 26.

Table 26 OR operation between \( (\gamma ,Y,5) \) and \( (\delta ,Z,5) \) in Example 12

Proposition 5

If \( (\gamma ,X,N), (\delta ,Y,N) \) and \( (\psi ,Z,N) \) are three SFNSESs over the universe \({\mathcal {U}},\) then

  1. 1.

    \((\gamma ,X,N)\veebar ((\delta ,Y,N)\veebar (\psi ,Z,N))=((\gamma ,X,N)\veebar (\delta ,Y,N))\veebar (\psi ,Z,N)\).

  2. 2.

    \((\gamma ,X,N)\barwedge ((\delta ,Y,N)\barwedge (\psi ,Z,N))=((\gamma ,X,N)\barwedge (\delta ,Y,N))\barwedge (\psi ,Z,N)\).

  3. 3.

    \( (\gamma ,X,N)\veebar ((\delta ,Y,N)\barwedge (\psi ,Z,N))=((\gamma ,X,N)\veebar (\delta ,Y,N))\barwedge ((\gamma ,X,N)\veebar (\psi ,Z,N))\).

  4. 4.

    \( (\gamma ,X,N)\barwedge ((\delta ,Y,N)\veebar (\psi ,Z,N))=((\gamma ,X,N)\barwedge (\delta ,Y,N))\veebar ((\gamma ,X,N)\barwedge (\psi ,Z,N))\).

Proof

  1. 1.

    Let \( \delta (\beta )\veebar \psi (\lambda )=\delta (\beta )\cup \psi (\lambda ) \), where for all \( (\beta ,\lambda )\in Y\times Z, \)

    $$\begin{aligned} \delta (\beta )\cup \psi (\lambda )=\langle \big ({\mathfrak {u}},\max (g_\beta ,g_\lambda )\big ),\kappa ({\mathfrak {u}},g_\beta )\cup _S\kappa ({\mathfrak {u}},g_\lambda )\rangle . \end{aligned}$$

    Then,

    $$\begin{aligned} \gamma (\alpha )\veebar \big (\delta (\beta )\veebar \psi (\lambda )\big )&=\gamma (\alpha )\cup \big (\delta (\beta )\cup \psi (\lambda )\big ),\quad \forall \, (\alpha ,(\beta ,\lambda ))\in X\times Y\times Z\\&=\big (\gamma (\alpha )\cup \delta (\beta )\big )\cup \psi (\lambda ),\quad \forall \, ((\alpha ,\beta ),\lambda )\in X\times Y\times Z\\&\quad (\because \text {By Proposition 2})\\&=\big (\gamma (\alpha )\veebar \delta (\beta )\big )\veebar \psi (\lambda ). \end{aligned}$$

    Hence it is proved that

    $$\begin{aligned} (\gamma ,X,N)\veebar ((\delta ,Y,N)\veebar (\psi ,Z,N))=((\gamma ,X,N)\veebar (\delta ,Y,N))\veebar (\psi ,Z,N). \end{aligned}$$
  2. 2.

    Let \( \delta (\beta )\barwedge \psi (\lambda )=\delta (\beta )\cap \psi (\lambda ) \), where for all \( (\beta ,\lambda )\in Y\times Z, \)

    $$\begin{aligned} \delta (\beta )\cap \psi (\lambda )=\langle \big ({\mathfrak {u}},\min (g_\beta ,g_\lambda )\big ),\kappa ({\mathfrak {u}},g_\beta )\cap _S\kappa ({\mathfrak {u}},g_\lambda )\rangle . \end{aligned}$$

    Then,

    $$\begin{aligned} \gamma (\alpha )\barwedge \big (\delta (\beta )\barwedge \psi (\lambda )\big )&=\gamma (\alpha )\cap \big (\delta (\beta )\cap \psi (\lambda )\big ),\quad \forall \, (\alpha ,(\beta ,\lambda ))\in X\times Y\times Z\\&=\big (\gamma (\alpha )\cap \delta (\beta )\big )\cap \psi (\lambda ),\quad \forall \, ((\alpha ,\beta ),\lambda )\in X\times Y\times Z\\&\quad (\because \text {By Proposition 2})\\&=\big (\gamma (\alpha )\barwedge \delta (\beta )\big )\barwedge \psi (\lambda ). \end{aligned}$$

    Hence it is proved that

    $$\begin{aligned} (\gamma ,X,N)\barwedge ((\delta ,Y,N)\barwedge (\psi ,Z,N))=((\gamma ,X,N)\barwedge (\delta ,Y,N))\barwedge (\psi ,Z,N). \end{aligned}$$
  3. 3.

    Let \( \pi (\beta ,\lambda )=\delta (\beta )\barwedge \psi (\lambda ), \) then

    $$\begin{aligned} \gamma (\alpha )\veebar (\delta (\beta )\barwedge \psi (\lambda ))&=\gamma (\alpha )\veebar \pi (\beta ,\lambda ),\\&=\gamma (\alpha )\cup _S\pi (\beta ,\lambda ),\\&=\langle \big ({\mathfrak {u}},\max (g_\alpha ,g_{(\beta ,\lambda )})\big ),\kappa ({\mathfrak {u}},g_\alpha )\cup _S\kappa ({\mathfrak {u}},g_{(\beta ,\lambda )})\rangle ,\\&=\langle \big ({\mathfrak {u}},\max \{g_\alpha ,\min (g_\beta ,g_\lambda )\}\big ),\kappa ({\mathfrak {u}},g_\alpha )\cup _S\{\kappa ({\mathfrak {u}},g_\beta )\cap _S\kappa ({\mathfrak {u}},g_\lambda )\}\rangle ,\\&=\langle \big ({\mathfrak {u}},\min \{\max (g_\alpha ,g_\beta ),\max (g_\alpha ,g_\lambda )\}\big ),\\&\quad \{(\kappa ({\mathfrak {u}},g_\alpha )\cup _S\kappa ({\mathfrak {u}},g_\beta ))\cap _S(\kappa ({\mathfrak {u}},g_\alpha )\cup _S\kappa ({\mathfrak {u}},g_\lambda ))\}\rangle ,\\&=\big (\gamma (\alpha )\cup \delta (\beta )\big )\cap \big (\gamma (\alpha )\cup \psi (\lambda )\big ),\\&=\big (\gamma (\alpha )\veebar \delta (\beta )\big )\barwedge \big (\gamma (\alpha )\veebar \psi (\lambda )\big ). \end{aligned}$$

    Hence proved that

    $$\begin{aligned} (\gamma ,X,N)\veebar \big ((\delta ,Y,N)\barwedge (\psi ,Z,N)\big )= \big ((\gamma ,X,N)\veebar (\delta ,Y,N)\big )\barwedge \big ((\gamma ,X,N)\veebar (\psi ,Z,N)\big ). \end{aligned}$$
  4. 4.

    Similar to proof of part 3. \(\square \)

Proposition 6

Let \( (\gamma ,X,N),\) \( (\delta ,Y,N) \) and \( (\psi ,Z,N) \) be any three SFNSESs over a common universe \( {\mathcal {U}}.\) Then

  1. 1.

    \( (\gamma ,X,N) {\bar{\cap }}_R ((\delta ,Y,N)\, {\bar{\cup }}_{\mathcal {E}} \,(\psi ,Z,N)) = ((\gamma ,X,N) {\bar{\cap }}_R (\delta ,Y,N))\, {\bar{\cup }}_{\mathcal {E}} \,((\gamma ,X,N){\bar{\cap }}_R (\psi ,Z,N)) \).

  2. 2.

    \( (\gamma ,X,N) {\bar{\cup }}_R ((\delta ,Y,N) \,{\bar{\cap }}_{\mathcal {E}} \,(\psi ,Z,N)) = ((\gamma ,X,N) {\bar{\cup }}_R (\delta ,Y,N))\, {\bar{\cap }}_{\mathcal {E}}\, ((\gamma ,X,N) {\bar{\cup }}_R (\psi ,Z,N)) \).

  3. 3.

    \( (\gamma ,X,N)\, {\bar{\cap }}_{\mathcal {E}} \,((\delta ,Y,N) {\bar{\cup }}_R (\psi ,Z,N)) = ((\gamma ,X,N)\, {\bar{\cap }}_{\mathcal {E}} \,(\delta ,Y,N)) {\bar{\cup }}_R ((\gamma ,X,N)\, {\bar{\cap }}_{\mathcal {E}} \,(\psi ,Z,N)) \).

  4. 4.

    \( (\gamma ,X,N)\, {\bar{\cup }}_{\mathcal {E}} \,((\delta ,Y,N) {\bar{\cap }}_R (\psi ,Z,N)) = ((\gamma ,X,N)\, {\bar{\cup }}_{\mathcal {E}}\, (\delta ,Y,N)) {\bar{\cap }}_R ((\gamma ,X,N)\, {\bar{\cup }}_{\mathcal {E}} \,(\psi ,Z,N)) \).

  5. 5.

    \( (\gamma ,X,N) {\bar{\cap }}_R ((\delta ,Y,N) {\bar{\cup }}_R (\psi ,Z,N)) = ((\gamma ,X,N) {\bar{\cap }}_R (\delta ,Y,N)) {\bar{\cup }}_R ((\gamma ,X,N) {\bar{\cap }}_R (\psi ,Z,N)) \).

  6. 6.

    \( (\gamma ,X,N) {\bar{\cup }}_R ((\delta ,Y,N) {\bar{\cap }}_R (\psi ,Z,N)) = ((\gamma ,X,N) {\bar{\cup }}_R (\delta ,Y,N)) {\bar{\cap }}_R ((\gamma ,X,N) {\bar{\cup }}_R (\psi ,Z,N)) \).

Proof

  1. 1.

    Suppose that \( x\in X\cap (Y\cup Z) \). Then, there are three possibilities:

    1. (a)

      If \( x\in X\cap (Y-Z) \), then

      $$\begin{aligned} \gamma (x)\,{\bar{\cap }}_R\,(\delta \,{\bar{\cup }}_{\mathcal {E}}\,\psi )(x)=\gamma (x)\,{\bar{\cap }}_R\,\delta (x)=(\gamma \,{\bar{\cap }}_R\,\delta )(x), \end{aligned}$$

      and

      $$\begin{aligned} (\gamma \,{\bar{\cap }}_R\,\delta )(x)\,{\bar{\cup }}_{\mathcal {E}}\,(\gamma \,{\bar{\cap }}_R\,\psi )(x)=(\gamma \,{\bar{\cap }}_R\,\delta )(x)\,{\bar{\cup }}_{\mathcal {E}}\,\emptyset =(\gamma \,{\bar{\cap }}_R\,\delta )(x). \end{aligned}$$
    2. (b)

      If \( x\in X\cap (Z-Y) \), then

      $$\begin{aligned} \gamma (x)\,{\bar{\cap }}_R\,(\delta \,{\bar{\cup }}_{\mathcal {E}}\,\psi )(x)=\gamma (x)\,{\bar{\cap }}_R\,\psi (x)=(\gamma \,{\bar{\cap }}_R\,\psi )(x), \end{aligned}$$

      and

      $$\begin{aligned} (\gamma \,{\bar{\cap }}_R\,\delta )(x)\,{\bar{\cup }}_{\mathcal {E}}\,(\gamma \,{\bar{\cap }}_R\,\psi )(x)=\emptyset \,{\bar{\cup }}_{\mathcal {E}}\,(\gamma \,{\bar{\cap }}_R\,\delta )(x) =(\gamma \,{\bar{\cap }}_R\,\psi )(x). \end{aligned}$$
    3. (c)

      If \( x\in X\cap (Y\cap Z) \), then for \( ({\mathfrak {u}},g_x^1)\in \gamma (x)\), \(({\mathfrak {u}},g_x^2)\in \delta (x)\) and \(({\mathfrak {u}},g_x^3)\in \psi (x) \), we have

      $$\begin{aligned} \gamma (x){\bar{\cap }}_R(\delta \,{\bar{\cup }}_{\mathcal {E}}\,\psi )(x)&=\gamma (x)\,{\bar{\cap }}_R\,(\delta \,{\bar{\cup }}_R\,\psi )(x),\\&=\langle ({\mathfrak {u}},g_x^1),\kappa ({\mathfrak {u}},g_x^1)\rangle \,{\bar{\cap }}_R\,\\&\quad \langle \big ({\mathfrak {u}},\max (g_x^2,g_x^3)\big ),\kappa ({\mathfrak {u}},g_x^2)\cup _S\kappa ({\mathfrak {u}},g_x^3)\rangle ,\\&=\langle \big ({\mathfrak {u}},\min \{g_x^1,\max (g_x^2,g_x^3)\}\big ),\\&\quad \kappa ({\mathfrak {u}},g_x^1)\cap _S\{\kappa ({\mathfrak {u}},g_x^2)\cup _S\kappa ({\mathfrak {u}},g_x^3)\}\rangle , \end{aligned}$$

      and

      $$\begin{aligned} (\gamma \,{\bar{\cap }}_R\,\delta )(x)\,{\bar{\cup }}_{\mathcal {E}}\,(\gamma \,{\bar{\cap }}_R\,\psi )(x)&=(\gamma \,{\bar{\cap }}_R\,\delta )(x)\,{\bar{\cup }}_R\,(\gamma \,{\bar{\cap }}_R\,\psi )(x),\\&=\langle \big ({\mathfrak {u}},\min (g_x^1,g_x^2)\big ),\kappa ({\mathfrak {u}},g_x^1)\cap _S\kappa ({\mathfrak {u}},g_x^2)\rangle \,{\bar{\cup }}_R\,\\&\quad \langle \big ({\mathfrak {u}},\min (g_x^2,g_x^3)\big ),\kappa ({\mathfrak {u}},g_x^2)\cap _S\kappa ({\mathfrak {u}},g_x^3)\rangle ,\\&=\langle \big ({\mathfrak {u}},\max \{min(g_x^1,g_x^2),\min (g_x^1,g_x^3)\}\big ),\\&\quad \{(\kappa ({\mathfrak {u}},g_x^1)\cap _S\kappa ({\mathfrak {u}},g_x^2))\cup _S(\kappa ({\mathfrak {u}},g_x^2)\cap _S\kappa ({\mathfrak {u}},g_x^3))\}\rangle ,\\&=\langle \big ({\mathfrak {u}},\min \{g_x^1,\max (g_x^2,g_x^3)\}\big ),\\&\quad \kappa ({\mathfrak {u}},g_x^1)\cap _S\{\kappa ({\mathfrak {u}},g_x^2)\cup _S\kappa ({\mathfrak {u}},g_x^3)\}\rangle . \end{aligned}$$

    In all three cases, we see that

    $$\begin{aligned} \gamma (x)\,{\bar{\cap }}_R\,(\delta \,{\bar{\cup }}_{\mathcal {E}}\,\psi )(x)=(\gamma \,{\bar{\cap }}_R\,\delta )(x)\,{\bar{\cup }}_{\mathcal {E}}\,(\gamma \,{\bar{\cap }}_R\,\psi )(x). \end{aligned}$$

    Hence it is proved that

    $$\begin{aligned} (\gamma ,X,N) {\bar{\cap }}_R \big ((\delta ,Y,N)\, {\bar{\cup }}_{\mathcal {E}} \,(\psi ,Z,N)\big ) = \big ((\gamma ,X,N) {\bar{\cap }}_R (\delta ,Y,N)\big )\, {\bar{\cup }}_{\mathcal {E}} \,\big ((\gamma ,X,N){\bar{\cap }}_R (\psi ,Z,N)\big ). \end{aligned}$$

    The remaining parts can be proved similarly. \(\square \)

4 Application of SFNSESs in MAGDM problems

This section provides a real-life problem-solving method based on the proposed SFNSES model. Before getting on to the application, a few new notions need to be defined as follows.

Definition 24

For a SFNSES \( (\gamma ,X,N) \) over the universe \( {\mathcal {U}} \), an associated SFSES þ \(=\,(\gamma ,X) \) is defined as

Here \(\mu _{\gamma (x)}\), \(\tau _{\gamma (x)}\) and \(\nu _{\gamma (x)}\) are the positive, neutral and negative memberships, respectively, corresponding to the parameterized opinions \( x\in X \) (with respect to the grading criteria defined for the corresponding SFNSES).

Definition 25

Consider þ \(=\,(\gamma ,X) \) be an associated SFSES over \( {\mathcal {U}} \). Let \( \lambda :X\rightarrow [0,1]^3 \) be a threshold function, such that \( \lambda (x)=({\mathfrak {p}}(x),{\mathfrak {q}}(x),{\mathfrak {r}}(x)),\,\forall \, x\in X \). Then, the level SES of þ with respect to \(\lambda \) will be a crisp SES denoted by \( {\mathcal {L}}(\)þ; \(\lambda ) \) defined as

Definition 26

The level-agree score \(\xi _j\) of an object \( {\mathfrak {u}}\in {\mathcal {U}} \) is defined as

$$\begin{aligned} \xi _j=\sum _{i}l_{ij} \end{aligned}$$

where \( l_{ij} \) is the ij-th entry of a level agree SES table.

Definition 27

The level-disagree score \(\eta _j\) of an object \( {\mathfrak {u}}\in {\mathcal {U}} \) is defined as

$$\begin{aligned} {\eta _j=n(P\times E)-\sum _{i} d_{ij}} \end{aligned}$$

where \( d_{ij} \) is the ij-th entry of a level disagree SES table, and \( n(P\times E) \) is the number of pairs in Cartesian product \( P\times E \).

Now we present an algorithm, which will be used to solve the group decision-making problems under SFNSESs.

figure a

For the above Algorithm 1, a flowchart diagram is displayed in Fig. 3.

Fig. 3
figure 3

Flowchart

We now present two applications of our proposed model and Algorithm 1 in solving different real-life-based uncertain decision-making problems.

Example 13

(Prediction of winning candidate using survey before a local election)

Elections, whether local or general, play an important role in determining the future of a community, a town, or a state. Either direct elections (by the people, for the people) or indirect elections (by the legislatives) at state and local levels prove to be very important in setting the directions for the future developments, solutions of existing and upcoming issues, and keeping the state sovereignty.

Although both direct and indirect elections have pros and cons in their manners, direct elections are much more encouraged as compared to indirect elections in most cases. One of the most important reasons is the direct decision of the people of such respective town or city or state under election, about which person or political party best meets their requirements. Unlike the indirect elections, where instead of the people’s choice, a few legislatives assign representatives to different locations, the direct elections make it better aligned with the democratic principles. Despite their disadvantages as creating logistical issues and polarizing the political systems, direct elections represent citizens equally, encourage voter turnouts and provide better democratic choices.

For either of the direct and indirect elections, various tools respective to the two types can be efficient in predicting the winners. Considering only the direct elections, various techniques like social media analysis, including the Twitter trends, critics, Facebook polls, physical and online surveys (Liu et al. 2021b; Chin and Wang 2021), and a few more, help in predicting the elections significantly.

Among these techniques, surveys are among the most accurate and inexpensive methods in forecasting election outcomes. If surveys are conducted from the appropriate samples with suitable conditions at the proper time, they prove to be consistent with the actual poll results. For example, a survey taken from the voters before a week or a month can give more accurate results as compared to a survey taken from people of any age (including under 18 or voting age) or conducted several months before the actual election. In this example, we will model a similar situation, where experts will predict the election using the survey ratings provided by the people.

Consider a direct election is to be done for electing the local representative of a town containing 8000 voters. A survey is conducted from the maximum of voters, three weeks before the actual election. In this survey, the selected voters are asked to give ratings from 0 to 4 stars to the election candidates. These star ratings are interpreted as follows:

  • ‘0 star’ for ‘Worst’;

  • ‘1 star’ for ‘Bad’;

  • ‘2 stars’ for ‘Average’;

  • ‘3 stars’ for ‘Better’;

  • ‘4 stars’ for ‘Best’.

Survey takes ratings from voters corresponding to the key-parameters \( P=\{p_1,p_2,p_3,p_4,p_5\} \), declaring how much a candidate will meet their requirements. These parameters \( p_i \,(i=1,2,\ldots ,5) \) are defined as:

  • \(p_1\)Personality How good is the candidate’s behavior towards the area’s problems? How much is his personal and political history supportive for him or her getting elected?

  • \(p_2\)Provision of facilities How much will the candidate succeed in providing the basic facilities as sanitation, health, transport, electricity, food and other utilities to the people in a good manner?

  • \(p_3\)Discipline in the area How good will the candidate manage in keeping law enforcement and peace in the area, and assure equal rights for the community?

  • \(p_4\)Development How good is his aptitude towards the development of the area, whether structural or financial?

  • \(p_5\)Local understanding How much is the candidate familiar with the local issues? Will he or she be able to keep in touch with the residents while making necessary decisions?

Consider there are four candidates as in the set \( {\mathcal {U}}=\{{\mathfrak {u}}_1,{\mathfrak {u}}_2,{\mathfrak {u}}_3,{\mathfrak {u}}_4\} \) standing for the position of local representative in the election. The voter’s ratings for the candidates corresponding to the above parameters are given in Table 27. These star ratings can be related to the natural numbers as discussed in Example 1.

Table 27 Survey outcomes

Assume there are two experts comprising the set \( E=\{r,s\} \). These experts are assigned the task by the research organization (that conducted survey) to predict the election’s outcome. The experts calculate the spherical fuzzy memberships from the survey outcomes using the same criteria as in Example 1. The resulting SF5SES is represented in Table 28.

Table 28 SF5SES \( (\gamma ,X,5) \) from survey outcomes

The experts choose the mid-level decision method for calculating the predictions. Thus for the associated SFSES þ \(=\,(\gamma ,X) \), we get the following:

From the above mid-level thresholds calculated, the mid-level soft expert set of þ is obtained as in Table 29. The mid-level agree SES and mid-level disagree SES corresponding to Table 29 are given in Tables 30 and 31, respectively.

Table 29 Mid-Level SES of þ
Table 30 Mid-level agree SES of þ
Table 31 Mid-level disagree SES of þ

At last, using the level-agree scores \( \xi _j \) and level-disagree scores \( \eta _j \) from Tables 30 and 31, respectively, the final scores \( {\mathfrak {s}}_j \) in Table 32 are enough to predict the winner of the upcoming local election.

Table 32 Final scores

From Table 32, it is predicted that \( {\mathfrak {u}}_1 \) with the maximum final score (i.e., \( {\mathfrak {s}}_1=\max ({\mathfrak {s}}_j)={4} \)) will be the new local representative of the town.

Example 14

(Ranking credibility of the smartphones using customer feedback) It is the 21st century, where almost everything is getting more and more technology-driven each day. With the ever-increasing demand and ever-revolutionizing ideas in this domain, more and more gadgets are coming into the market, dominating their predecessor technologies. Particularly when it comes to telecommunication and connectivity, smartphones prove to be one of the most engaging devices. The long-way journey from traditional telephones to the latest smartphones has made many revolutionary changes in global communication. Now, instead of relying on your computer for sending emails, taking a camera along with you for photography, and carrying a compass for keeping yourself in the right direction, you only need a smartphone with all these apps and features integrated with it. It makes smartphones more valuable as they take responsibility for many of our daily life tasks.

Today, there are numerous smartphone manufacturers making hundreds of thousands of smartphones each day. We have a variety of smartphones competing to dominate the smartphone market with their varying specifications, unique features, and elegant designs. According to the recent statistics, there had been 1.38 billion unit smartphones sales globally in 2020, comprising 1.32 billion Android smartphones. The global smartphone revenue has reached an amount of massive 409 billion US dollars. Considering such a revenue, smartphone giants like Apple, Samsung, HTC, Oppo, etc., are competing in the market by launching new smartphone models with features like foldable screens, high-resolution cameras, large memory, and super speed. However, sometimes they fail in doing good business and keeping their stance. This year, LGFootnote 3 decided to quit its smartphone business after being in continuous loss, despite its highly innovative ideas in the field. One of the main reasons is that most consumers considered many of those innovations of no use. That is, they failed somehow to keep up with their customers’ actual requirements. One example is Nokia,Footnote 4 which fell from being the World’s best mobile phone seller to completely losing it till 2013. The most important reason behind their failure was that they did not adopt the change. Instead of opting for the leading OSs like Android and IOS, they kept up with their featured phones, which led them to sell themselves to Microsoft.

The above examples indicate that customer satisfaction is one of the keys to building a business’s success, which is achievable by keeping track of the customers’ requirements and opinions. Customer feedbacks, consumer/user reviews, and product satisfaction ratings prove to be quite handy in dealing with this task. Another effective tool is sentiment analysis, which offers a deep insight into the users’ sentiments. Numerous websites, online and conventional promoting companies utilize sentiment analysis through reviews, social media, including Twitter posts, Facebook patterns, and more, to keep track of their customer’s prerequisites and interests, as well as an insight into their brand and item validity. Figure 4 represents the users’ sentiment analysis summaryFootnote 5 for iPhone 4S, iPhone 5, and iPhone 5S models.

Fig. 4
figure 4

Sentiment analysis representing sentiments on different Iphone models

Requesting for direct costumer feedbacks within the app, or product as smartphone, or as an email to the customer, can also be an important way of knowing exactly, what needs to be known. Different companies conduct customer feedback in the form of reviews, in-app surveys, and ratings. Figure 5 shows an example of an in-app customer feedbackFootnote 6 survey.

Fig. 5
figure 5

An example of in-app survey

Consider a smartphone manufacturing company launches several new smartphone models in the market. To gain an insight into its products’ credibilities and the user requirements, the company decides to conduct a costumer survey within the smartphones interfaces, three months after the launch. A prompt appears in the smartphone screen asking for users to share their experiences about their new smartphone. In this way, the company asks its customers directly for the questions, that the company oughts to be the most important feedbacks. In this customer feedback survey, each question asks for a rating from 0 to 4 stars. These star ratings are interpreted as follows:

  • ‘0 star’ for ‘extremely dissatisfactory’;

  • ‘1 star’ for ‘dissatisfactory’;

  • ‘2 stars’ for ‘average’;

  • ‘3 stars’ for ‘satisfactory’;

  • ‘4 stars’ for ‘extremely satisfactory’.

The short customer feedback survey asks for customer satisfaction ratings considering the parameters \( P=\{p_1,p_2,p_3,p_4\} \) in order to understand, which smartphones require modifications, and which ones are going well. The parameters \( p_i\,(i=1,2,3,4) \) are defined as:

  • \(p_1\)Technology Including camera, display colours, processing speed, refresh rate, and overall usage experience.

  • \(p_2\)Design Including the screen ratio, colour, dimensions, and design.

  • \(p_3\)Material Including battery, body, screen-protection etc.

  • \(p_4\)Price Suitability of the price with the service provided.

Consider there are 8 smartphones models comprising the set \( {\mathcal {U}}=\{u_1,u_2,\ldots ,u_8\} \) launched in the market. The customer feedback summary ratings are provided in Table 33. These ratings can be related to the numbers as discussed in Example 1.

Table 33 User ratings

Assume two experts as in the set \( E=\{r,s\} \) are assigned the task to process the ratings. The experts calculate the spherical fuzzy memberships from customer survey using the same standard as discussed in Example 1. A SF5SES is obtained as represented in Table 34.

Table 34 SF5SES \( (\gamma ,X,5) \) from user ratings

Using the med-level decision method, the med-level thresholds for the associated SFSES þ \(=\,(\gamma ,X) \) are calculated, and we get the following results:

From the above med-level thresholds calculated, the med-level SES of þ  is obtained as in Table 35. The med-level agree SES and med-level disagree SES corresponding to Table 35 are given in Tables 36 and 37, respectively.

Table 35 Med-level SES of þ
Table 36 Med-level agree SES of þ
Table 37 Med-level disagree SES of þ

Finally, using the level-agree scores \( \xi _j \) and level-disagree scores \( \eta _j \) from Tables 36 and 37, respectively, the final scores \( {\mathfrak {s}}_j \) in Table 38 rank the credibility of the smartphones.

Table 38 Final scores

From Table 38, company gets the ranking as \( u_6>u_8>u_2>u_1>u_4>u_3>u_5>u_7 \). Thus, the company decides to make a little bit improvements in the smartphones \( u_1,u_2,u_3,u_4 \) addressing to the respective ratings. Moreover, the company stops further production of \( u_5 \) and \( u_7 \), since they failed to meet the customer requirements. Here \( u_6 \) and \( u_8 \) came out to be the most successful and appreciated models of all the eight newly launched smartphones.

5 Comparative analysis and discussion

In this section, we provide the advantages and limitations of our model and compare the proposed model with the already existing ones, including SFSESs and NSSs.

  1. 1.

    Advantages

    Different uncertain situations require different methodologies to deal with them. In the last few decades, researchers have developed a number of uncertain models to deal with different uncertain and vague scenarios. The need for to develop more such models and their hybridization is ever increasing due to the ever-increasing problems and challenges in dealing with them. Among these models, SFSESs have proved their efficiency in dealing with uncertain spherical fuzzy information under the opinions of multiple experts. But the limitation is that the model can not deal with multinary information and deals only with data under the binary category \((N=2)\). Nowadays, in many problems, the uncertain information is based on grades and ratings, requiring methods capable of dealing with multinary information. The NSSs work well under these scenarios but are inefficient in dealing with spherical fuzzy information. This emerges the need for a new model that fills the gaps in both the above models. In this paper, we propose a novel hybrid model named SFNSESs, combining the properties of both the above models. The newly developed model can deal with spherical fuzzy data under the opinion of multiple experts based on multinary information. Thus using the model, the user can interpret the multinary category information with spherical fuzzy information under the opinion of more than one expert, hence dealing with the uncertain data more efficiently as compared to the models already developed till now.

  2. 2.

    Comparison

    When dealing with decision-making problems, both SFSESs and NSSs prove their strength in their respective domains under their different structures. SFSESs are very powerful in dealing with the uncertain fuzzy information as compared to the previous models like fuzzy SESs, intuitionistic fuzzy SESs, PyFSESs, etc. Similarly, NSSs can deal with multinary information efficiently, as in the case of ratings or grades. But both these models have limitations too. SFSESs can not deal with multinary information and therefore are restricted to only binary data. Similarly, NSSs fail to interpret the information in the spherical fuzzy form, thus not efficient enough when dealing with uncertain fuzzy data. The newly proposed model called SFNSESs not only combines the properties of the above two models but is also free of the restrictions and limitations as discussed above. To show the diversity and accuracy of our model, Tables 39 and 40 compare the results of the application (Example 13, Sect. 4) under NSSs, SFSESs, and proposed SFNSESs. From Table 39 and Fig. 6, it can be clearly seen that NSSs fail to identify the difference between the objects with the same ratings (that is, objects \({\mathfrak {u}}_1\) and \({\mathfrak {u}}_2\) have similar grades), whereas SFNSESs are capable of providing a distinction between these equally rated alternatives. Similarly, Tables 41 and 42 compare the results of the application (Example 14, Sect. 4) under NSSs, SFSESs, and proposed SFNSESs. From Table 42 and Fig. 7, it can be clearly observed that NSS model fails to identify the difference between the objects with the same ratings (that is, objects \({\mathfrak {u}}_6\) and \({\mathfrak {u}}_8\) have similar grades), whereas SFNSES model is capable of providing a distinction between these alternatives. In addition, Table 43 shows the diversity and applicability of the proposed model compared to some of the already existing models.

  3. 3.

    Limitations

    The developed model has some limitations, firstly its complicated structure having grades and spherical fuzzy information estimated by multiple experts. Due to complex calculations, it can be hard to handle the data having several alternatives or parameters and its execution during the decision-making process. Thus, despite the high applicability of the model, this model may sometimes make it more difficult to handle situations considering somewhat easier scenarios. Software like MATLAB may implement the algorithm and handle lengthy calculations, thus easing this difficulty. Secondly, the choice of thresholds for the decision-making algorithm during the decision-making may slightly affect the outcomes. Thirdly, with the addition or removal of any new parameters (or objects) in the MAGDM scenario, there may occur a variation in the optimal (or sub-optimal) objects’ ranking order. It occurs as a consequence of the independent behavior of parameters and objects. Adding to it, the proposed model is bounded to counter limited three-dimensional ambiguous information, for instance, in a scenario considering 0.8, 0.5, and 0.6 as positive, negative, and neutral membership values, respectively, the developed model fails to deal such situations, since \(0.8^2+0.5^2+0.6^2=0.64+0.25+0.36=1.25 \nless 1\).

Table 39 Comparison of final scores obtained by proposed and some existing models for the Example 13
Table 40 Comparison of ranking orders for the Example 13
Fig. 6
figure 6

Comparison between proposed SFNSESs and existing NSSs (Fatimah et al. 2018) and SFSESs (Perveen et al. 2020) on Example 13

Table 41 Comparison of final scores obtained by proposed model and some existing methods for the Example 14
Table 42 Comparison of ranking orders for the Example 13
Fig. 7
figure 7

Comparison between proposed SFNSESs and existing NSSs (Fatimah et al. 2018) and SFSESs (Perveen et al. 2020) on Example 14

Table 43 Comparing applicability with some existing models

6 Conclusions and future directions

As a powerful mathematical model for dealing with uncertainties, the SFSESs (Perveen et al. 2020) have proved their effectiveness in dealing with problems concerning uncertainties and vague information under multiple experts’ opinions. The emerging NSS model (Fatimah et al. 2018) is a strong tool when dealing with uncertainties in multinary data. The model has proved to effectively deal with various daily life problems, as illustrated in Fatimah et al. (2018). Despite their effectiveness, these models have some limitations. SFSESs fail to deal with multinary data, while NSSs cannot handle spherical fuzzy information. This paper proposes the SFNSES model, which is more applicable and accurate in several group decision-making situations. Some operations on the model, including intersections, unions, complements, AND and OR operations, are investigated with their basic properties. Our proposed idea of SFNSESs is illustrated by Example 1, in which a novel for the title ‘best novel of the year’ has to be selected based on the reader’s ratings. Two detailed applications of the model along with the algorithm are also provided in Examples 13 and 14, in which the winner of an upcoming local election and ranking credibility of the smartphones using customer feedback are respectively predicted on the basis of survey ratings and experts’ opinions in SFNSES environment. Finally, a comparison analysis is provided between the proposed model and existing decision-making tools, including NSSs and SFSESs. Some potential applications of the proposed model include market research, artificial intelligence-based product analytics, election predictions, sentiment analytics involving public sentiments, business analytics, and more. Despite the high applicability, the limitations of the model also exist due to its complicated structure, lengthy algorithm, and a massive number of alternatives and parameters. The mathematical software can help to overcome these limitations.

In the future, we are expanding our research work to (1) Complex spherical fuzzy N-soft expert sets, (2) m-Polar spherical fuzzy N-soft expert sets, and (3) Spherical fuzzy N-soft expert graphs.