Evaluating Evidential Reliability In Pattern Recognition Based On Intuitionistic Fuzzy Sets
- URL: http://arxiv.org/abs/2411.00848v1
- Date: Wed, 30 Oct 2024 08:05:26 GMT
- Title: Evaluating Evidential Reliability In Pattern Recognition Based On Intuitionistic Fuzzy Sets
- Authors: Juntao Xu, Tianxiang Zhan, Yong Deng,
- Abstract summary: We propose an algorithm for quantifying the reliability of evidence sources, called Fuzzy Reliability Index (FRI)
The FRI algorithm is based on decision quantification rules derived from IFS, defining the contribution of different BPAs to correct decisions and deriving the evidential reliability from these contributions.
The proposed method effectively enhances the rationality of reliability estimation for evidence sources, making it particularly suitable for classification decision problems in complex scenarios.
- Score: 9.542461785588925
- License:
- Abstract: Determining the reliability of evidence sources is a crucial topic in Dempster-Shafer theory (DST). Previous approaches have addressed high conflicts between evidence sources using discounting methods, but these methods may not ensure the high efficiency of classification models. In this paper, we consider the combination of DS theory and Intuitionistic Fuzzy Sets (IFS) and propose an algorithm for quantifying the reliability of evidence sources, called Fuzzy Reliability Index (FRI). The FRI algorithm is based on decision quantification rules derived from IFS, defining the contribution of different BPAs to correct decisions and deriving the evidential reliability from these contributions. The proposed method effectively enhances the rationality of reliability estimation for evidence sources, making it particularly suitable for classification decision problems in complex scenarios. Subsequent comparisons with DST-based algorithms and classical machine learning algorithms demonstrate the superiority and generalizability of the FRI algorithm. The FRI algorithm provides a new perspective for future decision probability conversion and reliability analysis of evidence sources.
Related papers
- Reliability Assessment of Information Sources Based on Random Permutation Set [9.542461785588925]
In pattern recognition, handling uncertainty is a critical challenge that significantly affects decision-making and classification accuracy.
There is a lack of a transformation method based on permutation order between Random Permutation Set (RPS) and Dempster-Shafer Theory (DST)
This paper proposes an RPS transformation approach and a probability transformation method tailored for RPS.
arXiv Detail & Related papers (2024-10-30T07:40:35Z) - 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) - PICProp: Physics-Informed Confidence Propagation for Uncertainty
Quantification [30.66285259412019]
This paper introduces and studies confidence interval estimation for deterministic partial differential equations as a novel problem.
That is, to propagate confidence, in the form of CIs, from data locations to the entire domain with probabilistic guarantees.
We propose a method, termed Physics-Informed Confidence propagation (PICProp), based on bi-level optimization to compute a valid CI without making heavy assumptions.
arXiv Detail & Related papers (2023-10-10T18:24:50Z) - MAntRA: A framework for model agnostic reliability analysis [0.0]
We propose a novel model data-driven reliability analysis framework for time-dependent reliability analysis.
The proposed approach combines interpretable machine learning, Bayesian statistics, and identifying dynamic equation.
Results indicate the possible application of the proposed approach for reliability analysis of insitu and heritage structures from on-site measurements.
arXiv Detail & Related papers (2022-12-13T00:57:09Z) - Validation Diagnostics for SBI algorithms based on Normalizing Flows [55.41644538483948]
This work proposes easy to interpret validation diagnostics for multi-dimensional conditional (posterior) density estimators based on NF.
It also offers theoretical guarantees based on results of local consistency.
This work should help the design of better specified models or drive the development of novel SBI-algorithms.
arXiv Detail & Related papers (2022-11-17T15:48:06Z) - Semi-Blind Source Separation with Learned Constraints [1.2891210250935146]
Blind source separation (BSS) algorithms are unsupervised methods for hyperspectral data analysis.
In this article, we investigate a semi-supervised source separation approach in which we combine a projected alternating least-square algorithm with a learning-based regularization scheme.
We show that this allows for an innovative BSS algorithm, with improved accuracy, which provides physically interpretable solutions.
arXiv Detail & Related papers (2022-09-27T17:58:23Z) - A Generalizable Model-and-Data Driven Approach for Open-Set RFF
Authentication [74.63333951647581]
Radio-frequency fingerprints(RFFs) are promising solutions for realizing low-cost physical layer authentication.
Machine learning-based methods have been proposed for RFF extraction and discrimination.
We propose a new end-to-end deep learning framework for extracting RFFs from raw received signals.
arXiv Detail & Related papers (2021-08-10T03:59:37Z) - Probabilistic robust linear quadratic regulators with Gaussian processes [73.0364959221845]
Probabilistic models such as Gaussian processes (GPs) are powerful tools to learn unknown dynamical systems from data for subsequent use in control design.
We present a novel controller synthesis for linearized GP dynamics that yields robust controllers with respect to a probabilistic stability margin.
arXiv Detail & Related papers (2021-05-17T08:36:18Z) - Providing reliability in Recommender Systems through Bernoulli Matrix
Factorization [63.732639864601914]
This paper proposes Bernoulli Matrix Factorization (BeMF) to provide both prediction values and reliability values.
BeMF acts on model-based collaborative filtering rather than on memory-based filtering.
The more reliable a prediction is, the less liable it is to be wrong.
arXiv Detail & Related papers (2020-06-05T14:24:27Z) - Stochastic-Sign SGD for Federated Learning with Theoretical Guarantees [49.91477656517431]
Quantization-based solvers have been widely adopted in Federated Learning (FL)
No existing methods enjoy all the aforementioned properties.
We propose an intuitively-simple yet theoretically-simple method based on SIGNSGD to bridge the gap.
arXiv Detail & Related papers (2020-02-25T15:12:15Z)
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.