Abstract: A possibilistic portfolio choice problem using expected utility operators.
problem A possibilistic portfolio choice problem in the framework of expected utility operators.
method Using expected utility operators, the paper formulates a possibilistic choice problem and derives two approximate calculation formulas for optimization.
result Two approximate calculation formulas for optimization of possibilistic portfolio choice problem.
Paper compares two possibilistic segmentation methods for SAS imagery.
problem Segmenting synthetic aperture sonar images into different seafloor environments.
method Comparison of Possibilistic Fuzzy Local Information C-Means (PFLICM) and Possibilistic K-Nearest Neighbors (PKNN) algorithms.
result PKNN outperforms PFLICM in segmentation performance on SAS images.
Develops possibilistic VI using maxitive Donsker-Varadhan formulation.
problem Adapting VI to possibilistic framework to handle uncertainty.
method Maxitive Donsker-Varadhan formulation for possibilistic VI.
result CBOpt optimizers achieve competitive performance in image classification.
In this paper two portfolio choice models are studied: a purely possibilistic model, in which the return of a risky asset is a fuzzy number, and a mixed model in which a probabilistic background risk is added. For the two models an approximate formula of the optimal allocation is computed, with respect to the possibili…
BFPM relaxes fuzzy and possibilistic clustering restrictions, allowing full memberships in multiple clusters.
problem Issues with previous fuzzy and possibilistic clustering methods, especially overlapping clusters.
method BFPM allows larger membership values and multiple full memberships per object.
result BFPM overcomes conventional methods' limitations and improves data object tracking.
New validity index for fuzzy-possibilistic c-means clustering.
problem Conflicting results in determining the optimal number of clusters due to noisy data points and outliers.
method Introducing a new validity index (FP index) for fuzzy-possibilistic c-means clustering.
result FP index works well in datasets with varying cluster shapes and densities.
BFPM improves machine learning accuracy by considering object types and memberships flexibly.
problem Inaccurate learning due to missing important parameters.
method BFPM relaxes fuzzy and possibilistic constraints, allowing arbitrary object memberships and movement analysis.
result BFPM enhances object movement analysis and provides flexible search space.
In the study of investment problem, aside from the investment risk the background risk appears. Both the investment risk and the background risk are probabilistically described by random variables. This paper starts from the hypothesis that the two types of risk can be represented both probabilistically (by random vari…
This paper proposes two mixed models to study a consumer's optimal saving in the presence of two types of risk.
Categorical d-separation criterion simplifies probability graph analysis.
problem Detecting causal relationships in probability distributions.
method Introducing categorical definitions for causal models and d-separation.
result Abstract version of d-separation criterion applies to various probability theories.
This paper solves a coinsurance problem using fuzzy numbers and expected utility operators.
problem Formulating a coinsurance problem in the possibilistic setting of expected utility operators.
method Developed a framework using expected utility operators to model risk aversion and solve the coinsurance problem.
result Various formulas for the optimal T-coinsurance rate are derived for specific utility functions and fuzzy numbers. We define a generalized likelihood function based on uncertainty measures and show that maximizing such a likelihood function for different measures induces different types of classifiers. In the probabilistic framework, we obtain classifiers that optimize the cross-entropy function. In the possibilistic framework, we …
A new method combines classifiers using possibility distributions and adaptive t-norms.
problem Aggregating predictions from multiple classifiers trained on overlapping datasets.
method Proposes a new approach to aggregate classifier predictions using possibility theory and adaptive t-norms.
result Proves the proposed approach possesses desirable robustness properties.
In this paper, we take a new look at the possibilistic c-means (PCM) and adaptive PCM (APCM) clustering algorithms from the perspective of uncertainty. This new perspective offers us insights into the clustering process, and also provides us greater degree of flexibility. We analyze the clustering behavior of PCM-based…