Preprint
Article

This version is not peer-reviewed.

Neutrosophic Refined Power Mean Operator and Its Application to MADM Problems Based on Cross-Entropy Measures

Submitted:

31 May 2026

Posted:

02 June 2026

You are already at the latest version

Abstract
In real-world decision-making, constructing mathematical models is often difficult because the data are incomplete, uncertain, or even contradictory. The neutrosophic refined set provides a robust and flexible approach for effectively handling and representing these types of uncertainties. Various studies have highlighted its significant applications in decision making. In this study, a power mean operator is introduced to aggregate multiple Neutrosophic Refined Sets (NRSs) into a Single-Valued Neutrosophic Set (SVNs). The core mathematical properties of the newly introduced neutrosophic refined power mean operator are established. Moreover, two categories of neutrosophic refined cross-entropy measures are presented: one adapted from the SVNs-cross-entropy measure, and the other specifically formulated for neutrosophic refined sets. By employing the defined measures, an innovative decision making strategy is developed under the neutrosophic refined set environment. To demonstrate the effectiveness and practical relevance of the grounded strategy a numerical example based on the selection of an educational stream is solved.
Keywords: 
;  ;  ;  ;  

1. Introduction

Multi-Attribute Decision Making (MADM) denotes a decision process in which the optimal alternative is determined from a collection of feasible options considering multiple, potentially conflicting, criteria. Because decision-making information is frequently uncertain and incomplete, selecting the most suitable alternative becomes a challenging task. Zadeh was the first to formulate the Fuzzy Set (FS) [1], incorporating a degree of membership for all elements. Since then, numerous researchers have applied fuzzy set theory to various decision-making problems [2,3,4]. Later, Krassimir Atanassov [5] extended the concept of FS by introducing the Intuitionistic Fuzzy Set (IFS), which incorporates an independent degree of non-membership. IFSs have also been utilized in a wide range of decision-making scenarios [6,7]. Despite their broad applicability, FSs and IFSs are insufficient for modeling situations where the indeterminacy function (I-function) has no dependence on either the membership function (T-function) or the non-membership function (F-function). In real-world decision-making processes, indeterminacy inherently arises due to incomplete and imprecise information. To address this limitation, Smarandache [8] proposed the Neutrosophic Set (NS), in which three mutually independent functions T-function, I-function, and F-function are defined over the interval ] 0 , 1 + [ . Subsequently, wang et al. [9] introduced the Single Valued NS (SVNS) as a particular case of the NS framework, where each membership component assumes values from [ 0 , 1 ] .
Over time, this concept has proven to be effective when applied in numerous fields and practical contexts [10,11,12,13,14,15,16]. Later, the neutrosophic framework was expanded to include interval neutrosophic sets (INS) [17], in which uncertainty is described using interval-based T-, I-, and F- function. Several studies have explored applications of INSs in different domains [18,19,20,21,22,23,24]. Later, the neutrosophic framework was expanded to include INS [17], in which uncertainty is described using interval-based components of T-, I-, and F-function. Several studies have explored the applications of INSs in different domains [18,19,20,21,22,23,24].

Motivation of the Study

In particular cases, a mathematical framework that can represent repeated occurrences of elements is needed, such as the symptoms of a patient measured over different time intervals. To deal with this kind of situation, we use the concept [25]. The concept of a multiset can be found in [26]. Later, several researchers have discussed more properties and applications of multiset [27,28,29]. The concept of fuzzy bags was formally defined by Baowen et al. [30] in 1998. Miyamoto [31] defined the concepts of multisets in fuzzy environment in 2001. Later, Rocacher [32] applied fuzzy bags to build up flexible query. Shinoj and Sunil [33] developed Intuitionistic Fuzzy mMltisets (IFMs) as an extension of fuzzy multisets and proposed various associated operations. In [33] Shinoj and Sunil employed the IFMs in medical diagnosis problem. In 2013, Smarandache [34] introduced the concept of a refined NS (RNS) by further developing the components of NS.
Subsequently, numerous researchers have applied NRSs to MADM problems using various approaches [35,36,37,38,39,40]. Cross entropy measure is a popular divergence measure in recent literature that calculates the divergence of any variable from other variables. The combination of cross entropy measure techniques with several decision-making environments by a lot of researchers are stated in Table 1.
Several researchers discussed more excellent results based on the fuzzy multisets [52,53,54] and intuitionistic fuzzy multisets [55,56,57,58,59,60,61].
However, NRS is a mathematical tool to express an element by the repeated membership, indeterminacy, and falsity degrees. Table 2 shows that few studies have been performed in the environment of NRSs. However, no study has been reported in the literature so far with cross entropy measure in NRS environment despite significant advantages of cross entropy measure in the decision-making field.
Motivated by these innovative ideas, we formulated a cross-entropy measure within the NRS environment and introduced a MADM approach applicable to the educational field.

Contribution of the Study

The primary objective of this research is to develop a methodology to identify the most suitable option among a set of feasible alternatives. To accomplish this objective within a decision-making framework, an aggregation operator is first formulated in general, and its crucial properties are rigorously established. Furthermore, a sensitivity analysis is performed to show the stability and effectiveness of the grounded operator.
The principal contributions of this research are summarized as:
  • A novel concept of the power mean operator is introduced within the neutrosophic refined set (NRS) framework.
  • We systematically proved its essential mathematical properties.
  • Two distinct formulations of the CEM are proposed in the NRS Setting to quantify the degree of dissimilarity between two NRSs.
  • An MADM framework based on the proposed CEM is introduced to address issues related to DM-problems involving uncertainty and imprecision in an efficient manner.
  • Solve a real-world MADM problem using the proposed method to demonstrate its practical applicability in the current context.
  • A sensitivity analysis isperformed to explore the effect of varying the parameter q on the decision-making outcomes of the operator.

Structure of This Study

The general structure of the remaining content is presented as follows. Section-2 covers the foundational concepts of NS, SVNS, and NRS, along with basic operations on NRS. This section also introduces the neutrosophic refined power mean operator, establishes its key properties, and discusses several special cases. Section 3 presents two types of NRS-based CEM and examines their main properties. Section 4 introduces an MADM approach utilizing the power mean operator to solve MADM g problems within the NRS framework. Section 5 presents a numerical illustration to assess the effectiveness of the developed approach, while Section 6 summarizes the study and outlines the concluding observations and future research directions.

2. Preliminaries

This section briefly discusses SVNS, and NRSs, along with a description of their fundamental set-theoretic operations.
Definition 1: SVNS [9]
Let U represent a discourse universe that consists of elements (or objects), where each element in U is denoted by u , i.e., u U . An SVNS M defined in U is characterized by the T-function T M ( u ) , the I-function I M ( u ) , and the F-function F M ( u ) . Each of these functions maps the elements of U into the interval [ 0 , 1 ] , that is,
T M ( u ) , I M ( u ) , F M ( u ) : U [ 0 , 1 ] .
Consequently, SVNS M can be represented as
M = { u , ( T M ( u ) , I M ( u ) , F M ( u ) ) : u U } .
Since T M ( u ) , I M ( u ) , and F M ( u ) take values in [ 0 , 1 ] , and their sum lies:
0 T M ( u ) + I M ( u ) + F M ( u ) 3 .
For simplicity, a SVNS can be denoted as M = T , I , F , which is referred to as a single-valued neutrosophic number (SVNN). Symbolically, it is represented in the form of an SVNN.
Example 1: Consider an SVNS M defined in the universe U . Then, M can be represented as
M = { u , ( 0.8 , 0.3 , 0.4 ) : u U } .
Consequently, the corresponding SVNN is expressed as
M = 0.8 , 0.3 , 0.4 .
Definition 2:NRS [34]
Assume that U is a non-empty universe with elements denoted by u . An NRS defined in U is represented by N and expressed as
N = { u , T N 1 ( u ) , T N 2 ( u ) , , T N P ( u ) , I N 1 ( u ) , I N 2 ( u ) , , I N P ( u ) , F N 1 ( u ) , F N 2 ( u ) , , F N P ( u ) : u U } .
Each of the sequences T N 1 ( u ) , T N 2 ( u ) , , T N P ( u ) , I N 1 ( u ) , I N 2 ( u ) , , I N P ( u ) , and F N 1 ( u ) , F N 2 ( u ) , , F N P ( u ) is a mapping from U to [ 0 , 1 ] .
These sequences represent the T-function, the I-function, and the F-function, respectively.
Example 2: Assume that U = { u 1 , u 2 } is a universe and consider N as a NRS defined in U . Then, N can be written as
N = u 1 , ( 0.7 , 0.5 , 0.8 ) , ( 0.2 , 0.3 , 0.1 ) , ( 0.3 , 0.4 , 0.3 ) , u 2 , ( 0.6 , 0.6 , 0.5 ) , ( 0.4 , 0.3 , 0.3 ) , ( 0.5 , 0.4 , 0.2 ) .
The operations of NRSs described in [34] are presented below:
1.
Inclusion of NRSs
Let N 1 and N 2 be two NRSs defined in a universe U . The inclusion relation N 1 N 2 holds if and only if, for every u U and each refinement index i = 1 , 2 , , p , the following conditions are satisfied:
T N 1 i ( u ) T N 2 i ( u ) , I N 1 i ( u ) I N 2 i ( u ) , F N 1 i ( u ) F N 2 i ( u ) .
Example 3:
Consider two NRSs N 1 and N 2 on U defined as:
N 1 = { u 1 , ( 0.7 , 0.5 , 0.7 ) , ( 0.2 , 0.3 , 0.1 ) , ( 0.4 , 0.5 , 0.6 ) , u 2 , ( 0.6 , 0.6 , 0.5 ) , ( 0.7 , 0.4 , 0.5 ) , ( 0.6 , 0.7 , 0.3 ) } , N 2 = { u 1 , ( 0.8 , 0.5 , 0.9 ) , ( 0.1 , 0.2 , 0.1 ) , ( 0.3 , 0.4 , 0.3 ) , u 2 , ( 0.6 , 0.7 , 0.8 ) , ( 0.4 , 0.3 , 0.2 ) , ( 0.5 , 0.4 , 0.2 ) } .
From the inclusion condition above, it follows that N 1 N 2 .
2.
Equality of Two NRSs
Two NRSs N 1 and N 2 in U are said to be equal, denoted by N 1 = N 2 , if and only if for every u U and each i = 1 , 2 , , p ,
T N 1 i ( u ) = T N 2 i ( u ) , I N 1 i ( u ) = I N 2 i ( u ) , F N 1 i ( u ) = F N 2 i ( u ) .
3.
Complement of an NRSs
Let N be an NRS defined on the universe U . The complement of N , denoted by N c , is defined by:
N c = u , 1 T N i ( u ) , 1 I N i ( u ) , 1 F N i ( u ) | u U , i = 1 , 2 , , p .
Example 4: Let an NRS N 1 on U be expressed as:
N 1 = { u 1 , ( 0.7 , 0.5 , 0.7 ) , ( 0.2 , 0.3 , 0.1 ) , ( 0.4 , 0.5 , 0.6 ) , u 2 , ( 0.6 , 0.6 , 0.5 ) , ( 0.7 , 0.4 , 0.5 ) , ( 0.6 , 0.7 , 0.3 ) } .
Then, its complement N 1 c is obtained as:
N 1 c = { u 1 , ( 0.3 , 0.5 , 0.3 ) , ( 0.8 , 0.7 , 0.9 ) , ( 0.6 , 0.5 , 0.4 ) , u 2 , ( 0.4 , 0.4 , 0.5 ) , ( 0.3 , 0.6 , 0.5 ) , ( 0.4 , 0.3 , 0.7 ) } .
4.
Union of two NRSs
Let N 1 and N 2 be two NRSs on the universe U . They can be written as
N 1 = { u , ( T N 1 1 ( u ) , T N 1 2 ( u ) , , T N 1 p ( u ) ) , ( I N 1 1 ( u ) , I N 1 2 ( u ) , , I N 1 p ( u ) ) , ( F N 1 1 ( u ) , F N 1 2 ( u ) , , F N 1 p ( u ) ) : u U } ,
and
N 2 = { u , ( T N 2 1 ( u ) , T N 2 2 ( u ) , , T N 2 p ( u ) ) , ( I N 2 1 ( u ) , I N 2 2 ( u ) , , I N 2 p ( u ) ) , ( F N 2 1 ( u ) , F N 2 2 ( u ) , , F N 2 p ( u ) ) : u U } .
The union N 3 = N 1 N 2 is defined by
T N 3 i ( u ) = max { T N 1 i ( u ) , T N 2 i ( u ) } , I N 3 i ( u ) = min { I N 1 i ( u ) , I N 2 i ( u ) } , F N 3 i ( u ) = min { F N 1 i ( u ) , F N 2 i ( u ) } , u U , i = 1 , , p .
Example 5: Let us
N 1 = ( 0.7 , 0.5 , 0.7 ) , ( 0.2 , 0.3 , 0.1 ) , ( 0.4 , 0.5 , 0.6 ) , N 2 = ( 0.8 , 0.5 , 0.9 ) , ( 0.1 , 0.2 , 0.1 ) , ( 0.3 , 0.4 , 0.3 ) .
Then
N 1 N 2 = ( 0.8 , 0.5 , 0.9 ) , ( 0.1 , 0.2 , 0.1 ) , ( 0.3 , 0.4 , 0.3 ) .
5.
Intersection of two NRSs
Let N 1 and N 2 be two NRSs on U . Their intersection N 4 = N 1 N 2 is defined by
T N 4 i ( u ) = min { T N 1 i ( u ) , T N 2 i ( u ) } , I N 4 i ( u ) = max { I N 1 i ( u ) , I N 2 i ( u ) } , F N 4 i ( u ) = max { F N 1 i ( u ) , F N 2 i ( u ) } . u U , i = 1 , , p .

2.1. Some Operation of NRSs [34]

Assume that N 1 and N 2 are two NRss defined in the universe U . For every u U and each i = 1 , 2 , , p , the operations are described as follows:
1.
Additive operation
N 1 N 2 = T N 1 i ( u ) + T N 2 i ( u ) T N 1 i ( u ) T N 2 i ( u ) , I N 1 i ( u ) I N 2 i ( u ) , F N 1 i ( u ) F N 2 i ( u ) .
2.
Multiplicative operation
N 1 N 2 = T N 1 i ( u ) T N 2 i ( u ) , I N 1 i ( u ) + I N 2 i ( u ) I N 1 i ( u ) I N 2 i ( u ) , F N 1 i ( u ) + F N 2 i ( u ) F N 1 i ( u ) F N 2 i ( u ) .
3.
Scalar multiplication
λ N 1 = 1 1 T N 1 i ( u ) λ , I N 1 i ( u ) λ , F N 1 i ( u ) λ | λ > 0 .
4.
Scalar exponentiation
N 1 λ = T N 1 i ( u ) λ , 1 1 I N 1 i ( u ) λ , 1 1 F N 1 i ( u ) λ | λ > 0 , ( i = 1 , 2 , , p ) .
Definition 3: Neutrosophic Refined Power Mean Operator
Let NRS ( U ) denote the family of all neutrosophic refined sets on U , and let SVNS ( U ) denote the class of all SVNSs on U . Suppose that
f q : NRS ( U ) SVNS ( U )
is a mapping defined on NRS ( U ) . Then f q is called the neutrosophic refined power mean operator, and it is defined as
f q NRS ( u ) = 1 p i = 1 p T N i ( u ) q 1 q , 1 p i = 1 p I N i ( u ) q 1 q , 1 p i = 1 p F N i ( u ) q 1 q
where q 0 is a real parameter and p is a positive integer. Here, T N i ( u ) , I N i ( u ) , and F N i ( u ) denote the i th refined T-function, I-function, and F-function values of the neutrosophic refined set N .
Lemma 1. For the operator f q NRS ( u ) defined above,
f q NRS ( u ) = 1 p i = 1 p ( T N i ( u ) ) q 1 q , 1 p i = 1 p ( I N i ( u ) ) q 1 q , 1 p i = 1 p ( F N i ( u ) ) q 1 q SVNS ( U ) .
Proof. For every u U and i = 1 , 2 , , p ,
T N i ( u ) , I N i ( u ) , F N i ( u ) [ 0 , 1 ] .
Hence,
0 T N i ( u ) 1 0 ( T N i ( u ) ) q 1 ( q 0 ) .
Thus,
0 i = 1 p ( T N i ( u ) ) q p 0 1 p i = 1 p ( T N i ( u ) ) q 1 .
Therefore,
0 1 p i = 1 p ( T N i ( u ) ) q 1 q 1 .
Similarly,
0 1 p i = 1 p ( I N i ( u ) ) q 1 q 1 , 0 1 p i = 1 p ( F N i ( u ) ) q 1 q 1 .
Hence,
1 p i = 1 p ( T N i ( u ) ) q 1 q , 1 p i = 1 p ( I N i ( u ) ) q 1 q , 1 p i = 1 p ( F N i ( u ) ) q 1 q SVNS ( U ) ,
which completes the proof.
Special Cases.
Case 1.
For q = 1 , Eq. (1) simplifies to
f 1 NRS ( u ) = 1 p i = 1 p T N i ( u ) , 1 p i = 1 p I N i ( u ) , 1 p i = 1 p F N i ( u ) , u U .
Expression (2) is referred to as the arithmetic mean transformation function (AMTF).
Case 2.
For q = 0 , Eq. (1) reduces to
f 0 NRS ( u ) = T N 1 ( u ) T N p ( u ) p , I N 1 ( u ) I N p ( u ) p , F N 1 ( u ) F N p ( u ) p = i = 1 p T N i ( u ) 1 / p , i = 1 p I N i ( u ) 1 / p , i = 1 p F N i ( u ) 1 / p , u U .
Equation (3) is known as the geometric mean transformation function (GMTF).
Proof. 
To analyze the behavior of Eq. (1), we rewrite it in exponential form:
f q NRS ( u ) = 1 p i = 1 p ( T N i ( u ) ) q 1 / q , 1 p i = 1 p ( I N i ( u ) ) q 1 / q , 1 p i = 1 p ( F N i ( u ) ) q 1 / q .
By expressing each component logarithmically, we obtain
f q NRS ( u ) = exp 1 q ln 1 p i = 1 p ( T N i ( u ) ) q , exp 1 q ln 1 p i = 1 p ( I N i ( u ) ) q , exp 1 q ln 1 p i = 1 p ( F N i ( u ) ) q .
Taking the limit q 0 , L’Hospital’s rule yields
i = 1 p 1 p ln T N i ( u ) , i = 1 p 1 p ln I N i ( u ) , i = 1 p 1 p ln F N i ( u ) .
Finally, continuity of the exponential function provides
lim q 0 f q NRS ( u ) = i = 1 p T N i ( u ) p , i = 1 p I N i ( u ) p , i = 1 p F N i ( u ) p = f 0 NRS ( u ) .
Case 3.
For q = 2 , 3 , , the expression in Eq. (1) generates a sequence of higher-order refined mean operators. Specifically, for q = 2 we obtain the quadratic mean transformation function, for q = 3 the cubic mean transformation function, and similarly for all larger values of q.
Case 4.The limit as q +
lim q + f q NRS ( u ) = lim q + 1 p i = 1 p T N i ( u ) q 1 q , lim q + 1 p i = 1 p I N i ( u ) q 1 q , lim q + 1 p i = 1 p F N i ( u ) q 1 q .
Without affecting generality, suppose that the refined membership values are sorted in non-increasing sequence.
T N 1 ( u ) T N 2 ( u ) T N p ( u ) ,
I N 1 ( u ) I N 2 ( u ) I N p ( u ) ,
F N 1 ( u ) F N 2 ( u ) F N p ( u ) .
Then,
lim q + f q NRS ( u ) = T N 1 ( u ) lim q + 1 p i = 1 p T N i ( u ) T N 1 ( u ) q 1 q , I N 1 ( u ) lim q + 1 p i = 1 p I N i ( u ) I N 1 ( u ) q 1 q , F N 1 ( u ) lim q + 1 p i = 1 p F N i ( u ) F N 1 ( u ) q 1 q .
Because all normalized terms lie within [ 0 , 1 ] and the largest element dominates as q + , we obtain
lim q + f q NRS ( u ) = T N 1 ( u ) , I N 1 ( u ) , F N 1 ( u ) .
Equivalently,
lim q + f q NRS ( u ) = max { T N 1 ( u ) , , T N p ( u ) } , max { I N 1 ( u ) , , I N p ( u ) } , max { F N 1 ( u ) , , F N p ( u ) } .

3. Properties of Neutrosophic Refined Power Mean Operator

Property 1: Idempotency
If all refined T-function values { T N i ( u ) } , all refined I-function values { I N i ( u ) } , and all refined F-function values { F N i ( u ) } are constant, then the operator f q returns that same constant triple.
f q NRS ( u ) = 1 p i = 1 p ( T N i ( u ) ) q 1 q , 1 p i = 1 p ( I N i ( u ) ) q 1 q , 1 p i = 1 p ( F N i ( u ) ) q 1 q .
Proof. Assume that the refined membership sequences consist of identical values, i.e.,
T N 1 ( u ) = T N 2 ( u ) = = T N p ( u ) = T ,
I N 1 ( u ) = I N 2 ( u ) = = I N p ( u ) = I ,
F N 1 ( u ) = F N 2 ( u ) = = F N p ( u ) = F .
Then each summation in the operator becomes
1 p i = 1 p ( T N i ( u ) ) q = 1 p · p · T q = T q .
and similarly for the indeterminacy and falsity components. Thus,
f q NRS ( u ) = ( T q ) 1 q , ( I q ) 1 q , ( F q ) 1 q = T , I , F .
Hence, the operator f q is idempotent, completing the proof.
Property 2: Monotonicity
Let
N 1 = u , T N 1 i ( u ) , I N 1 i ( u ) , F N 1 i ( u ) : u U , i = 1 , 2 , , p
and
N 2 = u , T N 2 i ( u ) , I N 2 i ( u ) , F N 2 i ( u ) : u U , i = 1 , 2 , , p
be two NRSs defined on U .
Assume that N 1 N 2 componentwise, i.e.,
T N 1 i ( u ) T N 2 i ( u ) , I N 1 i ( u ) I N 2 i ( u ) , F N 1 i ( u ) F N 2 i ( u ) ,
for every i = 1 , 2 , , p and u U . Then,
f q ( N 1 ) f q ( N 2 ) .
f q NRS ( N 1 ( u ) ) = 1 p i = 1 p T N 1 i ( u ) q 1 q , 1 p i = 1 p I N 1 i ( u ) q 1 q , 1 p i = 1 p F N 1 i ( u ) q 1 q 1 p i = 1 p T N 2 i ( u ) q 1 q , 1 p i = 1 p I N 2 i ( u ) q 1 q , 1 p i = 1 p F N 2 i ( u ) q 1 q = f q NRS ( N 2 ( u ) ) .
Proof. Since
T N 1 i ( u ) T N 2 i ( u ) ,
raising both sides to the power q gives
T N 1 i ( u ) q T N 2 i ( u ) q .
Summing over i yields
i = 1 p T N 1 i ( u ) q i = 1 p T N 2 i ( u ) q ,
and hence
1 p i = 1 p T N 1 i ( u ) q 1 q 1 p i = 1 p T N 2 i ( u ) q 1 q .
Similarly, from I N 1 i ( u ) I N 2 i ( u ) and F N 1 i ( u ) F N 2 i ( u ) , we obtain
1 p i = 1 p I N 1 i ( u ) q 1 q 1 p i = 1 p I N 2 i ( u ) q 1 q ,
1 p i = 1 p F N 1 i ( u ) q 1 q 1 p i = 1 p F N 2 i ( u ) q 1 q .
Combining (6)–(8), we conclude that
f q NRS ( N 1 ( u ) ) f q NRS ( N 2 ( u ) ) .
which proves the monotonicity of the operator.
Property 3: Boundedness
Let N = NRS ( U ) be any family of neutrosophic refined sets defined on the universe U . For this collection, define the upper and lower neutrosophic bounds as
N + = max i { T N i } , min i { I N i } , min i { F N i } , N = min i { T N i } , max i { I N i } , max i { F N i } .
Then the following bound holds:
N f q NRS ( N ( u ) ) N + .
Proof.
From Properties 1 and 2, each component produced by the operator f q is bounded below by the corresponding component of N and bounded above by the corresponding component of N + . Thus,
f q NRS ( N ( u ) ) N , f q NRS ( N ( u ) ) N + ,
which directly yields
N f q NRS ( N ( u ) ) N + .

4. CEM for NRSs

Here, two distinct formulations are proposed to evaluate the CEM of NRSs. These formulations are developed by extending the concept of the CEM defined for SVNs, as introduced in [11]. For completeness, we first revisit the notion of cross-entropy within the framework of SVNs.
Definition 4: Single-valued neutrosophic CEM [11].
Let A 1 and A 2 be two SVNSs defined over the universe
U = { u 1 , u 2 , u 3 , , u n } .
The CEM between A 1 and A 2 is represented by
C E SVNS ( A 1 , A 2 ) ,
and is mathematically expressed as
C E SVNS ( A 1 , A 2 ) = 1 2 n i = 1 p [ 2 T A 1 ( u i ) T A 2 ( u i ) + 2 1 T A 1 ( u i ) 1 T A 2 ( u i ) 1 + T A 1 ( u i ) 2 + 1 + T A 2 ( u i ) 2 + 2 I A 1 ( u i ) I A 2 ( u i ) + 2 1 I A 1 ( u i ) 1 I A 2 ( u i ) 1 + I A 1 ( u i ) 2 + 1 + I A 2 ( u i ) 2 + 2 F A 1 ( u i ) F A 2 ( u i ) + 2 1 F A 1 ( u i ) 1 F A 2 ( u i ) 1 + F A 1 ( u i ) 2 + 1 + F A 2 ( u i ) 2 ]
Theorem 1:Single-valued neutrosophic CEM C E SVNS ( A 1 , A 2 ) for any two SVNSs A 1 and A 2 meets the following conditions:
  • C E SVNS ( A 1 , A 2 ) 0 , u i U .
  • C E SVNS ( A 1 , A 2 ) = 0 if and only if T A 1 ( u i ) = T A 2 ( u i ) , I A 1 ( u i ) = I A 2 ( u i ) , F A 1 ( u i ) = F A 2 ( u i ) , u i U .
  • C E S V N S ( A 1 , A 2 ) = C E S V N S ( A 1 c , A 2 c ) , u i U .
  • C E S V N S ( A 1 , A 2 ) = C E S V N S ( A 2 , A 1 ) , u i U .
Definition 5: Neutrosophic Refined CEM
Let N 1 and N 2 be any two NRSs in U = { u 1 , u 2 , u 3 , , u n } . Then, the neutrosophic refined cross-entropy between N 1 and N 2 is defined as
C E N R S ( N 1 , N 2 ) =
1 2 p i = 1 n { 2 T N 1 1 ( u i ) T N 2 1 ( u i ) 1 + T N 1 1 ( u i ) 2 + 1 + T N 2 1 ( u i ) 2 + 2 ( 1 T N 1 1 ( u i ) ) ( 1 T N 2 1 ( u i ) ) 1 + ( 1 T N 1 1 ( u i ) ) 2 + 1 + ( 1 T N 2 1 ( u i ) ) 2 + 2 T N 1 2 ( u i ) T N 2 2 ( u i ) 1 + T N 1 2 ( u i ) 2 + 1 + T N 2 2 ( u i ) 2 + 2 ( 1 T N 1 2 ( u i ) ) ( 1 T N 2 2 ( u i ) ) 1 + ( 1 T N 1 2 ( u i ) ) 2 + 1 + ( 1 T N 2 2 ( u i ) ) 2 + + 2 T N 1 p ( u i ) T N 2 p ( u i ) 1 + T N 1 p ( u i ) 2 + 1 + T N 2 p ( u i ) 2 + 2 ( 1 T N 1 p ( u i ) ) ( 1 T N 2 p ( u i ) ) 1 + ( 1 T N 1 p ( u i ) ) 2 + 1 + ( 1 T N 2 p ( u i ) ) 2 + 2 I N 1 1 ( u i ) I N 2 1 ( u i ) 1 + I N 1 1 ( u i ) 2 + 1 + I N 2 1 ( u i ) 2 + 2 ( 1 I N 1 1 ( u i ) ) ( 1 I N 2 1 ( u i ) ) 1 + ( 1 I N 1 1 ( u i ) ) 2 + 1 + ( 1 I N 2 1 ( u i ) ) 2 + + 2 F N 1 1 ( u i ) F N 2 1 ( u i ) 1 + F N 1 1 ( u i ) 2 + 1 + F N 2 1 ( u i ) 2 + 2 ( 1 F N 1 1 ( u i ) ) ( 1 F N 2 1 ( u i ) ) 1 + ( 1 F N 1 1 ( u i ) ) 2 + 1 + ( 1 F N 2 1 ( u i ) ) 2 + } .
Theorem 2:  Neutrosophic refined CEM C E N R S ( N 1 , N 2 ) for any two NRSs N 1 , N 2 satisfies the following properties:
  • C E N R S ( N 1 , N 2 ) 0 , u i U .
  • C E N R S ( N 1 , N 2 ) = 0 if and only if T N 1 i ( u i ) = T N 2 i ( u i ) , I N 1 i ( u i ) = I N 2 i ( u i ) , F N 1 i ( u i ) = F N 2 i ( u i ) , u i U .
  • C E N R S ( N 1 , N 2 ) = C E N R S ( N 1 c , N 2 c ) , u i U .
  • C E N R S ( N 1 , N 2 ) = C E N R S ( N 2 , N 1 ) , u i U .
Definition 6: Neutrosophic refined weighted CEM
Let N 1 and N 2 be two NRSs defined throughout the universe   U = { u 1 , u 2 , u 3 , , u n } . Assume that each element u i U is assigned a weight w i , forming the weight vector W = { w 1 , w 2 , , w n } , where w i [ 0 , 1 ] and i = 1 n w i = 1 . Under these assumptions, the weighted cross-entropy measure for N 1 and N 2 in the neutrosophic refined framework is defined as follows:
C E N R S W ( N 1 , N 2 ) = 1 2 p { i = 1 n w i [ ( 2 | T N 1 1 ( u i ) T N 2 1 ( u i ) | 1 + | T N 1 1 ( u i ) | 2 + 1 + | T N 2 1 ( u i ) | 2 + 2 | ( 1 T N 1 1 ( u i ) ) ( 1 T N 2 1 ( u i ) ) | 1 + | ( 1 T N 1 1 ( u i ) ) | 2 + 1 + | ( 1 T N 2 1 ( u i ) ) | 2 ) ] +
2 T N 1 2 ( u i ) T N 2 2 ( u i ) 1 + T N 1 2 ( u i ) 2 + 1 + T N 2 2 ( u i ) 2 + 2 ( 1 T N 1 2 ( u i ) ) ( 1 T N 2 2 ( u i ) ) 1 + ( 1 T N 1 2 ( u i ) ) 2 + 1 + ( 1 T N 2 2 ( u i ) ) 2 + + 2 T N 1 p ( u i ) T N 2 p ( u i ) 1 + T N 1 p ( u i ) 2 + 1 + T N 2 p ( u i ) 2 + 2 ( 1 T N 1 p ( u i ) ) ( 1 T N 2 p ( u i ) ) 1 + ( 1 T N 1 p ( u i ) ) 2 + 1 + ( 1 T N 2 p ( u i ) ) 2 + 2 I N 1 1 ( u i ) I N 2 1 ( u i ) 1 + I N 1 1 ( u i ) 2 + 1 + I N 2 1 ( u i ) 2 + 2 ( 1 I N 1 1 ( u i ) ) ( 1 I N 2 1 ( u i ) ) 1 + ( 1 I N 1 1 ( u i ) ) 2 + 1 + ( 1 I N 2 1 ( u i ) ) 2 + 2 I N 1 2 ( u i ) I N 2 2 ( u i ) 1 + I N 1 2 ( u i ) 2 + 1 + I N 2 2 ( u i ) 2 + 2 ( 1 I N 1 2 ( u i ) ) ( 1 I N 2 2 ( u i ) ) 1 + ( 1 I N 1 2 ( u i ) ) 2 + 1 + ( 1 I N 2 2 ( u i ) ) 2 + + 2 I N 1 p ( u i ) I N 2 p ( u i ) 1 + I N 1 p ( u i ) 2 + 1 + I N 2 p ( u i ) 2 + 2 ( 1 I N 1 p ( u i ) ) ( 1 I N 2 p ( u i ) ) 1 + ( 1 I N 1 p ( u i ) ) 2 + 1 + ( 1 I N 2 p ( u i ) ) 2
Theorem 3: The neutrosophic refined CEM C E NRS W ( N 1 , N 2 ) for any two N R S s N 1 , N 2 satisfies the following properties:
  • C E NRS W ( N 1 , N 2 ) 0 , u i U .
  • C E NRS W ( N 1 , N 2 ) = 0 if and only if
    T N 1 i ( u i ) = T N 2 i ( u i ) , I N 1 i ( u i ) = I N 2 i ( u i ) , F N 1 i ( u i ) = F N 2 i ( u i ) , u i U .
  • C E NRS W ( N 1 , N 2 ) = C E NRS W ( N 1 c , N 2 c ) , u i U .
  • C E NRS W ( N 1 , N 2 ) = C E NRS W ( N 2 , N 1 ) , u i U .

5. Cross Entropy Based MADM Strategy in NRS Environment Using Power Mean Operator

In this section, a systematic procedure is presented to identify the priority ranking of all available alternatives in the NRN framework. Let { A 1 S , A 2 S , , A m S } denote the collection of aspirant candidates. { C 1 S , C 2 S , , C n S } represent the set of evaluation attributes and { B 1 s , B 2 s , , B k s } be the set of alternatives available associated with each candidate.
The decision-maker evaluates each available alternative A i S ( i = 1 , 2 , , m ) with respect to each criterion that is sufficient to evaluate the alternatives are denoted by C j S ( j = 1 , 2 , , n ) employing N R S s . Moreover, the ideal performance levels of all criteria are determined by the decision-maker in the form of SVNN.
Based on the defined aggregation operators, the MADM Technique is implemented through the following steps:
Step 1: Formulation of the decision matrix (D-Matrix) relates the candidates to attributes. The relationship between each candidate A i S ( i = 1 , 2 , , m ) and each attribute C j S ( j = 1 , 2 , , n ) expressed in terms of NRS information is organized in the following matrix (denoted by M 1 ):
M 1 = Candidates - attributes neutrosophic refined decision - making matrix .
Preprints 216258 i002
Step 2: Construction of attributes–alternative D-Matrix
The association between each attribute C j S ( j = 1 , 2 , , n ) and each available alternative B t s ( t = 1 , 2 , , k ) is organized in the following form, represented by the matrix M 2 .
M 2 : Attributes versus alternatives SVN’s D-Matrix
Preprints 216258 i003
Step 3. Convert NRSs to SVNSs
Using the neutrosophic power mean operator defined in Eq. (1), we convert NRSs in M 1 to SVNSs and produce in M 3 .
M 3 : Candidates versus attributes SVNSs D-Matrix
Preprints 216258 i004
Step 4. Calculation of CE-measure values
We calculate the CE-measure values between M 2 and M 3 .
Step 5. Order the alternatives according to the results of the evaluation.
The available alternatives are prioritized according to the ascending values of the CE-measure. A lower CE-value indicates a more preferable available alternative.
Step 6. End
Figure 1. Proposed decision-making procedure.
Figure 1. Proposed decision-making procedure.
Preprints 216258 g001

6. Example: Selection of an Appropriate Educational Stream

Drawing inspiration from [38], we consider an MADM problem related to selecting an appropriate educational stream for higher studies. Choosing the right path after completing the 10+2 level is often a challenge for students and their families. In this example, we determine the preference ranking of various streams for each student using a set of evaluative attributes (see Table 3).
Step 1.Formulation of a D-Matrix between candidates and evaluation attributes.
The relationship between aspirant students and their corresponding attributes is modeled using NRSs, based on three mutually independent evaluations provided by a decision maker. The resulting triplet of relational values for each student is represented in M 4 .
Preprints 216258 i001
Step 2 . F o r m a t i o n o f a t t r i b u t e s v e r s u s a l t e r n a t i v e s D M a t r i x
The evaluation scores of the available alternatives B t s ( t = 1 , 2 , , k ) with reference to the required attributes C i ( i = 1 , 2 , , n ) are represented using SVNSs. These SVNS-based assessments are arranged in the alternatives-versus-attributes decision matrix, denoted by M 5 .
Preprints 216258 i005
Step 3. Convert NRNs to SVNN
Using the neutrosophic power mean operator defined in Eq. (1) and different values of q, we obtain the following matrices.
When q = 0 , the single valued decision matrix corresponding to the candidates versus attributes is represented in M 6 .
M 6 : Candidates versus attributes converted SVNS D-Matrix
C 1 S C 2 S C 3 S C 4 S C 5 S
A 1 S 0 . 6 , 0 . 3 , 0 . 2 0 . 5 , 0 . 2 , 0 . 2 0 . 6 , 0 . 4 , 0 . 2 0 . 7 , 0 . 3 , 0 . 4 0 . 6 , 0 . 5 , 0 . 4
A 2 S 0 . 8 , 0 . 5 , 0 . 4 0 . 5 , 0 . 5 , 0 . 2 0 . 8 , 0 . 2 , 0 . 3 0 . 6 , 0 . 6 , 0 . 3 0 . 7 , 0 . 6 , 0 . 4
A 3 S 0 . 6 , 0 . 3 , 0 . 2 0 . 6 , 0 . 1 , 0 . 2 0 . 6 , 0 . 5 , 0 . 5 0 . 7 , 0 . 5 , 0 . 2 0 . 7 , 0 . 4 , 0 . 4
When q = 1
M 7 : Candidates versus attributes converted SVNS D-Matrix
C 1 S C 2 S C 3 S C 4 S C 5 S
A 1 S 0 . 6 , 0 . 3 , 0 . 2 0 . 5 , 0 . 2 , 0 . 3 0 . 6 , 0 . 4 , 0 . 3 0 . 7 , 0 . 3 , 0 . 4 0 . 6 , 0 . 5 , 0 . 4
A 2 S 0 . 8 , 0 . 5 , 0 . 4 0 . 5 , 0 . 5 , 0 . 2 0 . 8 , 0 . 2 , 0 . 4 0 . 6 , 0 . 6 , 0 . 4 0 . 7 , 0 . 6 , 0 . 4
A 3 S 0 . 6 , 0 . 3 , 0 . 2 0 . 6 , 0 . 1 , 0 . 3 0 . 6 , 0 . 5 , 0 . 5 0 . 7 , 0 . 5 , 0 . 3 0 . 7 , 0 . 4 , 0 . 4
When q α
M 8 : Candidates versus attributes converted SVNS D-Matrix
C 1 S C 2 S C 3 S C 4 S C 5 S
A 1 S 0 . 7 , 0 . 3 , 0 . 3 0 . 6 , 0 . 2 , 0 . 4 0 . 7 , 0 . 5 , 0 . 4 0 . 7 , 0 . 4 , 0 . 4 0 . 7 , 0 . 6 , 0 . 5
A 2 S 0 . 8 , 0 . 6 , 0 . 4 0 . 6 , 0 . 6 , 0 . 3 0 . 8 , 0 . 2 , 0 . 5 0 . 6 , 0 . 7 , 0 . 5 0 . 8 , 0 . 6 , 0 . 4
A 3 S 0 . 7 , 0 . 4 , 0 . 3 0 . 6 , 0 . 2 , 0 . 4 0 . 7 , 0 . 6 , 0 . 6 0 . 8 , 0 . 6 , 0 . 5 0 . 8 , 0 . 5 , 0 . 5
Step 4. Calculation of cross entropy measure values
Using Eq. (9), we compute the cross-entropy values between M 5 and M 6 (see matrix M 9 ); M 5 and M 7 (see matrix M 10 ); and M 5 and M 8 (see matrix M 11 ). The resulting cross-entropy values are presented in the following table:
M 9 : Cross-entropy values between M 5 and M 6
Candidates Mathematics Honors ( B 1 s ) Physics Honors ( B 2 s ) Engineering ( B 3 s ) Computer Science ( B 4 s ) Biochemistry ( B 5 s )
A 1 S 1.34 2.12 1.52 1.27 1.77
A 2 S 2.26 1.54 1.59 1.39 1.46
A 3 S 1.67 2.22 1.51 1.50 1.78
M 10 : Cross entropy values between M 5 and M 7
Candidates Mathematics Honors ( B 1 s ) Physics Honors ( B 2 s ) Engineering ( B 3 s ) Computer Science ( B 4 s ) Biochemistry ( B 5 s )
A 1 S 1.41 2.06 1.18 1.42 1.62
A 2 S 2.28 1.57 1.59 1.32 1.48
A 3 S 1.68 2.22 1.34 1.58 1.78
M 11 : Cross entropy values between M 5 and M 8
Candidates Mathematics Honors ( B 1 s ) Physics Honors ( B 2 s ) Engineering ( B 3 s ) Computer Science ( B 4 s ) Biochemistry ( B 5 s )
A 1 S 1.76 2.24 1.41 1.32 1.85
A 2 S 3.01 2.12 1.70 1.86 2.31
A 3 S 2.47 2.85 1.69 2.02 2.21
Applying Eq. (10), the CE-measures between M 4 and M 5 are computed and reported in M 12 .
M 12 : Cross entropy values between M 4 and M 5
Candidates B 1 s : Mathematics Honors B 2 s : Physics Honors B 3 s : Engineering B 4 s : Computer Science B 5 s : Biochemistry
A 1 S 1.50 2.12 1.46 1.53 2.02
A 2 S 2.56 1.95 1.70 1.53 1.65
A 3 S 1.96 2.42 1.54 1.79 1.91
Step 5. Ordering of the alternatives according to the results of the evaluation.
The preference order of the available alternatives, based on the increasing values of the cross-entropy values, is given as follows (See Table 4).
Table 4 shows that, when q = 0 ,
1.
Computer Science ( B 4 s ) is the best stream for candidates A 1 S , A 2 S , and A 3 S .
When q = 1 ,
1.
Engineering ( B 3 s ) is the best stream for candidate A 1 S .
2.
Computer Science ( B 4 s ) is the best stream for the candidate A 2 S .
3.
Engineering ( B 3 s ) is the best stream for candidate A 3 S .
When q ,
1.
Computer Science ( B 4 s ) is the best stream for candidate A 1 S .
2.
Engineering ( B 3 s ) is the best stream for candidate A 2 S .
Using Eq. (11)
1.
Engineering ( B 3 s ) is the best stream for candidate A 1 S .
2.
Computer Science ( B 4 s ) is the best stream for candidate A 2 S .
3.
Engineering ( B 3 s ) is the best stream for candidate A 3 S .
Hence, we conclude that the best suitable stream for each candidate changes with the different values of q and two different cross-entropy measures. Therefore, the new operator emphasizes the judgment of uncertainty and provides more sensible and consistent results for MADM problems.

7. Conclusions

Intelligent decision-making techniques-play a crucial role when choices must be made under complex and uncertain conditions. MADM approaches, in particular, have extensive applications in advanced decision analysis. In this work, we introduce a new power mean operator within the neutrosophic refined set (NRS) framework to address MADM problems involving refined neutrosophic information.
To begin with, we formulate the power mean operator in the NRS environment and establish its fundamental properties. This operator is used to transform NRSs into single-valued neutrosophic sets (SVNSs). Additionally, we develop two types of cross-entropy measures in the NRS setting: one based on the SVNS cross-entropy measure after transformation, and the other defined directly on NRSs without requiring conversion. Using these measures, an MADM method is constructed.
An educational decision-making case study is introduced to highlight the effectiveness of the proposed approach. Owing to the significance of the introduced power mean operator, several promising research directions are anticipated. The operator is expected to be applicable in aggregating decision information and designing decision-making procedures in areas such as teacher selection [7], school choice [61], and investment planning [16], among others.

Author Contributions

All authors contributed equally.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The abbreviations employed in this manuscript are listed below:
MADA Multi-attribute decision making
CEM Cross Entropy Measure
DM Decision-making
SVNS Single valued neutrosophic set
RNSs eutrosophic refined sets

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Chou, S.Y.; Chang, Y.H.; Shen, C.Y. A fuzzy simple additive weighting system under group decision-making for facility location selection with objective/subjective attributes. Eur. J. Oper. Res. 2008, 189, 132–145. [Google Scholar] [CrossRef]
  3. Koyee, R.D.; Eisseler, R.; Schmauder, S. Application of Taguchi coupled fuzzy multi attribute decision making (FMADM) for optimizing surface quality in turning austenitic and duplex stainless steels. Measurement 2014, 58, 375–386. [Google Scholar] [CrossRef]
  4. Rao, R.V. Decision making in the manufacturing environment: Using graph theory and fuzzy multiple attribute decision making methods; Springer: London, UK, 2007. [Google Scholar]
  5. Attanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  6. Büyüközkan, G.; Göçer, F.; Karabulut, Y. A new group decision making approach with IF AHP and IF VIKOR for selecting hazardous waste carriers. Measurement 2019, 134, 66–82. [Google Scholar] [CrossRef]
  7. Pramanik, S.; Mukhopadhyaya, D. Grey relational analysis based intuitionistic fuzzy multi-criteria group decision-making approach for teacher selection in higher education. Int. J. Comput. Appl. 2011, 34, 21–29. [Google Scholar]
  8. Smarandache, F. Neutrosophy, Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, USA, 1998. [Google Scholar]
  9. Wang, H.; Smarandache, F.; Zhang, Y.; Sunderraman, R. Single valued neutrosophic sets. Multi Space Multi Struct. 2010, 4, 410–413. [Google Scholar]
  10. Abdel-Basset, M.; Mohamed, M. The role of single valued neutrosophic sets and rough sets in smart city: Imperfect and incomplete information systems. Measurement 2018, 124. [Google Scholar] [CrossRef]
  11. Pramanik, S.; Dalapati, S.; Alam, S.; Smarandache, F.; Roy, T.K. NS-cross entropy-based MAGDM under single-valued neutrosophic set environment. Information 2018, 9, 37. [Google Scholar] [CrossRef]
  12. Abdel-Basset, M.; Mohamed, M.; Zhou, Y.; Hezam, I. Multi-criteria group decision making based on neutrosophic analytic hierarchy process. J. Intell. Fuzzy Syst. 2017, 33, 4055–4066. [Google Scholar] [CrossRef]
  13. Abdel-Basset, M.; Manogaran, G.; Gamal, A.; Smarandache, F. A hybrid approach of neutrosophic sets and DEMATEL method for developing supplier selection criteria. Des. Autom. Embed. Syst. 2018, 22, 257–278. [Google Scholar] [CrossRef]
  14. Biswas, P.; Pramanik, S.; Giri, B.C. TOPSIS method for multi-attribute group decision-making under single-valued neutrosophic environment. Neural Comput. Appl. 2016, 27, 727–737. [Google Scholar] [CrossRef]
  15. Biswas, P.; Pramanik, S.; Giri, B.C. Entropy based grey relational analysis method for multi-attribute decision making under single valued neutrosophic assessments. Neutrosophic Sets Syst. 2014, 2, 102–110. [Google Scholar]
  16. Ye, J. Single valued neutrosophic cross-entropy for multicriteria decision making problems. Appl. Math. Model. 2014, 38, 1170–1175. [Google Scholar] [CrossRef]
  17. Wang, H. Interval neutrosophic sets and logic: Theory and applications in computing. Ph.D. Dissertation, Georgia State University, USA, 2006. [Google Scholar]
  18. Şahin, R. Cross-entropy measure on interval neutrosophic sets and its applications in multicriteria decision making. Neural Comput. Appl. 2017, 28, 1177–1187. [Google Scholar] [CrossRef]
  19. Wei, C.P.; Wang, P.; Zhang, Y.Z. Entropy and similarity measure of interval-valued intuitionistic fuzzy sets and their applications. Inf. Sci. 2011, 181, 4273–4286. [Google Scholar] [CrossRef]
  20. Zhang, H.Y.; Wang, J.Q.; Chen, X.H. Interval neutrosophic sets and their application in multicriteria decision making problems. Sci. World J. 2014. [Google Scholar] [CrossRef] [PubMed]
  21. Pramanik, S.; Dey, P.P.; Smarandache, F.; Ye, J. Cross entropy measures of bipolar and interval bipolar neutrosophic sets and their application for multi-attribute decision-making. Axioms 2018, 7, 21. [Google Scholar] [CrossRef]
  22. Garg, H. Non-linear programming method for multi-criteria decision-making problems under interval neutrosophic set environment. Appl. Intell. 2018, 48, 2199–2213. [Google Scholar] [CrossRef]
  23. Nie, R.X.; Wang, J.Q.; Zhang, H.Y. Solving solar-wind power station location problem using an extended weighted aggregated sum product assessment technique with interval neutrosophic sets. Symmetry 2017, 9, 106. [Google Scholar] [CrossRef]
  24. Dalapati, S.; Pramanik, S.; Alam, S.; Smarandache, F.; Roy, T.K. IN-cross entropy based MAGDM strategy under interval neutrosophic set environment. Neutrosophic Sets Syst. 2017, 18, 43–57. [Google Scholar]
  25. Yager, R.R. On the theory of bags (multi sets). Int. J. General. Syst. 1986, 13, 23–37. [Google Scholar] [CrossRef]
  26. Blizard, W.D. Multiset theory. Notre Dame J. Form. Log. 1989, 30, 36–66. [Google Scholar] [CrossRef]
  27. Girish, K.P.; John, S.J. Relations and functions in multiset context. Inf. Sci. 2009, 179, 758–768. [Google Scholar] [CrossRef]
  28. Girish, K.P.; John, S.J. Multiset topologies induced by multiset relations. Inf. Sci. 2012, 188, 298–313. [Google Scholar] [CrossRef]
  29. Jena, S.P.; Ghosh, S.K.; Tripathy, B.K. On the theory of bags and lists. Inf. Sci. 2001, 132, 241–254. [Google Scholar] [CrossRef]
  30. Baowen, L.; Peizhuang, W.; Xihui, L.; Yong, S. Fuzzy bags and relations with set-valued statistics. Comput. Math. With Appl. 1988, 15, 811–818. [Google Scholar] [CrossRef]
  31. Miyamoto, S. Fuzzy multisets and their generalizations. In Workshop on Membrane Computing; Springer: Berlin, Germany, 2000; pp. 225–235. [Google Scholar]
  32. Rocacher, D. On fuzzy bags and their application to flexible querying. Fuzzy Sets Syst. 2003, 140, 93–110. [Google Scholar] [CrossRef]
  33. Shinoj, T.K.; John, S.J. Intuitionistic fuzzy multisets and its application in medical diagnosis. World Acad. Sci. Eng. Technol. 2012, 6, 1418–1421. [Google Scholar]
  34. Smarandache, F. n-Valued refined neutrosophic logic and its applications in physics. Prog. Phys. 2013, 143–146. [Google Scholar]
  35. Broumi, S.; Deli, I. Correlation measure for neutrosophic refined sets and its application in medical diagnosis. Palest. J. Math. 2016, 5, 135–143. [Google Scholar]
  36. Ye, S.; Ye, J. Dice similarity measure between single valued neutrosophic multisets and its application in medical diagnosis. Neutrosophic Sets Syst. 2014, 6, 49–54. [Google Scholar]
  37. Karaaslan, F. Correlation coefficients of single-valued neutrosophic refined soft sets and their applications in clustering analysis. Neural Comput. Appl. 2017, 28, 2781–2793. [Google Scholar] [CrossRef]
  38. Mondal, K.; Pramanik, S. Neutrosophic refined similarity measure based on tangent function and its application to multi attribute decision making. J. New Theory 2015, 8, 41–50. [Google Scholar]
  39. Pramanik, S.; Banerjee, D.; Giri, B.C. Multi-criteria group decision making model in neutrosophic refined set and its application. Glob. J. Eng. Sci. Res. Manag. 2016, 3, 12–18. [Google Scholar]
  40. Pramanik, S.; Banerjee, D.; Giri, B.C. TOPSIS approach for multi attribute group decision making in refined neutrosophic environment. In New Trends in Neutrosophic Theory and Applications; Pons Editions: Brussels, Belgium, 2016; pp. 79–91. [Google Scholar]
  41. Shang, X.G.; Jiang, W.S. A note on fuzzy information measures. Pattern Recognit. Lett. 1997, 18, 425–432. [Google Scholar] [CrossRef]
  42. Vlachos, I.K.; Sergiadis, G.D. Intuitionistic fuzzy information applications to pattern recognition. Pattern Recognit. Lett. 2007, 28, 197–206. [Google Scholar] [CrossRef]
  43. Ye, J. Multicriteria fuzzy decision-making method based on the intuitionistic fuzzy cross-entropy. In 2009 International Conference on Intelligent Human-Machine Systems and Cybernetics; IEEE, 2009; Vol. 1, pp. 59–61. [Google Scholar]
  44. Maheshwari, S.; Srivastava, A. Application of intuitionistic fuzzy cross entropy measure in decision making for medical diagnosis. Int. J. Math. Comput. Sci. 2015, 9, 254–258. [Google Scholar]
  45. Zhang, Q.S.; Jiang, S.; Jia, B.; Luo, S. Some information measures for interval-valued intuitionistic fuzzy sets. Inf. Sci. 2010, 180, 5130–5145. [Google Scholar] [CrossRef]
  46. Ye, J. Fuzzy cross entropy of interval-valued intuitionistic fuzzy sets and its optimal decision-making method based on the weights of alternatives. Expert Syst. With Appl. 2011, 38, 6179–6183. [Google Scholar] [CrossRef]
  47. Ye, J. Single valued neutrosophic cross-entropy for multicriteria decision making problems. Appl. Math. Model. 2014, 38, 1170–1175. [Google Scholar] [CrossRef]
  48. Ye, J. Improved cross entropy measures of single valued neutrosophic sets and interval neutrosophic sets and their multicriteria decision making methods. Cybern. Inf. Technol. 2015, 15, 13–26. [Google Scholar] [CrossRef]
  49. Tian, Z.P.; Zhang, H.Y.; Wang, J.; Wang, J.Q.; Chen, X.H. Multi-criteria decision-making method based on a cross-entropy with interval neutrosophic sets. Int. J. Syst. Sci. 2016, 47, 3598–3608. [Google Scholar] [CrossRef]
  50. Wu, H.; Yuan, Y.; Wei, L.; Pei, L. On entropy, similarity measure and cross-entropy of single-valued neutrosophic sets and their application in multi-attribute decision making. Soft Comput. 2018, 22, 7367–7376. [Google Scholar] [CrossRef]
  51. Pramanik, S.; Dalapati, S.; Alam, S.; Smarandache, F.; Roy, T.K. NC-cross entropy based MADM strategy in neutrosophic cubic set environment. Mathematics 2018, 6, 67. [Google Scholar] [CrossRef]
  52. Syropoulos, A. On generalized fuzzy multisets and their use in computation. Int. J. Fuzzy Syst. 2012, 9, 113–125. [Google Scholar]
  53. Thomas, A.S.; John, S.J. Multi-fuzzy rough sets and relations. Ann. Fuzzy Math. Inform. 2014, 7, 807–815. [Google Scholar]
  54. Muthuraj, R.; Balamurugan, S. Multi-fuzzy group and its level subgroups. General. Math. Notes 2013, 17, 74–81. [Google Scholar]
  55. Ejegwa, P.A.; Awolola, J.A. Intuitionistic fuzzy multiset (IFMS) in binomial distributions. Int. J. Sci. Technol. Res. 2014, 3, 335–337. [Google Scholar]
  56. Rajarajeswari, P.; Uma, N. On distance and similarity measures of intuitionistic fuzzy multi set. IOSR J. Math. 2013, 5, 19–23. [Google Scholar] [CrossRef]
  57. Rajarajeswari, P.; Uma, N. A study of normalized geometric and normalized Hamming distance measures in intuitionistic fuzzy multi sets. Int. J. Eng. Sci. Res. Technol. 2013, 2, 76–80. [Google Scholar]
  58. Rajarajeswari, P.; Uma, N. Intuitionistic fuzzy multi relations. Int. J. Math. Arch. 2013, 4, 244–249. [Google Scholar]
  59. Rajarajeswari, P.; Uma, N. Zhang and Fu’s similarity measure on intuitionistic fuzzy multi sets. Int. J. Innov. Res. Sci. Eng. Technol. 2014, 3, 12309–12317. [Google Scholar]
  60. Rajarajeswari, P.; Uma, N. Correlation measure for intuitionistic fuzzy multi sets. Int. J. Res. Eng. Technol. 2014, 3, 611–617. [Google Scholar] [CrossRef]
  61. Mondal, K.; Pramanik, S. Neutrosophic decision making model of school choice. Neutrosophic Sets Syst. 2015, 7, 62–68. [Google Scholar]
  62. Ye, J.; Du, S.; Yong, R.; Zhang, F. Arccosine and arctangent similarity measures of refined simplified neutrosophic indeterminate sets and their multicriteria decision-making method. J. Intell. Fuzzy Syst. 2021, 40, 9159–9171. [Google Scholar] [CrossRef]
  63. Tan, R.P.; Zhang, W.D. Decision-making method based on new entropy and refined single-valued neutrosophic sets and its application in typhoon disaster assessment. Appl. Intell. 2021, 51, 283–307. [Google Scholar] [CrossRef]
  64. Fan, C. Correlation coefficients of refined single valued neutrosophic sets and their applications in multiple attribute decision-making. J. Adv. Comput. Intell. Intell. Inform. 2019, 23, 421–426. [Google Scholar] [CrossRef]
  65. Karaaslan, F. Multicriteria decision-making method based on similarity measures under single-valued neutrosophic refined and interval neutrosophic refined environments. Int. J. Intell. Syst. 2018, 33, 928–952. [Google Scholar] [CrossRef]
Table 1. Cross entropy measure literature review other than NRSs environment.
Table 1. Cross entropy measure literature review other than NRSs environment.
Papers Applied Techniques Environment
Shang and Jiang [41] Cross Entropy Measure ( CEM ) FS
Vlachos and Sergiadis [42] , , IFS
Ye [43] , , IFS
Maheshwari and Srivastava [44] , , IFS
Zhang et al. [45] , , Interval-IFS
Ye [46] , , interval-IFS
Ye [47] , , SVNSs
Wu et al. [50] , , SVNSs
Ye [48] , , SVNSs
Pramanik et al. [11] , , SVNSs
Tian et al. [49] , , INSs
Sahin [18] , , INSs
Dalapati et al. [24] , , INSs
Pramanik et al. [51] , , NCSs
Table 2. NRSs decision making process literature review.
Table 2. NRSs decision making process literature review.
Papers Applied Techniques Environment
Broumi and Deli [35] Correlation measure NRSs
Ye and Ye [36] Dice similarity measure ,,
Karaaslan [37] Correlation coefficient measure ,,
Mondal and Pramanik [38] Cotangent similarity measure ,,
Pramanik et al. [39,40] Decision making strategy ,,
Ye [62] Arctangent similarity measures ,,
Tan [63] New entropy measure ,,
Fan [64] Correlation coefficients ,,
Karaaslan [65] Similarity measures ,,
Table 3. Description of aspirant students, their required attributes, and higher educational available streams.
Table 3. Description of aspirant students, their required attributes, and higher educational available streams.
Candidates (Symbol) Description
A 1 S A 2 S A 3 S These are three students of Rahara Ramakrishna Mission Boys’ Home (India). They have completed their basic course (10+2 level).
Attributes (Symbol)                Description
C 1 S Proficiency in both English and Bengali languages
C 2 S Depth in Mathematics and basic computers knowledge
C 3 S In-depth understanding of scientific disciplines.
C 4 S Concentration
C 5 S Laborious
Educational Streams (Symbol)                Description
B 1 s Mathematics Honors
B 2 s Physics Honors
B 3 s Engineering
B 4 s ComputerScience
B 5 s Biochemistry
Table 4. Ranking order of alternatives.
Table 4. Ranking order of alternatives.
Values of q Candidates Priority ranking order of streams
q = 0 A 1 S B 4 s B 1 s B 3 s B 5 s B 2 s
A 2 S B 4 s B 5 s B 2 s B 3 s B 1 s
A 3 S B 4 s B 3 s B 1 s B 5 s B 2 s
q = 1 A 1 S B 3 s B 1 s B 4 s B 5 s B 2 s
A 2 S B 4 s B 5 s B 2 s B 3 s B 1 s
A 3 S B 3 s B 4 s B 1 s B 5 s B 2 s
q A 1 S B 4 s B 3 s B 1 s B 5 s B 2 s
A 2 S B 3 s B 4 s B 2 s B 5 s B 1 s
A 3 S B 3 s B 4 s B 5 s B 1 s B 2 s
Using Eq. (10) A 1 S B 3 s B 1 s B 4 s B 5 s B 2 s
A 2 S B 4 s B 5 s B 3 s B 2 s B 1 s
A 3 S B 3 s B 4 s B 5 s B 1 s B 2 s
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings