Direct reading algorithm for hierarchical clustering (Q509277): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68P99 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 62H30 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6682408 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
analytics | |||
| Property / zbMATH Keywords: analytics / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
hierarchical clustering | |||
| Property / zbMATH Keywords: hierarchical clustering / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
ultrametric topology | |||
| Property / zbMATH Keywords: ultrametric topology / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(p\)-adic and \(m\)-adic number representation | |||
| Property / zbMATH Keywords: \(p\)-adic and \(m\)-adic number representation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
linear-time computational complexity | |||
| Property / zbMATH Keywords: linear-time computational complexity / rank | |||
Normal rank | |||
Revision as of 02:23, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Direct reading algorithm for hierarchical clustering |
scientific article |
Statements
Direct reading algorithm for hierarchical clustering (English)
0 references
9 February 2017
0 references
analytics
0 references
hierarchical clustering
0 references
ultrametric topology
0 references
\(p\)-adic and \(m\)-adic number representation
0 references
linear-time computational complexity
0 references
