Definitionresearch
Dasgupta's cost
Also called Dasgupta objective.
Objective for hierarchical clustering that charges each similar pair by the size of the subtree where they first split.
Objective for hierarchical clustering that charges each similar pair by the size of the subtree where they first split.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 1XM7WH Edit this page History Report an error