While vendors on the Internet may have enjoyed an increase in the number of clicks on their Web sites, they have also faced disappointments in converting these clicks into purchases. Lack of trust is identified as one of the greatest barriers inhibiting Internet transactions. Thus, it is essential to understand how trust is created and how it evolves in the Electronic Commerce (EC) context thro...

Based on previous results that study the completion of fuzzy metric spaces, we show that every intuitionistic fuzzy quasi-metric space, using the notion of fuzzy metric space in the sense of Kramosil and Michalek to obtain a generalization to the quasi-metric setting, has a bicompletion which is unique up to isometry.

In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of graph preserving mappings in parametric $N_b$-metric spaces. As some consequences of this study, we obtain several important results in parametric $b$-metric spaces, parametric $S$-metric spaces and parametric $A$-metric spaces. Finally, we provide some illustrative examples to ...

In this paper, we prove the existence of fixed point for Chatterjea type mappings under $c$-distance in cone metric spaces endowed with a graph. The main results extend, generalized and unified some fixed point theorems on $c$-distance in metric and cone metric spaces.

In this paper we consider the so called a vector metric space, which is a generalization of metric space, where the metric is Riesz space valued. We prove some common fixed point theorems for three mappings in this space. Obtained results extend and generalize well-known comparable results in the literature.

In association rule mining, interestingness refers to metrics that are applied to select association rules, beyond support and confidence. For example, Merceron & Yacef (2008) recommend that researchers use a combination of lift and cosine to select association rules, after first filtering out rules with low support and confidence. However, the empirical basis for considering these specific met...

‎The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$‎. ‎In this case‎, ‎$B$ is called a textit{metric basis} for $G$‎. ‎The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$‎. ‎Givi...