To read this content please select one of the options below:

Multi‐level decomposition of probabilistic relations

Stanislaw Grygiel (Portland State University, Portland, Oregon, USA)
Martin Zwick (Portland State University, Portland, Oregon, USA)
Marek Perkowski (Portland State University, Portland, Oregon, USA)


ISSN: 0368-492X

Article publication date: 1 June 2004



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.



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



Emerald Group Publishing Limited

Copyright © 2004, Emerald Group Publishing Limited

Related articles