This file contains the results of having applied a hierarchical clustering algorithm to an Overlap Matrix file. Each run of the hierarchical clustering program (GROUP) creates a new set of cluster solution vectors. The most important vector in this set is the presentation sequence vector. A presentation sequence vector indicates an order in which to report items that have been clustered. This order has the unique property of ensuring that any stage of the clustering process may be identified by a contiguous block of items. In the past, we talked about the "KPATH" sequence as if it were a unique sequence. With the MPATH enhancements and task clustering, we have created a new generic term, namely, "presentation sequence." This term does not imply necessarily case nor task clustering, nor does it imply "original" or "enhanced" sequence. Any presentation sequence for cases is now called a KPATH sequence, while any presentation sequence for tasks is called a TPATH sequence.
Because the clustering solution is truly a high-dimension solution, any order which rosters items in effectively a one-dimensional fashion is, in fact, only one possible projection of an extremely complex hyperspatial construct. For this reason, a presentation sequence may be "enhanced", which means that a particular order or projection may be selected and tuned to the purpose of the analysis at hand. The MPATH enhancement is very similar to a factor rotation in standard factor analysis studies.