• DOI:10.48550/arXiv.2205.08046
• Corpus ID: 248834442

Shape complexity in cluster analysis

@article{Aguilar2022ShapeCI,
  title={Shape complexity in cluster analysis},
  author={Eduardo Jes{\'u}s Aguilar and Valmir Carneiro Barbosa},
  journal={ArXiv},
  year={2022},
  volume={abs/2205.08046}
}

• E. Aguilar, V. Barbosa
• Published 17 May 2022
• Computer Science
• ArXiv

In cluster analysis, a common first step is to scale the data aiming to better partition them into clusters. Even though many different techniques have throughout many years been introduced to this end, it is probably fair to say that the workhorse in this preprocessing phase has been to divide the data by the standard deviation along each dimension. Like the standard deviation, the great majority of scaling techniques can be said to have roots in some sort of statistical take on the data. Here we explore the use of multidimensional shapes of data, aiming to obtain scaling factors for use prior to clustering by some method, like k-means, that makes explicit use of distances between samples. We borrow from the field of cosmology and related areas the recently introduced notion of shape complexity, which in the variant we use is a relatively simple, data-dependent nonlinear function that we show can be used to help with the determination of appropriate scaling factors. Focusing on what might be called “midrange” distances, we formulate a constrained nonlinear programming problem and use it to produce candidate scaling-factor sets that can be sifted on the basis of further considerations of the data, say via expert knowledge. We give results on a few iconic data sets, highlight-ing the strengths and potential weaknesses of the new approach. These results are generally positive across all the data sets used.