scholarly journals INDUCED AND LOGARITHMIC DISTANCES WITH MULTI-REGION AGGREGATION OPERATORS

2019 ◽  
Vol 0 (0) ◽  
pp. 1-29 ◽  
Author(s):  
Víctor G. Alfaro-García ◽  
José M. Merigó ◽  
Leobardo Plata-Pérez ◽  
Gerardo G. Alfaro-Calderón ◽  
Anna M. Gil-Lafuente

This paper introduces the induced ordered weighted logarithmic averaging IOWLAD and multiregion induced ordered weighted logarithmic averaging MR-IOWLAD operators. The distinctive characteristic of these operators lies in the notion of distance measures combined with the complex reordering mechanism of inducing variables and the properties of the logarithmic averaging operators. The main advantage of MR-IOWLAD operators is their design, which is specifically thought to aid in decision-making when a set of diverse regions with different properties must be considered. Moreover, the induced weighting vector and the distance measure mechanisms of the operator allow for the wider modeling of problems, including heterogeneous information and the complex attitudinal character of experts, when aiming for an ideal scenario. Along with analyzing the main properties of the IOWLAD operators, their families and specific cases, we also introduce some extensions, such as the induced generalized ordered weighted averaging IGOWLAD operator and Choquet integrals. We present the induced Choquet logarithmic distance averaging ICLD operator and the generalized induced Choquet logarithmic distance averaging IGCLD operator. Finally, an illustrative example is proposed, including real-world information retrieved from the United Nations World Statistics for global regions.

Author(s):  
Fanyong Meng ◽  
Yige Yuan ◽  
Xiaohong Chen

Interval-valued linguistic variables are efficient tools to express the decision makers’ uncertain qualitative judgments. Considering the application of interval-valued linguistic variables, this paper proposes an interval distance measure, which is then used to define interval-valued linguistic interval distance measures by combining the 2-tuple linguistic representation model. To reflect the interactions between elements in a set, three correlative interval distance measures on intervalvalued linguistic variables are proposed. Meanwhile, several models designed to obtain the optimal weighting vector are constructed. After that, an approach to pattern recognition and to multi-attribute decision making with interval-valued linguistic information is developed. Meanwhile, associated examples are offered to demonstrate the concrete application of the proposed procedure.


Mathematics ◽  
2021 ◽  
Vol 9 (16) ◽  
pp. 1892
Author(s):  
Rodrigo Gómez Monge ◽  
Evaristo Galeana Figueroa ◽  
Víctor G. Alfaro-García ◽  
José M. Merigó ◽  
Ronald R. Yager

Variance, as a measurement of dispersion, is a basic component of decision-making processes. Recent advances in intelligent systems have included the concept of variance in information fusion techniques for decision-making under uncertainty. These dispersion measures broaden the spectrum of decision makers by extending the toolset for the analysis and modeling of problems. This paper introduces some variance logarithmic averaging operators, including the variance generalized ordered weighted averaging (Var-GOWLA) operator and the induced variance generalized ordered weighted averaging (Var-IGOWLA) operator. Moreover, this paper analyzes some properties, families and particular cases of the proposed operators. Finally, an illustrative example of the characteristic design of the operators is proposed using real-world information retrieved from financial markets. The objective of this paper is to analyze the performance of some equities based on the expected payoff and the dispersion of its elements. Results show that the equity payoff results present diverse rankings combined with the proposed operators, and the introduced variance measures aid decision-making by offering new tools for information analysis. These results are particularly interesting when selecting logarithmic averaging operators for decision-making processes. The approach presented in this paper extends the available tools for decision-making under ignorance, uncertainty, and subjective environments.


Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 436
Author(s):  
Ruirui Zhao ◽  
Minxia Luo ◽  
Shenggang Li

Picture fuzzy sets, which are the extension of intuitionistic fuzzy sets, can deal with inconsistent information better in practical applications. A distance measure is an important mathematical tool to calculate the difference degree between picture fuzzy sets. Although some distance measures of picture fuzzy sets have been constructed, there are some unreasonable and counterintuitive cases. The main reason is that the existing distance measures do not or seldom consider the refusal degree of picture fuzzy sets. In order to solve these unreasonable and counterintuitive cases, in this paper, we propose a dynamic distance measure of picture fuzzy sets based on a picture fuzzy point operator. Through a numerical comparison and multi-criteria decision-making problems, we show that the proposed distance measure is reasonable and effective.


Mathematics ◽  
2018 ◽  
Vol 6 (12) ◽  
pp. 280 ◽  
Author(s):  
Harish Garg ◽  
Gagandeep Kaur

Probabilistic dual hesitant fuzzy set (PDHFS) is an enhanced version of a dual hesitant fuzzy set (DHFS) in which each membership and non-membership hesitant value is considered along with its occurrence probability. These assigned probabilities give more details about the level of agreeness or disagreeness. By emphasizing the advantages of the PDHFS and the aggregation operators, in this manuscript, we have proposed several weighted and ordered weighted averaging and geometric aggregation operators by using Einstein norm operations, where the preferences related to each object is taken in terms of probabilistic dual hesitant fuzzy elements. Several desirable properties and relations are also investigated in details. Also, we have proposed two distance measures and its based maximum deviation method to compute the weight vector of the different criteria. Finally, a multi-criteria group decision-making approach is constructed based on proposed operators and the presented algorithm is explained with the help of the numerical example. The reliability of the presented decision-making method is explored with the help of testing criteria and by comparing the results of the example with several prevailing studies.


2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Shumpei Haginoya ◽  
Aiko Hanayama ◽  
Tamae Koike

Purpose The purpose of this paper was to compare the accuracy of linking crimes using geographical proximity between three distance measures: Euclidean (distance measured by the length of a straight line between two locations), Manhattan (distance obtained by summing north-south distance and east-west distance) and the shortest route distances. Design/methodology/approach A total of 194 cases committed by 97 serial residential burglars in Aomori Prefecture in Japan between 2004 and 2015 were used in the present study. The Mann–Whitney U test was used to compare linked (two offenses committed by the same offender) and unlinked (two offenses committed by different offenders) pairs for each distance measure. Discrimination accuracy between linked and unlinked crime pairs was evaluated using area under the receiver operating characteristic curve (AUC). Findings The Mann–Whitney U test showed that the distances of the linked pairs were significantly shorter than those of the unlinked pairs for all distance measures. Comparison of the AUCs showed that the shortest route distance achieved significantly higher accuracy compared with the Euclidean distance, whereas there was no significant difference between the Euclidean and the Manhattan distance or between the Manhattan and the shortest route distance. These findings give partial support to the idea that distance measures taking the impact of environmental factors into consideration might be able to identify a crime series more accurately than Euclidean distances. Research limitations/implications Although the results suggested a difference between the Euclidean and the shortest route distance, it was small, and all distance measures resulted in outstanding AUC values, probably because of the ceiling effects. Further investigation that makes the same comparison in a narrower area is needed to avoid this potential inflation of discrimination accuracy. Practical implications The shortest route distance might contribute to improving the accuracy of crime linkage based on geographical proximity. However, further investigation is needed to recommend using the shortest route distance in practice. Given that the targeted area in the present study was relatively large, the findings may contribute especially to improve the accuracy of proactive comparative case analysis for estimating the whole picture of the distribution of serial crimes in the region by selecting more effective distance measure. Social implications Implications to improve the accuracy in linking crimes may contribute to assisting crime investigations and the earlier arrest of offenders. Originality/value The results of the present study provide an initial indication of the efficacy of using distance measures taking environmental factors into account.


PLoS ONE ◽  
2021 ◽  
Vol 16 (4) ◽  
pp. e0249624
Author(s):  
C. B. Scott ◽  
Eric Mjolsness

We define a new family of similarity and distance measures on graphs, and explore their theoretical properties in comparison to conventional distance metrics. These measures are defined by the solution(s) to an optimization problem which attempts find a map minimizing the discrepancy between two graph Laplacian exponential matrices, under norm-preserving and sparsity constraints. Variants of the distance metric are introduced to consider such optimized maps under sparsity constraints as well as fixed time-scaling between the two Laplacians. The objective function of this optimization is multimodal and has discontinuous slope, and is hence difficult for univariate optimizers to solve. We demonstrate a novel procedure for efficiently calculating these optima for two of our distance measure variants. We present numerical experiments demonstrating that (a) upper bounds of our distance metrics can be used to distinguish between lineages of related graphs; (b) our procedure is faster at finding the required optima, by as much as a factor of 103; and (c) the upper bounds satisfy the triangle inequality exactly under some assumptions and approximately under others. We also derive an upper bound for the distance between two graph products, in terms of the distance between the two pairs of factors. Additionally, we present several possible applications, including the construction of infinite “graph limits” by means of Cauchy sequences of graphs related to one another by our distance measure.


2012 ◽  
Vol 9 (1) ◽  
pp. 357-380 ◽  
Author(s):  
José Merigó ◽  
Anna Gil-Lafuente

A new method for decision making that uses the ordered weighted averaging (OWA) operator in the aggregation of the information is presented. It is used a concept that it is known in the literature as the index of maximum and minimum level (IMAM). This index is based on distance measures and other techniques that are useful for decision making. By using the OWA operator in the IMAM, we form a new aggregation operator that we call the ordered weighted averaging index of maximum and minimum level (OWAIMAM) operator. The main advantage is that it provides a parameterized family of aggregation operators between the minimum and the maximum and a wide range of special cases. Then, the decision maker may take decisions according to his degree of optimism and considering ideals in the decision process. A further extension of this approach is presented by using hybrid averages and Choquet integrals. We also develop an application of the new approach in a multi-person decision-making problem regarding the selection of strategies.


SPE Journal ◽  
2021 ◽  
pp. 1-25
Author(s):  
Chang Gao ◽  
Juliana Y. Leung

Summary The steam-assisted gravity drainage (SAGD) recovery process is strongly impacted by the spatial distributions of heterogeneous shale barriers. Though detailed compositional flow simulators are available for SAGD recovery performance evaluation, the simulation process is usually quite computationally demanding, rendering their use over a large number of reservoir models for assessing the impacts of heterogeneity (uncertainties) to be impractical. In recent years, data-driven proxies have been widely proposed to reduce the computational effort; nevertheless, the proxy must be trained using a large data set consisting of many flow simulation cases that are ideally spanning the model parameter spaces. The question remains: is there a more efficient way to screen a large number of heterogeneous SAGD models? Such techniques could help to construct a training data set with less redundancy; they can also be used to quickly identify a subset of heterogeneous models for detailed flow simulation. In this work, we formulated two particular distance measures, flow-based and static-based, to quantify the similarity among a set of 3D heterogeneous SAGD models. First, to formulate the flow-based distance measure, a physics-basedparticle-tracking model is used: Darcy’s law and energy balance are integrated to mimic the steam chamber expansion process; steam particles that are located at the edge of the chamber would release their energy to the surrounding cold bitumen, while detailed fluid displacements are not explicitly simulated. The steam chamber evolution is modeled, and a flow-based distance between two given reservoir models is defined as the difference in their chamber sizes over time. Second, to formulate the static-based distance, the Hausdorff distance (Hausdorff 1914) is used: it is often used in image processing to compare two images according to their corresponding spatial arrangement and shapes of various objects. A suite of 3D models is constructed using representative petrophysical properties and operating constraints extracted from several pads in Suncor Energy’s Firebag project. The computed distance measures are used to partition the models into different groups. To establish a baseline for comparison, flow simulations are performed on these models to predict the actual chamber evolution and production profiles. The grouping results according to the proposed flow- and static-based distance measures match reasonably well to those obtained from detailed flow simulations. Significant improvement in computational efficiency is achieved with the proposed techniques. They can be used to efficiently screen a large number of reservoir models and facilitate the clustering of these models into groups with distinct shale heterogeneity characteristics. It presents a significant potential to be integrated with other data-driven approaches for reducing the computational load typically associated with detailed flow simulations involving multiple heterogeneous reservoir realizations.


Sign in / Sign up

Export Citation Format

Share Document