A Hypervolume Based Approach to Rank Intuitionistic Fuzzy Sets and Its Extension to Multi-criteria Decision Making Under Uncertainty

• URL: http://arxiv.org/abs/2212.13908v1
• Date: Sun, 25 Dec 2022 11:57:04 GMT
• Title: A Hypervolume Based Approach to Rank Intuitionistic Fuzzy Sets and Its Extension to Multi-criteria Decision Making Under Uncertainty
• Authors: Kaan Deveci and Onder Guler
• Abstract summary: Ranking intuitionistic fuzzy sets with distance based ranking methods requires to calculate the distance between intuitionistic fuzzy set and a reference point. This paper gives a mathematical proof of why this assumption is not valid for any of the non-linear distance functions. It suggests a hypervolume based ranking approach as an alternative to distance based ranking.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Ranking intuitionistic fuzzy sets with distance based ranking methods requires to calculate the distance between intuitionistic fuzzy set and a reference point which is known to have either maximum (positive ideal solution) or minimum (negative ideal solution) value. These group of approaches assume that as the distance of an intuitionistic fuzzy set to the reference point is decreases, the similarity of intuitionistic fuzzy set with that point increases. This is a misconception because an intuitionistic fuzzy set which has the shortest distance to positive ideal solution does not have to be the furthest from negative ideal solution for all circumstances when the distance function is nonlinear. This paper gives a mathematical proof of why this assumption is not valid for any of the non-linear distance functions and suggests a hypervolume based ranking approach as an alternative to distance based ranking. In addition, the suggested ranking approach is extended as a new multicriteria decision making method, HyperVolume based ASsessment (HVAS). HVAS is applied for multicriteria assessment of Turkey's energy alternatives. Results are compared with three well known distance based multicriteria decision making methods (TOPSIS, VIKOR, and CODAS).

Related papers

• Likelihood Ratio Confidence Sets for Sequential Decision Making [51.66638486226482]
  We revisit the likelihood-based inference principle and propose to use likelihood ratios to construct valid confidence sequences. Our method is especially suitable for problems with well-specified likelihoods. We show how to provably choose the best sequence of estimators and shed light on connections to online convex optimization.
  arXiv  Detail & Related papers  (2023-11-08T00:10:21Z)
• A Finite-Horizon Approach to Active Level Set Estimation [0.7366405857677227]
  We consider the problem of active learning in the context of spatial sampling for level set estimation (LSE) We present a finite-horizon search procedure to perform LSE in one dimension while optimally balancing both the final estimation error and the distance traveled for a fixed number of samples. We show that the resulting optimization problem can be solved in closed form and that the resulting policy generalizes existing approaches to this problem.
  arXiv  Detail & Related papers  (2023-10-18T14:11:41Z)
• Robust Ellipsoid Fitting Using Axial Distance and Combination [15.39157287924673]
  In random sample consensus (RANSAC), the problem of ellipsoid fitting can be formulated as a problem of minimization of point-to-model distance. We propose a novel distance metric called the axial distance, which is converted from the algebraic distance. A novel sample-consensus-based ellipsoid fitting method is proposed by using the combination between the axial distance and Sampson distance.
  arXiv  Detail & Related papers  (2023-04-02T11:52:33Z)
• Inference on Optimal Dynamic Policies via Softmax Approximation [27.396891119011215]
  We show that a simple soft-max approximation to the optimal treatment regime can achieve valid inference on the truly optimal regime. Our work combines techniques from semi-parametric inference and $g$-estimation, together with an appropriate array central limit theorem.
  arXiv  Detail & Related papers  (2023-03-08T07:42:47Z)
• STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization [74.1615979057429]
  We investigate non-batch optimization problems where the objective is an expectation over smooth loss functions. Our work builds on the STORM algorithm, in conjunction with a novel approach to adaptively set the learning rate and momentum parameters.
  arXiv  Detail & Related papers  (2021-11-01T15:43:36Z)
• False Correlation Reduction for Offline Reinforcement Learning [115.11954432080749]
  We propose falSe COrrelation REduction (SCORE) for offline RL, a practically effective and theoretically provable algorithm. We empirically show that SCORE achieves the SoTA performance with 3.1x acceleration on various tasks in a standard benchmark (D4RL)
  arXiv  Detail & Related papers  (2021-10-24T15:34:03Z)
• Coordinate Descent Methods for DC Minimization [12.284934135116515]
  Difference-of-Convex (DC) refers to the problem of minimizing the difference of two convex functions. This paper proposes a non-dimensional one-dimensional subproblem globally, and it is guaranteed to converge to a coordinatewise stationary point.
  arXiv  Detail & Related papers  (2021-09-09T12:44:06Z)
• Regret-Optimal Filtering [57.51328978669528]
  We consider the problem of filtering in linear state-space models through the lens of regret optimization. We formulate a novel criterion for filter design based on the concept of regret between the estimation error energy of a clairvoyant estimator. We show that the regret-optimal estimator can be easily implemented by solving three Riccati equations and a single Lyapunov equation.
  arXiv  Detail & Related papers  (2021-01-25T19:06:52Z)
• Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient [62.24615324523435]
  This paper provides a statistical analysis of high-dimensional batch Reinforcement Learning (RL) using sparse linear function approximation. When there is a large number of candidate features, our result sheds light on the fact that sparsity-aware methods can make batch RL more sample efficient.
  arXiv  Detail & Related papers  (2020-11-08T16:48:02Z)
• A Novel Fuzzy Approximate Reasoning Method Based on Extended Distance Measure in SISO Fuzzy System [0.0]
  This paper presents an original method of fuzzy approximate reasoning. It can open a new direction of research in the uncertainty inference of Artificial Intelligence(AI) and Computational Intelligence(CI)
  arXiv  Detail & Related papers  (2020-03-27T02:31:53Z)
• Support recovery and sup-norm convergence rates for sparse pivotal estimation [79.13844065776928]
  In high dimensional sparse regression, pivotal estimators are estimators for which the optimal regularization parameter is independent of the noise level. We show minimax sup-norm convergence rates for non smoothed and smoothed, single task and multitask square-root Lasso-type estimators.
  arXiv  Detail & Related papers  (2020-01-15T16:11:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.