In this paper we construct an efficient adaptive Mahalanobis k-means algorithm. In addition,
we propose a new efficient algorithm to search for a globally optimal partition obtained by
using the adoptive Mahalanobis distance-like function. The algorithm is a generalization of
the previously proposed incremental algorithm (Scitovski and Scitovski, 2013). It
successively finds optimal partitions with k= 2, 3,… clusters. Therefore, it can also be used
for the estimation of the most appropriate number of clusters in a partition by using various …