An overlapping cluster algorithm to provide non-exhaustive clustering (Q2497259)
From MaRDI portal
!
WARNING
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 5043504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An overlapping cluster algorithm to provide non-exhaustive clustering |
scientific article; zbMATH DE number 5043504 |
Statements
An overlapping cluster algorithm to provide non-exhaustive clustering (English)
0 references
4 August 2006
0 references
data mining
0 references
partitioning clustering
0 references
overlapping clusters
0 references
non-exhaustive clustering
0 references
0.7906481623649597
0 references
0.743804395198822
0 references
0.7402136325836182
0 references
0.7314918637275696
0 references
0.7299992442131042
0 references
