Abstract
Instead of analyzing time series of vectors or the problem of an allocation of vectors to clusters in vectors spaces, we shall investigate the same issues for time series and clusters of subsets ranging over the hyperset of subsets of a set of a plain set deprived of any mathematical structure, let it be vectorial or topological. The arithmetic operations on vector spaces will be replaced by Boolean operations on hyperspaces. For that purpose, we rely on the ideas going back to Abraham de Moivre based on \smallskip 1.\ \ dispersion gaps between two disjoint subsets and (called gists of the dispersion gap) of subsets such that (instead of dispersion intervals ); \smallskip 2.\ \ magnitudes which are increasing hyperfunctions vanishing at the empty set (encompassing measure, capacities, etc.) of all denominations. \smallskip The main instrument of measure of a set between its two gists is its echelon Its inverse associating with any echelon the subsets sharing the same echelon. It plays the same role as the quantiles in statistics: it assigns the minimum value to (instead of quantile ) and at , as the quantile . The subset plays the role of the median (instead of quantile ). Actually, since we shall use the lattice operations and instead of the usual Kolmogorov measures , we were lead to use this new renormalization rule to compare all kind of magnitudes (Maslov measures, for instance).
[1mm] We shall use magnitudes and echelons of sets to study time series of sets and clustering issues.
[1mm] We shall use magnitudes and echelons of sets to study time series of sets and clustering issues.
Suggested citation
J.-P. Aubin. “Echelons of Sets on Dispersion Gaps: Tools for Cluster Analysis.” Journal of Convex Analysis 27 (2020), No. 1, 53–78.
Copyright Heldermann Verlag 2020