New logarithmic operational laws and their applications to multiattribute decision making for single-valued neutrosophic numbers

Garg, Harish; nancy,

doi:10.1016/j.cogsys.2018.09.001

Cited by 66 publications

(42 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From the study, we conclude that the proposed approach presents a better and easier way to solve the uncertainties of real-life problems. Future research will focus on introducing the various aggregation operators to address some more complicated problems involving the Pythagorean FS [41,42] and other uncertain environments [43][44][45][46][47].…”

Section: Comparative Studymentioning

confidence: 99%

Prioritized Linguistic Interval-Valued Aggregation Operators and Their Applications in Group Decision-Making Problems

Kumar

Garg

2018

Mathematics

Self Cite

View full text Add to dashboard Cite

The linguistic interval-valued intuitionistic fuzzy (LIVIF) set is an efficient tool to represent data in the form of interval membership degrees in a qualitative rather than a quantitative manner. The LIVIF set combines the features of interval-valued intuitionistic fuzzy sets (IFSs) and the linguistic variables (LV) and hence provides more freedom to decision-makers. Under this environment, the main objective of this manuscript is to propose some new aggregation operators by capturing the prioritized relationship between the objects. For this, different weighted averaging and geometric aggregation operators are proposed in which preferences related to each object are expressed in terms of LIVIF numbers. Desirable properties of the proposed operators are studied. Further, a group decision-making (DM) approach is presented to solve the multi-attribute DM problems, and its efficiency has been verified with an illustrative example.

show abstract

Section: Comparative Studymentioning

confidence: 99%

Prioritized Linguistic Interval-Valued Aggregation Operators and Their Applications in Group Decision-Making Problems

Kumar

Garg

2018

Mathematics

Self Cite

View full text Add to dashboard Cite

show abstract

“…A Deterministic Finite Automaton for r q ⊃ r p . (2) For r p = r q , there must be < 0, 0 >∈ {< e m p , e m q >:…”

Section: A Quick Algorithm For Binary Discernibility Matrix Simplificmentioning

confidence: 99%

“…have been used. Many of significant results [1][2][3][4][5][6][7][8] have been achieved in multiple attribute decision making. Researchers in rough set theory [9] are usually concerned with attribute reduction (or feature selection) problems of multiple attribute decision making.…”

Section: Introductionmentioning

confidence: 99%

A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata

Zhang

et al. 2018

Information

View full text Add to dashboard Cite

The binary discernibility matrix, originally introduced by Felix and Ushio, is a binary matrix representation for storing discernible attributes that can distinguish different objects in decision systems. It is an effective approach for feature selection, knowledge representation and uncertainty reasoning. An original binary discernibility matrix usually contains redundant objects and attributes. These redundant objects and attributes may deteriorate the performance of feature selection and knowledge acquisition. To overcome this shortcoming, row relations and column relations in a binary discernibility matrix are defined in this paper. To compare the relationships of different rows (columns) quickly, we construct deterministic finite automata for a binary discernibility matrix. On this basis, a quick algorithm for binary discernibility matrix simplification using deterministic finite automata (BDMSDFA) is proposed. We make a comparison of BDMR (an algorithm of binary discernibility matrix reduction), IBDMR (an improved algorithm of binary discernibility matrix reduction) and BDMSDFA. Finally, theoretical analyses and experimental results indicate that the algorithm of BDMSDFA is effective and efficient.

show abstract

“…Garg and Nancy [4] developed a nonlinear programming model based on the technique for order preference by similarity to ideal solution (TOPSIS), in order to solve decision-making problems in which criterion values and their importance are given in the form of interval neutrosophic numbers (INNs). Garg and Nancy [5] presented some new operational laws called logarithm operational laws with real number base for the single-valued neutrosophic (SVN) numbers, and applied it to multiattribute decision making. In algebraic structures of BCK/BCI-algebras and semigroup, neutrosophic set theory is discussed in the papers [6][7][8][9][10][11][12][13][14][15].…”

Section: Introductionmentioning

confidence: 99%

Implicative Neutrosophic Quadruple BCK-Algebras and Ideals

et al. 2019

View full text Add to dashboard Cite

A neutrosophic set is initiated by Smarandache, and it is a novel tool to deal with vagueness considering the truth, indeterminacy and falsity memberships satisfying the condition that their sum is less than 3. The concept of neutrosophic quadruple numbers was introduced by Florentin Smarandache. Using this idea, Jun et al. introduced the notion of neutrosophic quadruple B C K / B C I -numbers, and studied neutrosophic quadruple B C K / B C I -algebras. As a continuation of Jun et al.’s paper, the notion of implicative neutrosophic quadruple B C K -algebras is introduced, and several properties are investigated. Given a set Y, conditions for the neutrosophic quadruple Y-set N q ( Y ) to be a neutrosophic quadruple B C I -algebra are provided. Conditions for the neutrosophic quadruple Y-set N q ( Y ) to be an implicative neutrosophic quadruple B C K -algebra are provided. Given subsets I and J of a B C K -algebra Y, conditions for the neutrosophic quadruple ( I , J ) -set N q ( I , J ) to be an implicative ideal of the neutrosophic quadruple B C K -algebra N q ( Y ) are discussed.

show abstract

New logarithmic operational laws and their applications to multiattribute decision making for single-valued neutrosophic numbers

Cited by 66 publications

References 45 publications

Prioritized Linguistic Interval-Valued Aggregation Operators and Their Applications in Group Decision-Making Problems

Prioritized Linguistic Interval-Valued Aggregation Operators and Their Applications in Group Decision-Making Problems

A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata

Implicative Neutrosophic Quadruple BCK-Algebras and Ideals

Contact Info

Product

Resources

About