Interactive Clustering (Two-step clustering)
Interactive clustering is based on a two-step clustering algorithm. This two-staged algorithm first agglomerates data points into small clusters using K-Means clustering. Then, it applies agglomerative hierarchical clustering in order to further cluster the data, while also building a hierarchy between the smaller clusters, which can then be interpreted. It therefore allows to extract hierarchical information from datasets larger than a few hundred lines, which cannot be achieved through standard methods.
The clustering can then be manually adjusted in DSS's interface.
The number of clusters for KMeans preclustering. It is recommended that this number be lower than a couple hundred for readability.
The number of clusters in the hierarchy. The full hierarchy will be built and displayed, but these clusters will be used for scoring.
The maximum number of iterations for preclustering. KMeans is an iterative algorithm. A higher value of this parameter will lead to a longer running time, but a more precise pre-clustering. A value between 10 and 100 is recommended.
Used to generate reproducible results. 0 or no value means that no known seed is used (results will not be fully reproducible)