Z-numbers were introduced by Zadeh in 2011 as a pair of fuzzy numbers (A, B), where A is interpreted as a fuzzy restriction on the values of a variable, while B is interpreted as a measure of certainty or sureness of A. From the initial proposal, several other approaches have been introduced in order to reduce the computational cost of the involved operations. One of such approaches is called discrete Z-numbers where A and B are modelled as discrete fuzzy numbers. In this paper, the construction of total orders on the set of discrete Z-numbers is investigated for the first time. Specifically, the total order is designed for discrete Z-numbers where the second component has membership values belonging to a finite and prefixed set of values. The method relies on solid and coherent linguistic criteria and several linguistic properties are analyzed. The order involves the transformation of the first components of the discrete Z-numbers by using the credibility of the second components in the sense that a lower credibility enlarges in a greater extent the uncertainty of the first component. Then a total order on the set of discrete fuzzy numbers is applied. Finally, a practical example on how to order discrete Z-numbers is presented and a comparison with other ranking methods is performed from which the strengths of our method are stressed.
Partial metrics have been shown to be useful dissimilarity measures when incomplete information, partial states, or inherent uncertainty is involved. The main characteristic of this kind of distance is allowing non-zero self-distances. This distinctive property makes them particularly appropriate for applications in computer science, artificial intelligence, pattern recognition and bioinformatics. Nevertheless, in these fields, it is often more relevant to quantify the amount of shared information between objects rather than their dissimilarity. In this context, similarity metrics have proven to be a valuable tool. The literature has suggested the existence of a duality relationship between partial metrics and similarity metrics. In this paper, we investigate such a relationship. Specifically, we focus on identifying the properties of functions that induce a similarity metric from a partial metric in the sense of O’Neill. We provide a characterization of these functions, showing that they coincide with the class of strictly decreasing and convex functions on the set of non-negative real numbers. We also show that these functions preserve the topology and the partial order, that is, the partial order and topology generated by the induced similarity metric and by the original partial metric are the same. In addition, we characterize the class of functions capable of generating an O’Neill partial metric from a similarity metric, showing that such a class is formed by strictly decreasing and concave functions on the set of real numbers. In this case, we also show that the partial orders and the topologies generated by the induced partial metric and by the original similarity metric coincide. The results are supported and clarified by appropriate examples.