Volume 11, Issue 3
ADVANCED REVIEW

Distance‐based clustering of mixed data

Michel van de Velden

Corresponding Author

E-mail address: vandevelden@ese.eur.nl

Department of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands

Correspondence

Michel van de Velden, Department of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands.

Email: vandevelden@ese.eur.nl

Search for more papers by this author
Alfonso Iodice D'Enza

Department of Economics and Law, University of Cassino and Southern Lazio, Cassino FR, Italy

Search for more papers by this author
Angelos Markos

Department of Primary Education, Democritus University of Thrace, Xanthi, Greece

Search for more papers by this author
First published: 05 November 2018
Citations: 2

Abstract

Cluster analysis comprises of several unsupervised techniques aiming to identify a subgroup (cluster) structure underlying the observations of a data set. The desired cluster allocation is such that it assigns similar observations to the same subgroup. Depending on the field of application and on domain‐specific requirements, different approaches exist that tackle the clustering problem. In distance‐based clustering, a distance metric is used to determine the similarity between data objects. The distance metric can be used to cluster observations by considering the distances between objects directly or by considering distances between objects and cluster centroids (or some other cluster representative points). Most distance metrics, and hence the distance‐based clustering methods, work either with continuous‐only or categorical‐only data. In applications, however, observations are often described by a combination of both continuous and categorical variables. Such data sets can be referred to as mixed or mixed‐type data. In this review, we consider different methods for distance‐based cluster analysis of mixed data. In particular, we distinguish three different streams that range from basic data preprocessing (where all variables are converted to the same scale), to the use of specific distance measures for mixed data, and finally to so‐called joint data reduction (a combination of dimension reduction and clustering) methods specifically designed for mixed data.

This article is categorized under:

  • Statistical Learning and Exploratory Methods of the Data Sciences > Clustering and Classification
  • Statistical Learning and Exploratory Methods of the Data Sciences > Exploratory Data Analysis
  • Statistical and Graphical Methods of Data Analysis > Dimension Reduction

Abstract

An example of mixed data clustering.

Number of times cited according to CrossRef: 2

  • Gravitational K-Means Algorithm, Data Science and Analytics, 10.1007/978-981-15-5830-6_35, (420-429), (2020).
  • Survey of State-of-the-Art Mixed Data Clustering Algorithms, IEEE Access, 10.1109/ACCESS.2019.2903568, (1-1), (2019).

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.