Towards obtaining upper bound on sensitivity computation process for cluster validity measures (Q3120183)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7031509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards obtaining upper bound on sensitivity computation process for cluster validity measures |
scientific article; zbMATH DE number 7031509 |
Statements
Towards Obtaining Upper Bound on Sensitivity Computation Process for Cluster Validity Measures (English)
0 references
1 March 2019
0 references
clustering algorithm
0 references
sensitivity
0 references
cluster validity measure
0 references
upper bound on sensitivity computation process
0 references
number of combinatorics
0 references
0.6879523396492004
0 references
0.6874569654464722
0 references
0.6810387372970581
0 references
0.6783738732337952
0 references
0.676091194152832
0 references
