Identification of Choquet capacity in multicriteria sorting problems through stochastic inverse analysis

• URL: http://arxiv.org/abs/2003.12530v1
• Date: Fri, 27 Mar 2020 16:46:09 GMT
• Title: Identification of Choquet capacity in multicriteria sorting problems through stochastic inverse analysis
• Authors: Renata Pelissari and Leonardo Tomazeli Duarte
• Abstract summary: This paper focuses on multicriteria sorting problems (MCSP) using the Choquet integral. In the Choquet integral context, a practical problem that arises is related to the elicitation of parameters known as the Choquet capacities.
• Score: 7.462336024223667
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In multicriteria decision aiding (MCDA), the Choquet integral has been used as an aggregation operator to deal with the case of interacting decision criteria. While the application of the Choquet integral for ranking problems have been receiving most of the attention, this paper rather focuses on multicriteria sorting problems (MCSP). In the Choquet integral context, a practical problem that arises is related to the elicitation of parameters known as the Choquet capacities. We address the problem of Choquet capacity identification for MCSP by applying the Stochastic Acceptability Multicriteri Analysis (SMAA), proposing the SMAA-S-Choquet method. The proposed method is also able to model uncertain data that may be present in both decision matrix and limiting profiles, the latter a parameter associated with the sorting problematic. We also introduce two new descriptive measures in order to conduct reverse analysis regarding the capacities: the Scenario Acceptability Index and the Scenario Central Capacity vector.

Related papers

• Lexicographic optimization-based approaches to learning a representative model for multi-criteria sorting with non-monotonic criteria [5.374419989598479]
  This paper proposes some approaches to learning a representative model for MCS problems with non-monotonic criteria. We first define some transformation functions to map the marginal values and category thresholds into a UTA-like functional space. We then construct constraint sets to model non-monotonic criteria in MCS problems and develop optimization models to check and rectify the inconsistency of the decision maker's assignment example preference information.
  arXiv  Detail & Related papers  (2024-09-03T05:29:05Z)
• 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)
• Solving clustering as ill-posed problem: experiments with K-Means algorithm [0.0]
  The clustering procedure based on K-Means algorithm is studied as an inverse problem. The attempts to improve the quality of the clustering inverse problem drive to reduce the input data via Principal Component Analysis.
  arXiv  Detail & Related papers  (2022-11-15T17:01:42Z)
• Unified Bayesian Frameworks for Multi-criteria Decision-making Problems [2.1833781995073416]
  This paper introduces Bayesian frameworks for tackling various aspects of multi-criteria decision-making (MCDM) problems. The proposed frameworks offer statistically elegant solutions to key challenges in MCDM, such as group decision-making problems and criteria correlation.
  arXiv  Detail & Related papers  (2022-08-29T06:47:05Z)
• Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity [49.66890309455787]
  We introduce the expected co-coercivity condition, explain its benefits, and provide the first last-iterate convergence guarantees of SGDA and SCO. We prove linear convergence of both methods to a neighborhood of the solution when they use constant step-size. Our convergence guarantees hold under the arbitrary sampling paradigm, and we give insights into the complexity of minibatching.
  arXiv  Detail & Related papers  (2021-06-30T18:32:46Z)
• Identification of Unexpected Decisions in Partially Observable Monte-Carlo Planning: a Rule-Based Approach [78.05638156687343]
  We propose a methodology for analyzing POMCP policies by inspecting their traces. The proposed method explores local properties of policy behavior to identify unexpected decisions. We evaluate our approach on Tiger, a standard benchmark for POMDPs, and a real-world problem related to mobile robot navigation.
  arXiv  Detail & Related papers  (2020-12-23T15:09:28Z)
• Multicriteria Group Decision-Making Under Uncertainty Using Interval Data and Cloud Models [0.0]
  We propose a multicriteria group decision making (MCGDM) algorithm under uncertainty where data is collected as intervals. The proposed MCGDM algorithm aggregates the data, determines the optimal weights for criteria and ranks alternatives with no further input. The proposed MCGDM algorithm is implemented on a case study of a cybersecurity problem to illustrate its feasibility and effectiveness.
  arXiv  Detail & Related papers  (2020-12-01T06:34:48Z)
• Higher order hesitant fuzzy Choquet integral operator and its application to multiple criteria decision making [0.0]
  We propose the higher order hesitant fuzzy (HOHF) Choquet integral operator. This concept not only considers the importance of the higher order hesitant fuzzy arguments, but also it can reflect the correlations among those arguments. To enhance the application of HOHF Choquet integral operator in decision making, we first assess the appropriate energy policy for the socio-economic development.
  arXiv  Detail & Related papers  (2020-11-16T08:52:55Z)
• Coherent Hierarchical Multi-Label Classification Networks [56.41950277906307]
  C-HMCNN(h) is a novel approach for HMC problems, which exploits hierarchy information in order to produce predictions coherent with the constraint and improve performance. We conduct an extensive experimental analysis showing the superior performance of C-HMCNN(h) when compared to state-of-the-art models.
  arXiv  Detail & Related papers  (2020-10-20T09:37:02Z)
• High-Dimensional Quadratic Discriminant Analysis under Spiked Covariance Model [101.74172837046382]
  We propose a novel quadratic classification technique, the parameters of which are chosen such that the fisher-discriminant ratio is maximized. Numerical simulations show that the proposed classifier not only outperforms the classical R-QDA for both synthetic and real data but also requires lower computational complexity.
  arXiv  Detail & Related papers  (2020-06-25T12:00:26Z)
• Multi-Task Multicriteria Hyperparameter Optimization [77.34726150561087]
  The article begins with a mathematical formulation of the problem of choosing optimal hyperparameters. The steps of the MTMC method that solves this problem are described. The proposed method is evaluated on the image classification problem using a convolutional neural network.
  arXiv  Detail & Related papers  (2020-02-15T12:47:53Z)

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.