Clustering models |
Clustering
arbitrary data into clusters of similar items presents the difficulty
of deciding what constitutes a good clustering. It can be shown that
there is no absolute "best" criterion which would be independent
of the final aim of the clustering. Consequently, it is the user which
must supply this criterion, in such a way that the result of the clustering
will suit their needs.
The first clustering criterion,
available since the introduction of ArrayMiner, is used in other clustering
tools as well. Namely, ArrayMiner clusters the expression profiles into
a user-supplied number of clusters, such that the profiles within each
cluster be mutually as similar as possible. More precisely, ArrayMiner
finds a clustering of the expression profiles with minimal total variance
of the clusters. The performance of ArrayMiner on this clustering criterion
is described in the paper "Using k-Means? Consider ArrayMiner",
available in the ArrayMiner installation package and in Optimal Design's
web site at www.optimaldesign.com.
As of version 3 of ArrayMiner, a third tab, Class Marking and Prediction, is available in the Analysis Selection Window (not shown in the above figure). Selecting the third tab acivates the optional functionality ClassMarker. |