Propozycja.

--------------------------------------------------
Note added at 17 hrs (2019-07-25 00:35:17 GMT)
--------------------------------------------------

Hierarchia H nazywamy taki zbiór podziałów, H={P } . r że IeH,
t' t" ż-i
{T}eH, zaś dla dwóch dowolnych podziałów P ,P zH, t'*t" mamy
t • t" t"' t ’
P c.P albo P cP .
https://data.e-science.pl/19828/Jan_W_Owsiński.pdf
Przez {A}, gdzie A jest zbiorem, oznaczamy taki jego podział, w którym p=l, A^=A. Oznaczenie A, użyte do podziału, odnosi się do takiego podziału właściwego, w którym p = card A.

cccccc
We also give in Table 1 the averaged Adjusted Rand index and its standard
deviation obtained over 100 repetitions of four methods: our method, the EAC
approach, and a direct application of a hierarchical clustering (Ward’s method)

In other words, the information provided by each
clusterer can be expressed as the set of all partitions that are at least as fine as the output of the clusterers. T
An interval [p, p] in PE is thus a particular set of partitions, namely the set of
all partitions finer than p and coarser than p
https://hal.archives-ouvertes.fr/hal-00651375/document
and FCM on the original features


ccccccc
hierarchical clustering method produces a set of partitions on
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2774311/