635
edits
Terminology in Interpretive Structural Modeling: Difference between revisions
Jump to navigation
Jump to search
Terminology in Interpretive Structural Modeling (view source)
Revision as of 09:38, 18 January 2022
, 18 January 2022no edit summary
No edit summary |
No edit summary |
||
| (13 intermediate revisions by the same user not shown) | |||
| Line 83: | Line 83: | ||
|17 | |17 | ||
|[[Transitive System]] | |[[Transitive System]] | ||
|A system | |A system whose elements are related with [[Transitive Relations]]. | ||
|ref | |ref | ||
|- | |- | ||
| Line 163: | Line 163: | ||
|[[Characteristic Logic Equation]] | |[[Characteristic Logic Equation]] | ||
|Expresses the necessary and sufficient conditions to be satisfied by the entries in an [[Interconnection Matrix]] M<sub>BA</sub>, that interconnects two hierarchical digraphs A<sup>*</sup> and B<sup>*</sup> for which M<sub>AB</sub> = 0. | |Expresses the necessary and sufficient conditions to be satisfied by the entries in an [[Interconnection Matrix]] M<sub>BA</sub>, that interconnects two hierarchical digraphs A<sup>*</sup> and B<sup>*</sup> for which M<sub>AB</sub> = 0. | ||
|ref | |||
|- | |||
|34 | |||
|[[Cascade Interconnection of Digraphs]] | |||
|Two [[Digraphs]] are said to be cascaded if all interconnections are oriented from one of the digraphs to the other. | |||
|ref | |||
|- | |||
|35 | |||
|[[Digraphs]] | |||
|A directed graph, also called a digraph, is a graph in which the edges have a direction. | |||
|ref | |||
|- | |||
|36 | |||
|[[Reachability Matrix]] | |||
|Reachability refers to the ability to get from one vertex to another within a graph. | |||
|ref | |||
|- | |||
|37 | |||
|[[Structural Equation Modeling]] | |||
|Set of statistical techniques used to measure and analyze the relationships of observed and latent variables. | |||
|ref | |||
|- | |||
|38 | |||
|[[Transitive Relations]] | |||
|Relationships for which if element X is related to element Y, and element Y is related to element Z of the set, we can derive thatelement A must be related to element Z. | |||
|ref | |||
|- | |||
|39 | |||
|[[Transitive Closure]] | |||
|... | |||
|ref | |||
|- | |||
|40 | |||
|[[Binary Matrices]] | |||
|All elements are either 0 or 1; In ISM they are square. | |||
|ref | |||
|- | |||
|41 | |||
|[[Partitioning of an Element]] | |||
|e. | |||
|ref | |||
|- | |||
|41 | |||
|[[Binary Matrix Model]] | |||
|A binary matrix and three associations (indicated by colons), i.e. <br> M = { N, V: I<sub>s</sub>, H: I<sub>t</sub>, ''R̂'': ''R'' } | |||
|ref | |ref | ||
|- | |- | ||