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

1,562 bytes added ,  18 January 2022
no edit summary
No edit summary
No edit summary
 
(22 intermediate revisions by the same user not shown)
Line 8: Line 8:
|1
|1
|[[Flexible Interpretive Structural Modeling]]
|[[Flexible Interpretive Structural Modeling]]
|Extended and improved version of Warfield's ISM.
|Extended version of Warfield's ISM; allows corrections while a structural model is being developed, or after it has been developed.
|[[Ohuchi & Kaji, 1989]].
|[[Ohuchi & Kaji, 1989]].
|-
|-
Line 62: Line 62:
|-
|-
|12
|12
|[[Complete implication matrix Ψ]]
|[[Complete Implication Matrix Ψ]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
Line 69: Line 69:
|[[Total Interpretive Structural Modeling]]
|[[Total Interpretive Structural Modeling]]
|Approach used for theory building; helps researchers answer the fundamental research questions of what, how, and why; helps identify and define the variables, the relationship between them, and the reason for causality between variables.
|Approach used for theory building; helps researchers answer the fundamental research questions of what, how, and why; helps identify and define the variables, the relationship between them, and the reason for causality between variables.
|ref
|-
|14
|[[Flexible Interpretive Structural Modeling]]
|mmmmmmmm
|ref
|ref
|-
|-
Line 88: Line 83:
|17
|17
|[[Transitive System]]
|[[Transitive System]]
|mmmmmmmm
|A system whose elements are related with [[Transitive Relations]].
|ref
|ref
|-
|-
Line 113: Line 108:
|22
|22
|[[Question Algorithm]]
|[[Question Algorithm]]
|mmmmmmmm
|The logic used to select the next unknown for questioning
|ref
|ref
|-
|-
Line 147: Line 142:
|29
|29
|[[Deletion Procedure]]
|[[Deletion Procedure]]
|Deletion of one or more elements and their connections in the XX matrix.
|Deletion of one or more elements and their connections in the M matrix.
|ref
|ref
|-
|-
Line 156: Line 151:
|-
|-
|31
|31
|[[The from Standard Form to Condensation Matrix Problem]]
|[[Standard Form to Condensation Matrix]]
|Replace a cycle set with one of the elements in the set.
|Replace a cycle set with one of the elements in the set.
|ref
|-
|32
|[[Hierarchical Matrices]]
|
|ref
|-
|33
|[[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.
|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
|-
|-
Retrieved from "https://www.dialogicdesignscience.info/w/Special:MobileDiff/385...491"

Navigation menu