\(K\)-medoids clustering algorithm based on distance inequality (Q3175608)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: K-medoids clustering algorithm based on distance inequality |
scientific article; zbMATH DE number 6907814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(K\)-medoids clustering algorithm based on distance inequality |
scientific article; zbMATH DE number 6907814 |
Statements
18 July 2018
0 references
data mining
0 references
clustering algorithm
0 references
\(K\)-medoids
0 references
distance inequality
0 references
基于距离不等式的 K -medoids聚类算法 (English)
0 references
0.7626936435699463
0 references
0.7604284286499023
0 references
0.7538400888442993
0 references
