Expected-time complexity results for hierarchic clustering algorithms which use cluster centres (Q1838036): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(83)90095-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969242249 / rank | |||
Normal rank | |||
Revision as of 23:23, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Expected-time complexity results for hierarchic clustering algorithms which use cluster centres |
scientific article |
Statements
Expected-time complexity results for hierarchic clustering algorithms which use cluster centres (English)
0 references
1983
0 references
probabilistic algorithms
0 references
dynamic searching
0 references
nearest neighbours
0 references
