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

3,147 bytes added ,  18 January 2022
no edit summary
No edit summary
No edit summary
 
(49 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
{| class="wikitable sortable" style="width: 95%;"
{|border="0" cellpadding="3" cellspacing="0" align="left"
|-
|-
! scope="col" style="background:#efefef;" align="left"| #
! scope="col" style="background:#efefef;" align="left"; "width: 5%"| #
! scope="col" style="background:#efefef;" align="left"| Term
! scope="col" style="background:#efefef;" align="left"; "width: 20%"| Term
! scope="col" style="background:#efefef;" align="left"| Short Explanation
! scope="col" style="background:#efefef;" align="left"; "width: 40%"| Short Explanation
! scope="col" style="background:#efefef;" align="left"| References
! scope="col" style="background:#efefef;" align="left"; "width: 35%"| References
|-
|-
|1
|1
|[[Flexible Interpretive Structural Modeling]]
|[[Flexible Interpretive Structural Modeling]]
|mmmmmmmm
|Extended version of Warfield's ISM; allows corrections while a structural model is being developed, or after it has been developed.
|ref
|[[Ohuchi & Kaji, 1989]].
|-
|-
|2
|2
Line 18: Line 17:
|-
|-
|3
|3
|[[correction procedures]]
|[[Correction Procedures]]
|mmmmmmmm
|Procedures and algorithms for editing an ISM structural model while if being developed or after it is completed
|ref
|ref
|-
|-
|3
|4
|[[Implication Structure]]
|[[Implication Structure]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-|3
|-
|5
|[[Scanning Method of Implication Matrix Development]]
|[[Scanning Method of Implication Matrix Development]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-|3
|-
|6
|[[Coupling Method of Implication Matrix Development]]
|[[Coupling Method of Implication Matrix Development]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-|3
|-
|7
|[[Transitive Coupling Problem]]
|[[Transitive Coupling Problem]]
|mmmmmmmm
|The problem of interconnecting two multilevel subsystem models defined on the same contextual relation that is transitive.
|ref
|ref
|-|3
|-
|8
|[[Self-implication Matrix]]
|[[Self-implication Matrix]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-|3
|-
|9
|[[Initial Inference Opportunity]]
|[[Initial Inference Opportunity]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-|3
|-
|10
|[[Hybrid-implication Matrix]]
|[[Hybrid-implication Matrix]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-|3
|-
|11
|[[Counting in Vectors]]
|[[Counting in Vectors]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-
|-
|3
|12
|[[Complete implication matrix Ψ]]
|[[Complete Implication Matrix Ψ]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-
|-
|3
|13
|[[Total Interpretive Structural Modeling]]
|[[Total Interpretive Structural Modeling]]
|mmmmmmmm
|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
|-
|3
|[[Flexible Interpretive Structural Modeling]]
|mmmmmmmm
|ref
|ref
|-
|-
|3
|15
|[[Inference opportunity]]
|[[Inference opportunity]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-
|-
|3
|16
|[[Transitive bordering]]
|[[Transitive bordering]]
|mmmmmmmm
|Special case of [[Transitive Coupling]] in which the sub-system B consists of a single element.
|ref
|ref
|-
|-
|3
|17
|[[Transitive System]]
|[[Transitive System]]
|mmmmmmmm
|A system whose elements are related with [[Transitive Relations]].
|ref
|ref
|-
|-
|3
|18
|[[Pivot Element]]
|[[Pivot Element]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-
|-
|3
|19
|[[Implication Structure]]
|[[Implication Structure]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-
|-
|3
|20
|[[Bordering Reachability Matrix]]
|[[Bordering Reachability Matrix]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-
|-
|3
|21
|[[(Original) Reachability Matrix]]
|[[(Original) Reachability Matrix]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-
|-
|3
|22
|[[Question Algorithm]]
|[[Question Algorithm]]
|mmmmmmmm
|The logic used to select the next unknown for questioning
|ref
|ref
|-
|-
|3
|23
|[[Zero-First Procedure]]
|[[Zero-First Procedure]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-
|-
|3
|24
|[[One-first Procedure]]
|[[One-first Procedure]]
|mmmmmmmm
|Performed when the [[One-first Selection Rule]] is chosen.
|ref
|ref
|-
|-
|3
|25
|[[Inference Opportunity]]
|[[Inference Opportunity]]
|mmmmmmmm
|mmmmmmmm
|ref
|ref
|-
|-
 
|26
}
|[[Interpretive Matrix]]
|A table of the relationships between pairs of factors of an ISM explained in plain text.
|[[Sushil 2012]];
|-
|27
|[[Interpretive Structural Modeling]]
|Methodology for identifying relationships among specific items, which define a problem or an issue. <br> Process that transforms unclear and poorly articulated mental models of systems into visible, well-defined models useful for many purposes.
|[[Rajesh et al 2013]]<br>[[Shushil 2012]]
|-
|28
|[[Structural Self-Interaction Matrix]]
|ref
|-
|29
|[[Deletion Procedure]]
|Deletion of one or more elements and their connections in the M matrix.
|ref
|-
|30
|[[Addition Procedure]]
|Addition of one or more elements and their connections in the M matrix.
|ref
|-
|31
|[[Standard Form to Condensation Matrix]]
|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
|-
Retrieved from "https://www.dialogicdesignscience.info/w/Special:MobileDiff/338...491"

Navigation menu