Clustering directional data through depth functions

A new depth-based clustering procedure for directional data is proposed. Such method is fully non-parametric and has the advantages to be flexible and applicable even in high dimensions when a suitable notion of depth is adopted. The introduced technique is evaluated through an extensive simulation study. In addition, a real data example in text mining is given to explain its effectiveness in comparison with other existing directional clustering algorithms.


Introduction
Clustering is a fundamental subject in statistics which has been widely investigated in classical multivariate analysis over the past decades. It aims at organizing a set of objects into homogeneous groups, such that objects in the same cluster (or group) are more "similar" to each other than to objects in different clusters. Because of its practical importance, clustering has received a lot of attention in various branches of statistics. However, less attention has been paid to the cluster analysis of directional data even though it is becoming more and more important in modern applications where observations are represented by angles or unit vectors. A few examples are the wind direction (meteorology), the orientation of magnetic fields in rocks (geology) and the movement of animals (biology). In the recent years, thanks to new visualization techniques (see, Buttarazzi et al. 2018;Pandolfo 2022), they have also seen a significant and growing interest by neuroscientists (to study the direction of neuronal axons and dendrites) and microbiologists (to analyze the angles formed by protein structures).
Directional data are constrained to lie on the surface of the unit (d − 1)-dimen- Within the literature, they are presented and discussed by Mardia and Jupp (2000), which is a classical reference on the subject. More recent developments of this branch of statistics can be found in Verdebout (2017, 2018). Analyzing and describing directional data requires tackling some interesting problems associated with the lack of a reference direction and with a sense of rotation not uniquely defined. One more important issue is the lack of a natural ordering, which generates a special interest in depth functions on the (hyper)sphere.
Such peculiar features make the use of classical statistical methods inappropriate, and often misleading. In this regard, consider the angles 0 and 2 on a unit circle 1 . Their arithmetic mean is , but they are actually the same angle and the "true" mean is 0. Thus, working with directional data requires specific techniques that consider the geometry of the manifold, and this obviously holds true also for clustering issues.
Despite the theory on clustering methods based on depth functions in ℝ d has been recently established and it is still relatively young and under development (see e.g. Jörnsten 2004, Ding et al. 2007and Jeong et al. 2016, to the best of authors' knowledge, there is no work of such type to perform clustering of high dimensional directional data in the literature. However, angular depth functions were recently employed to perform classification of hyperspherical objects (see Pandolfo and D'Ambrosio 2021).
The idea of data depth, a measure of how deep or outlying a given multidimensional point is w.r.t. a distribution F or w.r.t. a data cloud {X 1 , … , X n } , allows generalizing the concepts of median and rank to multivariate data. This way, a multidimensional center-outward order (similar to that of a real line) can be obtained. Obviously, this holds true also for directional data.
Depth-induced ordering enables a description of multivariate distributions and aids in using depth functions for clustering as shown in Jörnsten (2004) and Torrente and Romo (2021) who have proven power of depth function methodology. Then, even though the use of a depth notion in the directional data clustering problem is yet a new and unexplored tool, it is highly appealing to extend these ideas to such complex setting of data.
Hence, in this paper we propose a non-parametric method for performing cluster analysis of directional data based on the concept of data depth for directional data. The proposal aims to be considered as an alternative tool in the general framework of clustering methods for directional data.
The paper is organized as follows. In Sect. 2 the von Mises-Fisher distribution, the reference distribution in directional data analysis, is briefly recalled. In Sect. 3, we provide a brief review of angular data depths available within the literature. Sect. 4 reviews existing methods for clustering directional data. In Sect. 5 the depthbased clustering procedure is presented. Section 6 contains an evaluation of the proposed method through a simulated study. A real data application for textual data analysis is presented in Sect. 7. Finally, Sect. 8 contains some concluding remarks.

3
Clustering directional data through depth functions

Preliminaries: the von Mises-Fisher distribution
In this section, we briefly review the von Mises-Fisher (vMF) distribution, which arises naturally for data distributed on the unit hypersphere. A (d − 1)-dimensional unit random vector x (i.e., x ∈ ℝ d and ‖x‖ 2 = 1 , or equivalently x ∈ d−1 ) is said to have a von Mises-Fisher distribution if its probability density function is given by where ‖ ‖ 2 = 1 , ≥ 0 and d ≥ 2 . The normalizing constant c d ( ) is given by where I (⋅) represents the modified Bessel function of the first kind and order . The density f (x| , ) is parametrized by the mean direction , and the concentration parameter , so-called because it characterizes how strongly the unit vectors drawn according to f (x| , ) are concentrated about . Larger values of imply stronger concentration about the mean direction. In particular when = 0 , f (x| , ) reduces to the uniform density on d−1 , and as → ∞ , f (x| , ) tends to a point density. Such distribution is a reference one for directional data, and has properties analogous to those of the multivariate Normal distribution for data in ℝ d . For example, the maximum entropy density on d−1 subject to the constraint that E[x] is fixed is a vMF density. Figure 1 illustrates the impact of , by presenting four samples of 1000 points on the unit sphere (i.e d = 3 ) according to four vMF distributions with the same mean direction, = (0, 0, 1) � , but with different values of ∈ {0, 5, 20, 100}.

Data depth for directional data
In this section, we recall the notions of data depth for directional data available within the literature, that is the angular simplicial depth, the angular halfspace depth, the arc distance depth, the cosine distance depth, and the chord distance depth. The first three were introduced and investigated by Liu and Singh (1992), while the latter by Pandolfo et al. (2018).
Definition 1 Angular simplicial depth (ASD). The angular simplicial depth of a given point x ∈ d−1 w.r.t. the distribution F on the unit hypersphere d−1 is defined as follows: where P F denotes the probability content w.r.t. the distribution F. W 1 , … , W d are i.i.d. observations from F and Δ W 1 , … , W d denotes the simplex with vertices Definition 2 Angular Tukey's depth (ATD). The angular Tukey's depth of a given point x ∈ d−1 w.r.t. the distribution F on d−1 is defined as follows: where HS denotes the set of all closed hemispheres containing x.
Definition 3 Arc distance depth (ADD). The arc distance depth of a given point x ∈ d−1 w.r.t. the distribution F on d−1 is defined as follows: where (x, ) is the Riemannian distance between x and (i.e. the length of the shortest arc joining x and ).
Definition 4 Cosine distance depth (CDD). The cosine distance depth of a given point x ∈ d−1 w.r.t. the distribution F on d−1 is defined as follows: where E F is the expectation under the assumption that W has distribution F.
Definition 5 Chord distance depth (ChDD). The chord distance depth of a given point x ∈ d−1 w.r.t. the distribution F on d−1 is defined as follows : where E F is the expectation under the assumption that W has distribution F.
For convenience, in the following we denote with AD(⋅, ⋅) the population version of a general angular depth function, unless a particular notion is adopted.
The sample version, henceforth denoted by AD n (⋅, ⋅) , is obtained by replacing F by its empirical counterpart F calculated from the sample X 1 , … , X n .
All the depth functions listed above possess the following important properties: In addition, one more important property is satisfied by the distance-based depths, that is: P4. Minimality at the antipodal point to the center: AD −x 0 , F = inf x∈ d−1 AD(x, F) for any F with center at x 0 .
One further available notion of depth for directional data is the angular Mahalanobis depth of Ley et al. (2014), which is based on a concept of directional quantiles. However, it requires a preliminary choice of a spherical location and for this reason it is not considered in this work. Moreover, for the purpose of this work, the ASD and ATD will not be considered. This is because they have two main drawbacks that make them not feasible for the application of the proposed method to high-dimensional data, that is: (i) They are high computationally demanding and (ii) can take zero values (see Liu and Singh 1992), while distance-based directional depths take positive values everywhere on d−1 (but in the uninteresting case of a point mass distribution).
Note that depth functions are not to intended to be equivalent with density. However, contours of depth are often used to reveal the shape and the structure of a multivariate data set. Such contours are analogous to quantiles in the univariate case, and they allow for the computation of L-estimators of locationscatter parameters (such as trimmed means). Unlike the univariate case, multivariate ordering can be defined in different ways, but it is usually desirable for samples from a certain class of distributions such as the rotationally symmetric ones, the angular depth contours should track the contours of the underlying model (and thus circularly contoured). Such contours thus are formed by a (d − 1)-dimensional sphere (a circle inside the sphere 2 , two points on the circle 1 ) centered at x 0 . Rotationally symmetric distributions are characterized by densities of the form 0 is an absolutely continuous and monotone increasing function and c ,f a normalizing constant. Such class of distributions contains the von Mises-Fisher distribution which is obtained by taking f (u) = exp( u) for some strictly positive concentration parameter . Note that Theorems 3 and 4 in Pandolfo et al. (2018) ensures that the maximal depth measures the concentration of F, irrespective of the chosen distance measure for distributions having density of the form given in (1).
It is usually convenient to treat depth contours in terms of their corresponding -regions that, as usual, are defined as the collection of x values with a depth larger than or equal to .
Definition 6 For a given angular depth function AD(x, F) and for > 0 , we call the corresponding -depth region and its boundary AD (x, F) the corresponding -contour.
The -depth regions for data on d−1 usually are desired to be rotationally invariant and nested. In addition, it is worth underlying that the -regions induced by ADD, CDD and ChDD are invariant under rotations when fixing x 0 , hence they are able to reflect the symmetry of the distribution F about x 0 . Roughly speaking, each depth region can be considered a sort of measure of the distance of a given point from a central point of the distribution, where the depth function takes its maximum. Hence, more dispersed data lead to larger regions.
To illustrate the angular depth ordering and its ramifications, the normalized ADD, CDD and ChDD are used to order sample points and graph their corresponding representative contours. Applying depth ordering to a sample of 1000 points drawn from a von Mises-Fisher distribution on 2 with concentration parameter = 15 , the sample p th level contours in Fig. 2 were obtained. For the sake of the illustration, data are presented in spherical coordinates using angles and with unit radius. As one can see the contours are nested within one another. (1) Clustering directional data through depth functions

Clustering directional data: a brief review
The last few decades have witnessed an increasing interest in classification methods for directional data in a broad sense (which includes both classification and clustering techniques).
The literature on supervised classification of directional data is quite rich. Sen-Gupta and Roy (2005) proposed a discrimination rule based on the chord distance. Ackermann (1997) adapted discriminant analysis procedures for linear data to the analysis of circular data, while a comparison of different classification rules on the unit circle was performed by Tsagris and Alenazi (2019). The Naive Bayes classifier for directional data was introduced by López-Cruz et al. (2015), and the discriminative directional logistic regression by Fernandes and Cardoso (2016). More recently, The development of clustering techniques for directional data has recently been an important research topic. The two most popular approaches to perform clustering of data on d−1 are the spherical K-means (Dhillon and Modha 2001a) and the use of mixture models with vMF components. The former aims at maximizing the cosine similar- where c i is the centroid of the cluster containing X i . Dhillon and Sra (2003) and Banerjee et al. (2003Banerjee et al. ( , 2005 gave Expectation-Maximization (EM) algorithm for fitting vMF mixtures which have spherical K-means as a particular case. Other different approaches for fitting vMF mixtures were proposed by Yang and Pan (1997), based on embedding fuzzy c-partitions in the mixtures, and Taghia et al. (2014) who addressed the Bayesian estimation of the vMF mixture model employing variational inference. Franke et al. (2016) developed an EM algorithm to fit general projected normal mixtures on 2 .
A fuzzy variation of the K-means clustering procedure for directional data was proposed by Kesemen et al. (2016), while Benjamin et al. (2019) introduced possibilistic c-means.

Depth-based medoids clustering algorithm
In this section a depth-based medoids clustering algorithm (DBMCA) for directional data is introduced. Some concepts which are required for the formulation of the proposed algorithm are defined below.
Definition 7 (Depth-based partition): A depth-based partition C k is a non-empty maximal and depth-based subset of a n × (d − 1) data set defined in d−1 such that = C 1 , … , C k , … C K , where K ≤ n.
Definition 8 (Depth-medoid): A depth-medoid x AD k ∈ d−1 is a data point belonging to the depth-based partition C k having distribution F C k for which where F C k is the sample distribution function of F C k . Hence, the depth-medoid is the deepest point within the kth depth-based partition.
Then, in order to evaluate the goodness of the partition into K clusters, the proposed algorithm makes use of a depth-based cluster homogeneity measure. As highlighted in Hoberg (2000), data showing larger dispersion give rise to larger -depth regions, and consequently, homogeneity can be measured by considering the depth values of data points within regions. More in detail, the idea is to use a within-class depth-based concentration measure by following the depth-based dispersion measure proposed by Romanazzi (2009) for data in ℝ d and later used by Agostinelli and Romanazzi (2013) for the analysis of directional data. Specifically, the depth-based homogeneity within the kth cluster can be defined as the expected measure of the angular depth within each cluster C k having distribution F C k where denotes the Lebesgue measure on d−1 .
Denote by S k = {x k1 , … , x kn k } the finite set of points within the k th cluster, then (2) can be approximated for sample data as The algorithm searches for the partition of the data points into K clusters in such a way that the expected angular depth of each cluster is maximized.
The proposed algorithm follows the well-known partitioning around medoids (PAM) approach (Kaufman and Rousseeuw 1987). The main difference is that we iteratively search for those points, the depth-medoids, that maximize a given depth function between themselves and other points belonging to the same partition.
More formally, let be a n × (d − 1) data set defined in d−1 , randomly select K observations as depth-medoids. Iteratively: • Assign each data point to the cluster w.r.t. its angular depth is maximum (assignment step); • Refine the K depth-medoids by choosing for each cluster those points that allow for the maximization of the depth-based within-cluster homogeneity as defined in (3) (refinement step).
Here, for evaluating the clustering results and determining the optimal number of clusters, the Silhouette index of Rousseeuw (1987) is adopted. It defines for each object in a data set, the measure of how this object is similar to other objects from the same cluster (cohesion) in comparison with objects of other clusters (separation). Specifically, in our approach, data consists of angular depth values. Hence, assume the data have been clustered into K clusters, then for each data point x i ∈ C i , we have then, with such measure, the silhouette coefficient is defined as:

Initialization of cluster centers
Initialization of iterative algorithms can have a significant impact on the resulting performances. Several techniques can be found within the literature. Here, we propose a modified version of the well-known K-means++ algorithm proposed by Arthur and Vassilvitskii (2007). Specifically, assuming the number of clusters is equal to K: Step 1 Select an initial medoid m 1 uniformly at random from the data set .
Step 2 Then, each additional medoid m j (j = 2, … , K) is selected in the following way: a. Compute the angular data depth of m j−1 w.r.t.
b. Compute the angular depth of each of the other non-selected data points x i (i = 1, … , n − (j − 1)) w.r.t.
c. Then compute the difference between the angular depths of points x i and the angular depth of the (j − 1) th medoid as follows: d. Choose one new data point at random as a new medoid from with probability That is, select each subsequent medoid with a probability proportional to difference between its angular depth and the angular depth of the previously chosen medoid.
Step 3 Repeat Step 2 until K medoids are chosen.

3
Clustering directional data through depth functions

Simulation study
We have run a comprehensive simulation study in order to evaluate the proposed methodology. We have considered four factors, i.e. the number of clusters, the dimensionality of the problem, the level of noise, and structured vs unstructured data. We generated data with two, three, four and five theoretical partitions. We have sampled data from the von Mises-Fisher distribution in dimensions d ∈ {3, 5, 10} . The level of noise was set by randomly choosing the value of the concentration parameters Low ∼ U [10,12] , Medium ∼ U [6,8] and High ∼ U[2, 4] for the cases of low, medium and high noise level, respectively.
In the case of structured data, we first selected randomly a point as center of the first partition. Then, • For the case of two centers, the second cluster center was randomly chosen with the constraint that the cosine distance from the first was between 1.7 and 2; • In the case of three centers, we randomly added a point with the constraint that the cosine distance from both the first two data points was between 0.8 and 1.2; • In the case of four centers, we randomly added a data point with the constraint that the cosine distance from the third center was between 1.7 and 2; • In the case of five centers, we randomly added a data point with the constraint that the cosine distance from all other centers was between 0.5 and 0.8.
In the case of unstructured data, the theoretical centers were sampled without any constraint from a von Mises-Fisher distribution with concentration parameter = 0.
For any combination, we generated a sample of size 500. The proportion of cases was randomly chosen in such a way that the clusters were not extremely unbalanced. For each condition and for each level, ten data sets were generated, for a total of 720. Table 1 summarizes the factors and the levels of the factorial design.
We adopted the cosine distance depth (CDD), the arc distance depth (ADD) and the chord distance depth (ChDD). For each trial, the number of clusters ranged from 1 to 10.
As for each data set we know the theoretical partition, to determine how well the resulting partition matched the gold standard partition, we used the adjusted Rand index (ARI) of Hubert and Arabie (1985) which is a modified version of the Rand index which adjusts for agreement by chance. It is defined as follows. Given an n × p data matrix X, where n is the number of objects and p the number of variables, the crisp clustering structure can be presented as a set of nonempty K ≥ 2 subsets C 1 , … , C k , … , C K such that: Two objects of X, i.e., (x, x � ) , are paired in C if they belong to the same cluster. Let P and Q be two partitions of X. The Rand index is calculated as follows: where a is the number of pairs (x, x � ) ∈ X that are paired in P and in Q; b is the number of pairs (x, x � ) ∈ X that are paired in P but not paired in Q; c is the number of pairs (x, x � ) ∈ X that are not paired in P but are paired in Q and d is the number of pairs (x, x � ) ∈ X that are not paired in either P or in Q.
The Rand index takes values in [0, 1], with 0 indicating that the two partitions do not agree for any pair of elements and 1 indicating that the two partitions are exactly the same. Moreover, the Rand index is reflexive, namely, RI(P, P) = 1 . However, such index has some drawbacks: (i) it concentrates in a small interval close to 1, thus presenting low variability; (ii) it approaches its upper limit as the number of clusters increases; and (iii) it is extremely sensitive to the number of groups considered in each partition and their density. To overcome these problems, Hubert and Arabie (1985) proposed the adjusted Rand index (ARI), which can be defined as follows: The ARI can yield a value between −1 and +1 . ARI equal to 1 means complete agreement between two clustering results, whereas ARI equal to −1 means no agreement between two clustering results.

Simulation results
The results of the simulation study are presented in Figs. 3 and 4 for structured and unstructured data, respectively. Boxplots of the ARI values of the proposed method for any combination of a dimension, a depth function, a noise level and a number of clusters are plotted there.
As one can see, since the performance of the depth functions under evaluation appear quite similar for both structured and unstructured data, no clear-cut indications arise on which of them is to be preferred in such cases.
In the case structured data and for a low noise level, the ARI values show larger variability for K = 5 clusters regardless of the dimension. When K = 2 centers are considered, the overall variability of the ARI values is really small, and in general they are approximately equal to 0.8, except for the case of high noise level in ten dimensions where they range from 0.4 to 0.6. As expected, when a high noise is  Fig. 3 Structured data. The boxplots report the adjusted Rand index (ARI) values between the true partition and the resulting partition given by DBMCA introduced to obscure the underlying clustering structure to be recovered, the ARI values get generally smaller.
In the case of unstructured data, the ARI values are generally smaller and show much more variability with respect to the case of structured data. In addition, the ARI values get smaller when the number of the theoretical clusters increases. Here again, the ARI values get generally smaller when high noise occurs. Internal validity values are always large for both structured and unstructured data sets, and thus not reported here.

Real data example: text clustering
Directional data can arise in textual data analysis, and text clustering in particular. It has been experimentally shown that it is often helpful to normalize the data vectors to remove the bias arising from the length of a document (Dhillon and Modha 2001b).
Here we show an example on the "res0" data set coming from the internal repository of the CLUTO software for clustering high-dimensional data sets (http:// glaros. dtc. umn. edu/ gkhome/ views/ cluto). It contains 1504 documents for which the frequency of a set of 2286 possible words have been recorded.
The idea is modeling the word frequencies as spherical data by normalizing them to 1 according to the L 2 norm. Normalization makes long or short documents comparable and projecting documents onto the unit hypersphere is especially useful for sparse data, as is typically the case with textual data. Indeed, this example shows a data matrix with more than the 89% of zero entries.
For such data set, there exists also an a-priori classification of the documents, consisting of 13 classes of documents as summarized in Table 2.
We applied the proposed procedure to the data set by adopting the cosine distance depth (CDD). We compared our proposal with the spherical K-means algorithm (SKM), and the mixture of von Mises-Fisher, by using both hard (movMFh) and soft (movMFs) partitioning. To determine the "optimal" number of clusters (ranging from 1 to 15), the silhouette approach was adopted for DBMCA and SKM algorithms, while the BIC criterion was used in the case of mixture of von Mises-Fisher distributions. A number of K = 10 partitions was selected for DBMCA, while K = 9 clusters were identified for spherical K-means. For the "hard" mixture of von Mises-Fisher distributions (movMFh) and its "soft" version (movMFs), K = 15 and K = 14 clusters were returned, respectively. The spherical K-means and the mixture of von Mises-Fisher distributions algorithms were run through the R packages skmeans (Hornik et al. 2017) and movMF (Hornik and Grün 2014), respectively. The depthbased medoids clustering algorithm (DBMCA) was computed by means of R functions written by the authors.
Since the "soft" mixture of von Mises-Fisher distributions assigns membership probabilities of each point to each of the K components (clusters), a fuzzy version of the Rand and adjusted Rand index was used, that is the normalized degree of concordance (NDC) which is defined as follows. Let be a probabilistic (fuzzy) partition of the data matrix , and let ( i ) = ( 1 ( i ), 2 ( i ), … , K ( i )) ∈ [0, 1] K be the membership degree of i in the kth cluster. Given any pair ( i , j ) ∈ , Hüllermeier et al. (2012) defined a fuzzy equivalence relation on in terms of similarity measure as: where ‖ ⋅ ‖ is the normalized L 1 -norm, yielding a value in [0, 1].
Given two fuzzy partitions, say and , the degree of concordance between a pair of observations is defined as yielding to a distance measure defined by the normalized sum of concordant pairs: where n is the sample size. The normalized degree of concordance (NDC) between two fuzzy partitions, or between a fuzzy and a crisp partition, has been defined as (Hüllermeier et al. 2012): Note that it reduces to the original Rand Index when partitions and are non-fuzzy.
The adjusted version of the NDC "for the chance", called adjusted concordance index, has been defined by D'Ambrosio et al. (2021) as where NDC( , ) is the mean value of the NDC( , ), which is computed by repeatedly permute one of the two partitions, say ̃ , by keeping fixed the partition , and then compute NDC as in Eq. (6). For an extensive overview of the fuzzy extension of the adjusted concordance index, we refer to D' Ambrosio et al. (2021). Both NDC and ACI are implemented in the R package ConsRankClass (D'Ambrosio 2021), that has been used to produce the results in the following of the paper.
The results summarized in Table 3 give the external validation indexes for all of the clustering techniques that were applied to the data set. One can note that the most similar partitions were returned by the mixtures of von Mises-Fisher distributions (ACI = 0.5391). The partitions returned by DBMCA and SKM is quite similar as well (ARI = 0.5123). The adjusted concordance index between the partitions of DBMCA and movMFs is equal to 0.3775, which indicates a low similarity.
, Table 4 contains the Rand and adjusted Rand indexes yielded by each method. Globally the employed clustering algorithms show quite similar results. A careful observation allows us to note that the highest ARI value is associated to DBMCA, while movFMh provides the largest RI value.
In addition, Table 5 reports ARI, ACI, RI and NDC between the partitions returned by each pair of algorithms. The Rand index and, consequently, the normalized degree of concordance show always higher values than ARI and ACI. Such results were expectable since RI is not able to take into consideration effects of random groupings.
According to the ARI values, we can notice a moderate "closeness" of the partitions returned by the DBMCA and SKM for K = 3 , 4, 10, 11 and 12. The largest value of ACI is between DBMCA and movMFs when K = 5 . On average, the partitions returned by SKM and movMF, both crisp and hard, are quite large.

Conclusions
We have proposed a non-parametric procedure (hence not dependent upon any distribution models) for clustering directional data. Specifically, we exploit the concept of angular data depth, which provides a measurement of the centrality of an observation within a distribution of points, to measure the similarity among spherical objects. The method is flexible and applicable even to high dimensional data sets as it is not computational intensive.
We evaluated the performances of the proposed method through an extensive simulation study. Results highlight that, when data are quite structured, it is able to recover the partitions quite well. In case of either extreme overlap (high noise) or non-structured data (that is when theoretical partitions are not governed by a clear structure), the recovery of the partitions is not good, as expected.
In addition, we have compared our method with some other clustering techniques available in the literature by means of a real data example in textual data analysis. Here again, results provide strong empirical support for the effectiveness of our approach.
Overall, this work reveals many potential lines of work to consider in the future and more research is needed to further consolidate this interesting framework and explore its broad applications. For instance, it will be interesting to investigate its robustness properties and develop a tool to determine the number of hyperspherical clusters using the depth method.
Funding Open access funding provided by Università degli Studi di Napoli Federico II within the CRUI-CARE Agreement.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Table 5 Adjusted Rand index (ARI) and Rand index (RI) between DBMCA and SKM, between the DBMCA and the mixtures of von Mises-Fisher (crisp clustering, VMFc) and between SKM and VMFh partitioned by the number of clusters K Normalized degree of concordance (NDC) and adjusted concordance index (ACI) between DBMCA and mixtures of von Mises-Fisher (soft clustering, VMFs) and between SKM and VMFs partitioned by number of clusters K