Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- CPM (1)
- Communication (1)
- Computation (1)
- Construction (1)
- Decision making (1)
-
- Double Refined Indeterminacy (1)
- Entropy (1)
- Interval valued neutrosophic graph; Generalized Interval valued neutrosophic graphs of first type; Matrix representation. (1)
- K-NN; Fuzzy k-NN; neutrosophic sets; data classification (1)
- Lattice theoretic (1)
- N-Refined Indeterminacy (1)
- Neutrosophic Sets (1)
- Neutrosophic logic (1)
- Neutrosophic sets; trapezoidal neutrosophic sets; shortest path problem; score function (1)
- Operation (1)
- Project Management (1)
- Refined Neutrosophic Set (1)
- Score and Accuracy Functions (1)
- Single valued triangular neutrosophic number; score function function; network network; shortest shortest path problem (1)
- Technology of information (1)
Articles 1 - 8 of 8
Full-Text Articles in Engineering
Ns-K-Nn: Neutrosophic Set-Based K-Nearest Neighbors Classifier, Florentin Smarandache, Yaman Akbulut, Abdulkadir Sengur, Yanhui Guo
Ns-K-Nn: Neutrosophic Set-Based K-Nearest Neighbors Classifier, Florentin Smarandache, Yaman Akbulut, Abdulkadir Sengur, Yanhui Guo
Branch Mathematics and Statistics Faculty and Staff Publications
k-nearest neighbors (k-NN), which is known to be a simple and efficient approach, is a non-parametric supervised classifier. It aims to determine the class label of an unknown sample by its k-nearest neighbors that are stored in a training set. The k-nearest neighbors are determined based on some distance functions. Although k-NN produces successful results, there have been some extensions for improving its precision. The neutrosophic set (NS) defines three memberships namely T, I and F. T, I, and F shows the truth membership degree, the false membership degree, and the indeterminacy membership degree, respectively. In this paper, the NS …
A Critical Path Problem Using Triangular Neutrosophic Number, Florentin Smarandache, Mai Mohamed, Yongquan Zhou, Mohamed Abdel-Baset
A Critical Path Problem Using Triangular Neutrosophic Number, Florentin Smarandache, Mai Mohamed, Yongquan Zhou, Mohamed Abdel-Baset
Branch Mathematics and Statistics Faculty and Staff Publications
The Critical Path Method (CPM) is one of several related techniques for planning and managing of complicated projects in real world applications. In many situations, the data obtained for decision makers are only approximate, which gives rise of neutrosophic critical path problem. In this paper, the proposed method has been made to find the critical path in network diagram, whose activity time uncertain. The vague parameters in the network are represented by triangular neutrosophic numbers, instead of crisp numbers. At the end of paper, two illustrative examples are provided to validate the proposed approach.
Shortest Path Problem Under Trapezoidal Neutrosophic Information, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali
Shortest Path Problem Under Trapezoidal Neutrosophic Information, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali
Branch Mathematics and Statistics Faculty and Staff Publications
In this research paper, a new approach is proposed for computing the shortest path length from source node to destination node in a neutrosophic environment. The edges of the network are assigned by trapezoidal fuzzy neutrosophic numbers. A numerical example is provided to show the performance of the proposed approach.
Multicriteria Decision Making Using Double Refined Indeterminacy Neutrosophic Cross Entropy And Indeterminacy Based Cross Entropy, Ilanthenral Kandasamy, Florentin Smarandache
Multicriteria Decision Making Using Double Refined Indeterminacy Neutrosophic Cross Entropy And Indeterminacy Based Cross Entropy, Ilanthenral Kandasamy, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Double Refined Indeterminacy Neutrosophic Set (DRINS) is an inclusive case of the refined neutrosophic set, defined by Smarandache [1], which provides the additional possibility to represent with sensitivity and accuracy the uncertain, imprecise, incomplete, and inconsistent information which are available in real world.
More precision is provided in handling indeterminacy; by classifying indeterminacy (I) into two, based on membership; as indeterminacy leaning towards truth membership (IT ) and indeterminacy leaning towards false membership (IF ). This kind of classification of indeterminacy is not feasible with the existing Single Valued Neutrosophic Set (SVNS), but it is a particular case of the …
An Operational View In Computational Construction Of Information, Florentin Smarandache, Stefan Vladutescu, Constantin Dima, Valeriu Voinea
An Operational View In Computational Construction Of Information, Florentin Smarandache, Stefan Vladutescu, Constantin Dima, Valeriu Voinea
Branch Mathematics and Statistics Faculty and Staff Publications
The paper aims to explain the technology of emergence of information. Our research proves that information as communicational product is the result of processing within some operations, actions, mechanisms and strategies of informational material meanings. Are determined eight computational-communicative operations of building information. Information occurs in two communication phases, syncretic and the segregation-synthetic. The syncretic phase consists of four operations: referral of significant field, primary delimitation of information, detection-looking information and an anticipative-draft constitution (feedforward). The segregation-synthetic phase also includes four operations: discrimination, identification, interpretation and confrontation (feedback). In the future we will investigate informational actions, mechanisms and strategies.
A Lattice Theoretic Look: A Negated Approach To Adjectival (Intersective, Neutrosophic And Private) Phrases, Florentin Smarandache, Selcuk Topal
A Lattice Theoretic Look: A Negated Approach To Adjectival (Intersective, Neutrosophic And Private) Phrases, Florentin Smarandache, Selcuk Topal
Branch Mathematics and Statistics Faculty and Staff Publications
No abstract provided.
Generalized Interval Valued Neutrosophic Graphs Of First Type, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali, Ali Hassan
Generalized Interval Valued Neutrosophic Graphs Of First Type, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali, Ali Hassan
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper, motivated by the notion of generalized single valued neutrosophic graphs of first type, we defined a new neutrosophic graphs named generalized interval valued neutrosophic graphs of first type (GIVNG1) and presented a matrix representation for it and studied few properties of this new concept. The concept of GIVNG1 is an extension of generalized fuzzy graphs (GFG1) and generalized single valued neutrosophic of first type (GSVNG1).
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.