Methods of ranking for aggregated fuzzy numbers from interval-valued
data
- URL: http://arxiv.org/abs/2012.02194v1
- Date: Thu, 3 Dec 2020 02:56:15 GMT
- Title: Methods of ranking for aggregated fuzzy numbers from interval-valued
data
- Authors: Justin Kane Gunn, Hadi Akbarzadeh Khorshidi, Uwe Aickelin
- Abstract summary: This paper primarily presents two methods of ranking aggregated fuzzy numbers from intervals using the Interval Agreement Approach (IAA)
The shortcomings of previous measures, along with the improvements of the proposed methods, are illustrated using both a synthetic and real-world application.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper primarily presents two methods of ranking aggregated fuzzy numbers
from intervals using the Interval Agreement Approach (IAA). The two proposed
ranking methods within this study contain the combination and application of
previously proposed similarity measures, along with attributes novel to that of
aggregated fuzzy numbers from interval-valued data. The shortcomings of
previous measures, along with the improvements of the proposed methods, are
illustrated using both a synthetic and real-world application. The real-world
application regards the Technique for Order of Preference by Similarity to
Ideal Solution (TOPSIS) algorithm, modified to include both the previous and
newly proposed methods.
Related papers
- Sparse Estimation of Inverse Covariance and Partial Correlation Matrices via Joint Partial Regression [0.0]
We present a new method for estimating high-dimensional sparse partial correlation and inverse covariance matrices.
We provide statistical rates of convergence for the proposed method which match, and improve upon, the state-of-the-art for inverse covariance and partial correlation matrix estimation.
The effectiveness of the proposed method is demonstrated on both synthetic and real-world data.
arXiv Detail & Related papers (2025-02-12T13:57:09Z) - Achieving $\widetilde{\mathcal{O}}(\sqrt{T})$ Regret in Average-Reward POMDPs with Known Observation Models [56.92178753201331]
We tackle average-reward infinite-horizon POMDPs with an unknown transition model.
We present a novel and simple estimator that overcomes this barrier.
arXiv Detail & Related papers (2025-01-30T22:29:41Z) - Exogenous Data in Forecasting: FARM -- A New Measure for Relevance
Evaluation [62.997667081978825]
We introduce a new approach named FARM - Forward Relevance Aligned Metric.
Our forward method relies on an angular measure that compares changes in subsequent data points to align time-warped series.
As a first validation step, we present the application of our FARM approach to synthetic but representative signals.
arXiv Detail & Related papers (2023-04-21T15:22:33Z) - Adaptive Consensus Optimization Method for GANs [2.1227526213206542]
We propose a second order gradient based method with ADAM and RMSprop for the training of generative adversarial networks.
We derive the fixed point iteration corresponding to proposed method, and show that the proposed method is convergent.
The proposed method produces better or comparable inception scores, and comparable quality of images compared to other recently proposed state-of-the-art second order methods.
arXiv Detail & Related papers (2023-04-20T13:50:42Z) - COSTI: a New Classifier for Sequences of Temporal Intervals [0.0]
We develop a novel method for classification operating directly on sequences of temporal intervals.
The proposed method remains at a high level of accuracy and obtains better performance while avoiding shortcomings connected to operating on transformed data.
arXiv Detail & Related papers (2022-04-28T12:55:06Z) - A Supervised Learning Approach to Rankability [0.6015898117103067]
rankability of data is a problem that considers the ability of a dataset, represented as a graph, to produce a meaningful ranking of the items it contains.
We propose new methods to assess rankability, which are amenable to efficient estimation.
arXiv Detail & Related papers (2022-03-14T17:55:43Z) - Riemannian classification of EEG signals with missing values [67.90148548467762]
This paper proposes two strategies to handle missing data for the classification of electroencephalograms.
The first approach estimates the covariance from imputed data with the $k$-nearest neighbors algorithm; the second relies on the observed data by leveraging the observed-data likelihood within an expectation-maximization algorithm.
As results show, the proposed strategies perform better than the classification based on observed data and allow to keep a high accuracy even when the missing data ratio increases.
arXiv Detail & Related papers (2021-10-19T14:24:50Z) - Estimating leverage scores via rank revealing methods and randomization [50.591267188664666]
We study algorithms for estimating the statistical leverage scores of rectangular dense or sparse matrices of arbitrary rank.
Our approach is based on combining rank revealing methods with compositions of dense and sparse randomized dimensionality reduction transforms.
arXiv Detail & Related papers (2021-05-23T19:21:55Z) - A Statistical Analysis of Summarization Evaluation Metrics using
Resampling Methods [60.04142561088524]
We find that the confidence intervals are rather wide, demonstrating high uncertainty in how reliable automatic metrics truly are.
Although many metrics fail to show statistical improvements over ROUGE, two recent works, QAEval and BERTScore, do in some evaluation settings.
arXiv Detail & Related papers (2021-03-31T18:28:14Z) - Towards Model-Agnostic Post-Hoc Adjustment for Balancing Ranking
Fairness and Algorithm Utility [54.179859639868646]
Bipartite ranking aims to learn a scoring function that ranks positive individuals higher than negative ones from labeled data.
There have been rising concerns on whether the learned scoring function can cause systematic disparity across different protected groups.
We propose a model post-processing framework for balancing them in the bipartite ranking scenario.
arXiv Detail & Related papers (2020-06-15T10:08:39Z)
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.