The hybrid aggregation algorithm aims at reducing a given data matrix into a single vector. It defines a non-parametric recursive aggregation, where a set of aggregation operators is applied initially over a vector of input values, and then again over the result of the aggregation, and so on until a certain stop condition is met. Thus the final result is conceived after passing a few layers of aggregation. At the first layer, we have the list of initial values that are to be combined. Using a vector of aggregation operators new values are obtained and the next step is to combine these new values again using the given aggregation operators. A detail explanation of the hybrid aggregation algorithm can be found in the article of Tsiporkova and Boeva⁽¹⁾.

(1) Tsiporkova, E. and Boeva, V. Nonparametric Recursive Aggregation Process. Kybernetika. J. of the Czech Society for Cybernetics and Inf. Sciences 40 1 (2004) 51-70.