An improved Bregman \(k\)-means++ algorithm via local search (Q2019501)
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: An improved Bregman k-means++ algorithm via local search |
scientific article; zbMATH DE number 7336132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved Bregman \(k\)-means++ algorithm via local search |
scientific article; zbMATH DE number 7336132 |
Statements
An improved Bregman \(k\)-means++ algorithm via local search (English)
0 references
21 April 2021
0 references
seeding algorithm
0 references
local search
0 references
\(k\)-means
0 references
\(\mu\)-similar Bregman divergences
0 references
0 references
0.9765105
0 references
0.8891432
0 references
0.8866194
0 references
0.8809638
0 references
0.87152016
0 references
0.87023604
0 references
0.87023604
0 references
0.85601383
0 references
