Abstract
C-Analysis, or Constraint Analysis, is concerned with the study of the decomposability (reconstructability) of multidimensional relations upon which a probability distribution may or may not be defined. This paper deals with the former case, and the approach taken is based on concepts derived from general information theory. C-structures21 constitute a particular class of structures which can be viewed as one canonical representation of an equivalence class of so-called general structures based on a particular graph. A C-structure derives its importance from its uniqueness which is based on the set of all cliques of a graph. It plays a dominant role in the generation of meaningful structure hypotheses. This paper, after presenting a brief overview of the main concepts and theorems relevant to C-Analysis, focuses on the representation and evaluation aspects of the reconstructability problem as it is defined by Cavallo and Klir.21,22 The ultimate result of the paper is the closed-form representation of all ...
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
