Content deleted Content added
KolbertBot (talk | contribs) m Bot: HTTP→HTTPS |
KolbertBot (talk | contribs) m Bot: HTTP→HTTPS |
||
Line 38:
The DSM algorithms are used for reordering the matrix elements subject to some criteria. Static DSMs are usually analyzed with [[Cluster analysis|clustering algorithms]] (i.e., reordering the matrix elements in order to group together related elements). Clustering results would typically show groups (clusters) of tightly related elements, and elements that are either not connected or are connected to many other elements and therefore are not part of a group.<ref name="DSMbook"/>
Time-based DSMs are typically analyzed using partitioning, tearing and sequencing algorithms.<ref name="DSMbook"/><ref name="complex"/><ref>A. Karniel and Y. Reich, [
'''Sequencing''' methods try to order the matrix elements such that no feedback marks remain.<ref name="DSMbook"/><ref name="complex"/> In case of coupled activities (activities that have cyclic links, e.g., activity A is linked to B, which is linked to C, which is linked to A) the results is a block diagonal DSM (i.e., blocks or groups of coupled activities along the diagonal). Partitioning methods include: Path Searching; Reachability Matrix; Triangulation algorithm; and the powers of the Adjacency Matrix.
|