Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Multi‐level decomposition of probabilistic relations

Multi‐level decomposition of probabilistic relations 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Kybernetes Emerald Publishing

Multi‐level decomposition of probabilistic relations

Kybernetes , Volume 33 (5/6): 14 – Jun 1, 2004

Loading next page...
 
/lp/emerald-publishing/multi-level-decomposition-of-probabilistic-relations-RiF2758Eon
Publisher
Emerald Publishing
Copyright
Copyright © 2004 Emerald Group Publishing Limited. All rights reserved.
ISSN
0368-492X
DOI
10.1108/03684920410533994
Publisher site
See Article on Publisher Site

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.

Journal

KybernetesEmerald Publishing

Published: Jun 1, 2004

Keywords: Cybernetics; Complexity theory; Probability calculations

References