New approach to searching for string median and visualization of string clusters (Q5110049)
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: New approach to searching for string median and visualization of string clusters |
scientific article; zbMATH DE number 7201051
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New approach to searching for string median and visualization of string clusters |
scientific article; zbMATH DE number 7201051 |
Statements
15 May 2020
0 references
Levenshtein edit distance
0 references
string median
0 references
smooth minimum
0 references
gradient descent
0 references
\(k\)-means
0 references
string cluster visualization
0 references
0.8164013624191284
0 references
0.797420084476471
0 references
0.7905535697937012
0 references
0.7864566445350647
0 references
