Chapter 9 DiSTATIS

9.1 Description

DISTATIS is a new method that can be used to compare algorithms when their outputs consist of distance matrices computed on the same set of objects. The method first evaluates the similarity between algorithms using a coefficient called the RV coefficient. From this analysis, a compromise matrix is computed which represents the best aggregate of the original matrices. In order to evaluate the differences between algorithms, the original distance matrices are then projected onto the compromise. The goal of DISTATIS is to analyze a set of distance matrices. In order to compare distance matrices, DISTATIS combines them into a common structure called a compromise and then projects the original distance matrices onto this compromise.

## [1] Bootstrap On Factor Scores. Iterations #: 
## [2] 1000

9.2 SCREE Plot - RV-MAT

9.3 Plotting Assessor Matrix

9.3.1 ConvexHull

9.4 SCREE Plot - SV-MAT

9.5 I Set

9.6 Cluster Analysis (Hartigan’s Rule)

##   Clusters  Hartigan AddCluster
## 1        2  66.20137       TRUE
## 2        3 113.33226       TRUE
## 3        4 298.98109       TRUE
## 4        5   0.00000      FALSE

9.7 Cluster Analysis (K-Means)

9.7.1 Two centers

9.7.2 Four centers

9.8 Cluster Analysis (hclust)

9.8.1 Two Clusters

9.8.2 Fours Clusters