2015
DOI: 10.1016/j.amc.2014.12.038
|View full text |Cite
|
Sign up to set email alerts
|

Clusterability assessment for Gaussian mixture models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 26 publications
(14 citation statements)
references
References 18 publications
(23 reference statements)
0
14
0
Order By: Relevance
“…Considerable effort has been invested to develop reliable methods for grouping sets of objects in multivariate space in such a way that objects falling in the same group are more similar among themselves than to objects in other groups, a technique known as “cluster analysis” (Hennig et al 2016) widely used in ecological applications. Clustering techniques often focus on the problem of optimally splitting a multivariate data set into k ≥ 2 clusters (Halkidi et al 2016), yet the problem of elucidating whether cohesive and well-differentiated groups of objects actually exist in the data, i.e., testing the null hypothesis that k = 1 against the alternative k ≥ 2, has been rarely investigated due to computational difficulties (the so-called “clusterability problem”; Ackerman and Ben-David 2009, Nowakowska et al 2015, Simovici and Hua 2019). Following recent technical developments, it has been advised that a prior study of clusterability should become an integral part of any cluster analysis (Adolfsson 2016, Adolfsson et al 2019, Simovici and Hua 2019).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Considerable effort has been invested to develop reliable methods for grouping sets of objects in multivariate space in such a way that objects falling in the same group are more similar among themselves than to objects in other groups, a technique known as “cluster analysis” (Hennig et al 2016) widely used in ecological applications. Clustering techniques often focus on the problem of optimally splitting a multivariate data set into k ≥ 2 clusters (Halkidi et al 2016), yet the problem of elucidating whether cohesive and well-differentiated groups of objects actually exist in the data, i.e., testing the null hypothesis that k = 1 against the alternative k ≥ 2, has been rarely investigated due to computational difficulties (the so-called “clusterability problem”; Ackerman and Ben-David 2009, Nowakowska et al 2015, Simovici and Hua 2019). Following recent technical developments, it has been advised that a prior study of clusterability should become an integral part of any cluster analysis (Adolfsson 2016, Adolfsson et al 2019, Simovici and Hua 2019).…”
Section: Discussionmentioning
confidence: 99%
“…Formal statistical analyses of “clusterability”, or whether a meaningful clustered structure can be objectively established in a multidimensional data set (Ackerman and Ben-David 2009, Nowakowska et al 2015, Simovici and Hua 2019), were conducted on the set of species coordinates in each of the three pollinator niche spaces considered (each defined by either proportion of visitors or proportion of visits). Dip multimodality tests (Hartigan and Hartigan 1985) were applied to distributions of pairwise distances between species, a method particularly robust to outliers, anomalous topologies and high dimensionality (Adolfsson et al 2019).…”
Section: Methodsmentioning
confidence: 99%
“…This approach uses the curve centre as the tree location, with the apex indicating the overall tree height and the area under the curve representing the circular crown area. A component overlap analysis of the mixed, normal data distributions identifies changes in the curve location, height and crown area between the overlapping parabolas (Nowakowska, Koronacki et al 2015). A Gaussian overlap models where a single tree, identified and described in both datasets, can be aligned to a potential match in the opposing dataset and any similarities in the biophysical properties compared and quantified.…”
Section: Gaussian Overlapping and The Jaccard Similarity Coefficientmentioning
confidence: 99%
“…In the domain of computer science, the notion of structuredness somehow corresponds to the clusterability concept [4]. Intuitively, clusterability can be interpreted as a measure of an "intrinsic structure" of a dataset to be clustered [5]. Computer scientists have observed that a dataset of good clusterability can be clustered quite effectively (i.e., less impact from the NP-hard nature of the clustering problem).…”
Section: Introductionmentioning
confidence: 99%
“…Ackerman and Ben-David [4] have surveyed different definitions of clusterability and shown their incompatibility in pairwise comparisons. Nowakowska et al [5] argued that a clusterability measure should be partition-independent so that it does not depend on the clustering algorithms and the resulting solutions. Ackerman et al [7] proposed the use of the statistical distributions of pairwise distances between any two objects to evaluate clusterability.…”
Section: Introductionmentioning
confidence: 99%