Multi‐level decomposition of probabilistic relations

Abstract

Two methods of decomposition of probabilistic relations are presented in this paper. They consist of splitting relations (blocks) into pairs of smaller blocks related to each other by new variables generated in such a way so as to minimize a cost function which depends on the size and structure of the result. The decomposition is repeated iteratively until a stopping criterion is met. Topology and contents of the resulting structure develop dynamically in the decomposition process and reflect relationships hidden in the data.

Citation

Grygiel, S., Zwick, M. and Perkowski, M. (2004), "Multi‐level decomposition of probabilistic relations", Kybernetes, Vol. 33 No. 5/6, pp. 948-961. https://doi.org/10.1108/03684920410533994