In the COsine Distance and Euclidean Distance based Enhanced K STRAnge Points (CODED EKSTRAP) clustering algorithm, an incremental strategy for cluster formation is put forward in which the minimum, maximum and K equidistant strangest values of the input set are calculated using the cosine distance measure. Once the furthest values of the input set equal to the user defined number of clusters K are found, the remaining values of the input set are then assigned into clusters formed by the K Strange input points using the Euclidean distance measure. The CODED EKSTRAP clustering algorithm is an extension of the Enhanced K Strange Points clustering algorithm and can be used in applications requiring the use of multiple distance measures based on the requirements of the operations involved.
NSTL
