Skip to main content
Article
Multi-level Decomposition of Probalistic Relations
Kybernetes
  • Stanislaw Grygiel, Portland State University
  • Martin Zwick, Portland State University
  • Marek Perkowski, Portland State University
Document Type
Post-Print
Publication Date
12-1-2002
Subjects
  • Cybernetics,
  • Complexity theory,
  • Probabilities,
  • Decomposition (Mathematics)
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.
Description

This is the authors' version of an article that subsequently appeared in Kynernetes, published by Emerald Group Publishing Limited. The version of record may be found at http://dx.doi.org/10.1108/03684920410533994.

DOI
10.1108/03684920410533994
Persistent Identifier
http://archives.pdx.edu/ds/psu/16494
Citation Information
Stanislaw Grygiel, Martin Zwick, Marek Perkowski, (2004) "Multi‐level decomposition of probabilistic relations", Kybernetes, Vol. 33, No. 5/6, pp. 948 - 961