Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  exhaustive method
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
An exhaustive selection of all possible combinations of n = 400 from N = 698 observations of the COVID-19 dataset was used as a benchmark. Building a random set of subsamples and choosing the one that minimized an averaged sum of squares of each variable's category frequency returned similar results as a "forward" subselection reducing the dataset one-by-one observation by the same metric's permanent lowering. That works similarly as k-means clustering (with a random clusters' number) over the original dataset's observations and choosing a subsample from each cluster proportionally to its size. However, the approaches differ significantly in asymptotic time complexity.
EN
The defuzzification of a type-2 fuzzy set is a two stage process consisting of firstly type-reduction, and secondly defuzzification of the resultant type-1 set. This paper considers three approaches to discrete interval type-reduction: 1. The exhaustive method which produces the Type-Reduced Set, 2. the Greenfield-Chiclana Collapsing Defuzzifier which gives rise to the Representative Embedded Set Approximation, and 3. the Nie-Tan Method from which the Nie-Tan Set is derived. In the discrete case these three type-1 sets are distinct. The behavior of the three sets under fine discretisation is investigated experimentally, in order to shed light on the relationships between the continuous versions of these type-1 sets.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.