On Globular T-Spherical Fuzzy (G-TSF) Sets with Application to G-TSF
Multi-Criteria Group Decision-Making
- URL: http://arxiv.org/abs/2403.07010v1
- Date: Sat, 9 Mar 2024 04:19:50 GMT
- Title: On Globular T-Spherical Fuzzy (G-TSF) Sets with Application to G-TSF
Multi-Criteria Group Decision-Making
- Authors: Miin-Shen Yang, Yasir Akhtar, Mehboob Ali
- Abstract summary: Globular T-Spherical Fuzzy (G-TSF) Sets are an innovative extension of T-Spherical Fuzzy Sets (TSFSs) and Circular Spherical Fuzzy Sets (C-SFSs)
G-TSFSs represent membership, indeterminacy, and non-membership degrees using a globular/sphere bound.
- Score: 3.2228025627337864
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: In this paper, we give the concept of Globular T-Spherical Fuzzy (G-TSF) Sets
(G-TSFSs) as an innovative extension of T-Spherical Fuzzy Sets (TSFSs) and
Circular Spherical Fuzzy Sets (C-SFSs). G-TSFSs represent membership,
indeterminacy, and non-membership degrees using a globular/sphere bound that
can offer a more accurate portrayal of vague, ambiguous, and imprecise
information. By employing a structured representation of data points on a
sphere with a specific center and radius, this model enhances decision-making
processes by enabling a more comprehensive evaluation of objects within a
flexible region. Following the newly defined G-TSFSs, we establish some basic
set operations and introduce fundamental algebraic operations for G-TSF Values
(G-TSFVs). These operations expand the evaluative capabilities of
decision-makers, facilitating more sensitive decision-making processes in a
broader region. To quantify a similarity measure (SM) between GTSFVs, the SM is
defined based on the radius of G-TSFSs. Additionally, Hamming distance and
Euclidean distance are introduced for G-TSFSs. We also present theorems and
examples to elucidate computational mechanisms. Furthermore, we give the G-TSF
Weighted Average (G-TSFWA) and G-TSF Weighted Geometric (G-TSFWG) operators.
Leveraging our proposed SM, a Multi-Criteria Group Decision-Making (MCGDM)
scheme for G-TSFSs, named G-TSF MCGDM (G-TSFMCGDM), is developed to address
group decision-making problems. The applicability and effectiveness of the
proposed G-TSFMCGDM method are demonstrated by applying it to solve the
selection problem of the best venue for professional development training
sessions in a firm. The analysis results affirm the suitability and utility of
the proposed method for resolving MCGDM problems, establishing its
effectiveness in practical decision-making scenarios.
Related papers
- Rethinking Clustered Federated Learning in NOMA Enhanced Wireless
Networks [60.09912912343705]
This study explores the benefits of integrating the novel clustered federated learning (CFL) approach with non-independent and identically distributed (non-IID) datasets.
A detailed theoretical analysis of the generalization gap that measures the degree of non-IID in the data distribution is presented.
Solutions to address the challenges posed by non-IID conditions are proposed with the analysis of the properties.
arXiv Detail & Related papers (2024-03-05T17:49:09Z) - Enhancing ESG Impact Type Identification through Early Fusion and
Multilingual Models [4.97890110201934]
We present a comprehensive system leveraging ensemble learning techniques, capitalizing on early and late fusion approaches.
Our approach employs four distinct models: mBERT, FlauBERT-base, ALBERT-base-v2, and a Multi-Layer Perceptron (MLP) incorporating Latent Semantic Analysis (LSA) and Term Frequency-Inverse Document Frequency (TF-IDF) features.
Through extensive experimentation, we find that our early fusion ensemble approach, featuring the integration of LSA, TF-IDF, mBERT, FlauBERT-base, and ALBERT-base-v2, delivers the
arXiv Detail & Related papers (2024-02-16T15:54:24Z) - Exploring Progress in Multivariate Time Series Forecasting: Comprehensive Benchmarking and Heterogeneity Analysis [70.78170766633039]
We address the need for means of assessing MTS forecasting proposals reliably and fairly.
BasicTS+ is a benchmark designed to enable fair, comprehensive, and reproducible comparison of MTS forecasting solutions.
We apply BasicTS+ along with rich datasets to assess the capabilities of more than 45 MTS forecasting solutions.
arXiv Detail & Related papers (2023-10-09T19:52:22Z) - Benchmarking Algorithms for Federated Domain Generalization [13.712391766235697]
We evaluate Federated DG which introduces federated learning (FL) specific challenges.
We explore domain-based heterogeneity in clients' local datasets - a realistic Federated DG scenario.
Our results suggest that despite some progress, there remain significant performance gaps in Federated DG.
arXiv Detail & Related papers (2023-07-11T00:14:45Z) - Generalized Universal Domain Adaptation with Generative Flow Networks [76.1350941965148]
Generalized Universal Domain Adaptation aims to achieve precise prediction of all target labels including unknown categories.
GUDA bridges the gap between label distribution shift-based and label space mismatch-based variants.
We propose an active domain adaptation algorithm named GFlowDA, which selects diverse samples with probabilities proportional to a reward function.
arXiv Detail & Related papers (2023-05-08T05:34:15Z) - FS-BAN: Born-Again Networks for Domain Generalization Few-Shot
Classification [39.01765909445661]
We propose Born-Again Network (BAN) episodic training and comprehensively investigate its effectiveness for DG-FSC.
Building on the encouraging findings, our second (major) contribution is to propose Few-Shot BAN (FS-BAN), a novel BAN approach for DG-FSC.
Our proposed FS-BAN includes novel multi-task learning objectives: Mutual Regularization, Mismatched Teacher, and Meta-Control Temperature.
arXiv Detail & Related papers (2022-08-23T13:02:14Z) - Multi-Point Integrated Sensing and Communication: Fusion Model and
Functionality Selection [99.67715229413986]
This paper presents a multi-point ISAC (MPISAC) system that fuses the outputs from multiple ISAC devices for achieving higher sensing performance.
We adopt a fusion model that predicts the fusion accuracy via hypothesis testing and optimal voting analysis.
arXiv Detail & Related papers (2022-08-16T08:09:54Z) - FederatedScope-GNN: Towards a Unified, Comprehensive and Efficient
Package for Federated Graph Learning [65.48760613529033]
Federated graph learning (FGL) has not been well supported due to its unique characteristics and requirements.
We first discuss the challenges in creating an easy-to-use FGL package and accordingly present our implemented package FederatedScope-GNN (FS-G)
We validate the effectiveness of FS-G by conducting extensive experiments, which simultaneously gains many valuable insights about FGL for the community.
arXiv Detail & Related papers (2022-04-12T06:48:06Z) - Unified Group Fairness on Federated Learning [22.143427873780404]
Federated learning (FL) has emerged as an important machine learning paradigm where a global model is trained based on private data from distributed clients.
Recent researches focus on achieving fairness among clients, but they ignore the fairness towards different groups formed by sensitive attribute(s) (e.g., gender and/or race)
We propose a novel FL algorithm, named Group Distributionally Robust Federated Averaging (G-DRFA), which mitigates the distribution shift across groups with theoretical analysis of convergence rate.
arXiv Detail & Related papers (2021-11-09T08:21:38Z) - Generalized Few-shot Semantic Segmentation [68.69434831359669]
We introduce a new benchmark called Generalized Few-Shot Semantic (GFS-Seg) to analyze the ability of simultaneously segmenting the novel categories.
It is the first study showing that previous representative state-of-the-art generalizations fall short in GFS-Seg.
We propose the Context-Aware Prototype Learning (CAPL) that significantly improves performance by 1) leveraging the co-occurrence prior knowledge from support samples, and 2) dynamically enriching contextual information to the conditioned, on the content of each query image.
arXiv Detail & Related papers (2020-10-11T10:13:21Z)
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.