Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- DSmT (4)
- Information fusion (3)
- Belief functions (2)
- Bayes rule (1)
- Belief function (1)
-
- Complexity reduction (1)
- Conditioning (1)
- Conjunctive rule (1)
- Counter-examples to Dempster rule (1)
- Counterexamples to Conjunctive rule (1)
- DST (1)
- Deconditioning (1)
- Dempster rule (1)
- Dijkstra’s algorithm; Single valued neutrosophic number; Shortest path problem; Network (1)
- Distance (1)
- Fuzzy sets (1)
- Fuzzy soft sets (1)
- Integrity constraints (1)
- Intelligent algorithm (1)
- Intuitionistic fuzzy sets (1)
- Intuitionistic fuzzy soft sets (1)
- Lattice (1)
- Matrices (1)
- Measure of similarity (1)
- Network analysis (1)
- Neutrosophic Logic (1)
- Neutrosophic logic; indeterminacy; indeterminate model; indeterminate element; indeterminate mass; indeterminate fusion rules; DSmT; DST; TBM (1)
- Neutrosophic network analysis (1)
- Probability (1)
- Robot perception (1)
Articles 1 - 11 of 11
Full-Text Articles in Other Mathematics
A Novel Framework Using Neutrosophy For Integrated Speech And Text Sentiment Analysis, Florentin Smarandache, Kritika Mishra, Ilanthenral Kandasamy, Vasantha Kandasamy W.B.
A Novel Framework Using Neutrosophy For Integrated Speech And Text Sentiment Analysis, Florentin Smarandache, Kritika Mishra, Ilanthenral Kandasamy, Vasantha Kandasamy W.B.
Branch Mathematics and Statistics Faculty and Staff Publications
With increasing data on the Internet, it is becoming difficult to analyze every bit and make sure it can be used efficiently for all the businesses. One useful technique using Natural Language Processing (NLP) is sentiment analysis. Various algorithms can be used to classify textual data based on various scales ranging from just positive-negative, positive-neutral-negative to a wide spectrum of emotions. While a lot of work has been done on text, only a lesser amount of research has been done on audio datasets. An audio file contains more features that can be extracted from its amplitude and frequency than a …
Intelligent Algorithm For Trapezoidal Interval Valued Neutrosophic Network Analysis, Florentin Smarandache, Said Broumi, Deivanayagampillai Nagarajan, Malayalan Lathamaheswari, Mohamed Talea, Assia Bakali
Intelligent Algorithm For Trapezoidal Interval Valued Neutrosophic Network Analysis, Florentin Smarandache, Said Broumi, Deivanayagampillai Nagarajan, Malayalan Lathamaheswari, Mohamed Talea, Assia Bakali
Branch Mathematics and Statistics Faculty and Staff Publications
The shortest path problem has been one of the most fundamental practical problems in network analysis. One of the good algorithms is Bellman-Ford, which has been applied in network, for the last some years. Due to complexity in the decision-making process, the decision makers face complications to express their view and judgment with an exact number for single valued membership degrees under neutrosophic environment. Though the interval number is a special situation of the neutrosophic, it did not solve the shortest path problems in an absolute manner. Hence, in this work, the authors have introduced the score function and accuracy …
Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea
Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea
Branch Mathematics and Statistics Faculty and Staff Publications
In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.
Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem, Florentin Smarandache, Luige Vladareanu, Said Broumi, Assia Bakali, Muhammad Akram
Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem, Florentin Smarandache, Luige Vladareanu, Said Broumi, Assia Bakali, Muhammad Akram
Branch Mathematics and Statistics Faculty and Staff Publications
The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.
New Operations On Intuitionistic Fuzzy Soft Sets Based On First Zadeh's Logical Operators, Florentin Smarandache, Said Broumi, Pinaki Majumdar
New Operations On Intuitionistic Fuzzy Soft Sets Based On First Zadeh's Logical Operators, Florentin Smarandache, Said Broumi, Pinaki Majumdar
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper , we have defined First Zadeh’s implication , First Zadeh’s intuitionistic fuzzy conjunction and intuitionistic fuzzy disjunction of two intuitionistic fuzzy soft sets and some their basic properties are studied with proofs and examples.
Examples Where The Conjunctive And Dempster’S Rules Are Insensitive, Florentin Smarandache, Jean Dezert, Valeri Kroumov
Examples Where The Conjunctive And Dempster’S Rules Are Insensitive, Florentin Smarandache, Jean Dezert, Valeri Kroumov
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we present several counter-examples to the Conjunctive rule and to Dempster rule of combinations in information fusion.
Extended Pcr Rules For Dynamic Frames, Florentin Smarandache, Jean Dezert
Extended Pcr Rules For Dynamic Frames, Florentin Smarandache, Jean Dezert
Branch Mathematics and Statistics Faculty and Staff Publications
In most of classical fusion problems modeled from belief functions, the frame of discernment is considered as static. This means that the set of elements in the frame and the underlying integrity constraints of the frame are fixed forever and they do not change with time. In some applications, like in target tracking for example, the use of such invariant frame is not very appropriate because it can truly change with time. So it is necessary to adapt the Proportional Conflict Redistribution fusion rules (PCR5 and PCR6) for working with dynamical frames. In this paper, we propose an extension of …
Neutrosophic Masses & Indeterminate Models Applications To Information Fusion, Florentin Smarandache
Neutrosophic Masses & Indeterminate Models Applications To Information Fusion, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we introduce the indeterminate models in information fusion, which are due either to the existence of some indeterminate elements in the fusion space or to some indeterminate masses. The best approach for dealing with such models is the neutrosophic logic.
Evidence Supporting Measure Of Similarity For Reducing The Complexity In Information Fusion, Xinde Li, Jean Dezert, Florentin Smarandache, Xinhan Huang
Evidence Supporting Measure Of Similarity For Reducing The Complexity In Information Fusion, Xinde Li, Jean Dezert, Florentin Smarandache, Xinhan Huang
Branch Mathematics and Statistics Faculty and Staff Publications
This paper proposes a new solution for reducing the number of sources of evidence to be combined in order to diminish the complexity of the fusion process required in some applications where the real-time constraint and strong computing resource limitation are of prime importance. The basic idea consists in selecting, among the whole set of sources of evidence, only the biggest subset of sources which are not too contradicting based on a criterion of Evidence Supporting Measure of Similarity (ESMS) in order to process solely the coherent information received. The ESMS criterion serves actually as a generic tool for outlier …
Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache
Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper, we present a Non-Bayesian conditioning rule for belief revision. This rule is truly Non-Bayesian in the sense that it doesn’t satisfy the common adopted principle that when a prior belief is Bayesian, after conditioning by X, Bel(X|X) must be equal to one. Our new conditioning rule for belief revision is based on the proportional conflict redistribution rule of combination developed in DSmT (Dezert-Smarandache Theory) which abandons Bayes’ conditioning principle. Such Non-Bayesian conditioning allows to take into account judiciously the level of conflict between the prior belief available and the conditional evidence. We also introduce the deconditioning problem …
Super Special Codes Using Super Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Super Special Codes Using Super Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes. This book has four chapters. In chapter one basic properties of codes and super matrices are given. A new type of super special vector space is constructed in chapter two of this book. Three new classes of super special codes namely, super special row code, super special column code and super special codes are introduced in chapter three. Applications of these …