A novel framework for MCDM based on Z numbers and soft likelihood function

• URL: http://arxiv.org/abs/2412.19321v1
• Date: Thu, 26 Dec 2024 18:47:19 GMT
• Title: A novel framework for MCDM based on Z numbers and soft likelihood function
• Authors: Yuanpeng He,
• Abstract summary: This paper devises a novel framework of soft likelihood function based on information volume of fuzzy membership and credibility measure. An application is provided to verify the validity and correctness of the proposed framework.
• Score: 0.0
• License:
• Abstract: The optimization on the structure of process of information management under uncertain environment has attracted lots of attention from researchers around the world. Nevertheless, how to obtain accurate and rational evaluation from assessments produced by experts is still an open problem. Specially, intuitionistic fuzzy set provides an effective solution in handling indeterminate information. And Yager proposes a novel method for fusion of probabilistic evidence to handle uncertain and conflicting information lately which is called soft likelihood function. This paper devises a novel framework of soft likelihood function based on information volume of fuzzy membership and credibility measure for extracting truly useful and valuable information from uncertainty. An application is provided to verify the validity and correctness of the proposed framework. Besides, the comparisons with other existing methods further demonstrate the superiority of the novel framework of soft likelihood function.

Related papers

• A Novel Method for Pignistic Information Fusion in the View of Z-number [0.0]
  Dempster-Shafer evidences theory (DSET) is widely used to handle uncertain information. Based on DSET, a completely new method to fuse information from different sources based on pignistic transformation and Z-numbers is proposed in this paper.
  arXiv  Detail & Related papers  (2024-12-27T18:17:28Z)
• Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations [80.86128012438834]
  We show for the first time that computing the robustness of counterfactuals with respect to plausible model shifts is NP-complete. We propose a novel probabilistic approach which is able to provide tight estimates of robustness with strong guarantees.
  arXiv  Detail & Related papers  (2024-07-10T09:13:11Z)
• Enabling CMF Estimation in Data-Constrained Scenarios: A Semantic-Encoding Knowledge Mining Model [23.367637547929807]
  This study introduces a novel knowledge-mining framework for CMF prediction. It delves into the connections of existing countermeasures and reduces the reliance of CMF estimation on crash data availability. It effectively encodes unstructured countermeasure scenarios into machine-readable representations and models the complex relationships between scenarios and CMF values.
  arXiv  Detail & Related papers  (2023-11-15T04:37:27Z)
• Flexible and Robust Counterfactual Explanations with Minimal Satisfiable Perturbations [56.941276017696076]
  We propose a conceptually simple yet effective solution named Counterfactual Explanations with Minimal Satisfiable Perturbations (CEMSP) CEMSP constrains changing values of abnormal features with the help of their semantically meaningful normal ranges. Compared to existing methods, we conduct comprehensive experiments on both synthetic and real-world datasets to demonstrate that our method provides more robust explanations while preserving flexibility.
  arXiv  Detail & Related papers  (2023-09-09T04:05:56Z)
• dugMatting: Decomposed-Uncertainty-Guided Matting [83.71273621169404]
  We propose a decomposed-uncertainty-guided matting algorithm, which explores the explicitly decomposed uncertainties to efficiently and effectively improve the results. The proposed matting framework relieves the requirement for users to determine the interaction areas by using simple and efficient labeling.
  arXiv  Detail & Related papers  (2023-06-02T11:19:50Z)
• CoP: Factual Inconsistency Detection by Controlling the Preference [45.4045488637761]
  We propose an unsupervised framework named CoP by controlling the preference of the generation model with the help of prompt. With the properly designed prompt, our framework could evaluate specific preferences and serve as measurements for fine-grained categories of inconsistency. Experiments show that our framework achieves new SOTA results on three factual inconsistency detection tasks.
  arXiv  Detail & Related papers  (2022-12-03T13:05:24Z)
• Information-Theoretic Odometry Learning [83.36195426897768]
  We propose a unified information theoretic framework for learning-motivated methods aimed at odometry estimation. The proposed framework provides an elegant tool for performance evaluation and understanding in information-theoretic language.
  arXiv  Detail & Related papers  (2022-03-11T02:37:35Z)
• A Bayesian Framework for Information-Theoretic Probing [51.98576673620385]
  We argue that probing should be seen as approximating a mutual information. This led to the rather unintuitive conclusion that representations encode exactly the same information about a target task as the original sentences. This paper proposes a new framework to measure what we term Bayesian mutual information.
  arXiv  Detail & Related papers  (2021-09-08T18:08:36Z)
• SAMBA: Safe Model-Based & Active Reinforcement Learning [59.01424351231993]
  SAMBA is a framework for safe reinforcement learning that combines aspects from probabilistic modelling, information theory, and statistics. We evaluate our algorithm on a variety of safe dynamical system benchmarks involving both low and high-dimensional state representations. We provide intuition as to the effectiveness of the framework by a detailed analysis of our active metrics and safety constraints.
  arXiv  Detail & Related papers  (2020-06-12T10:40:46Z)
• Active recursive Bayesian inference using R\'enyi information measures [11.1748531496641]
  We propose an active Bayesian inference framework with unified inference and query selection steps. We analytically demonstrate that the proposed approach outperforms conventional methods such as mutual information. We present empirical and experimental performance evaluations on two applications: restaurant recommendation and brain-computer interface (BCI) typing systems.
  arXiv  Detail & Related papers  (2020-04-07T05:52:58Z)

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.