Information cut for clustering using a gradient descent approach (Q856432)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5078615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Information cut for clustering using a gradient descent approach |
scientific article; zbMATH DE number 5078615 |
Statements
Information cut for clustering using a gradient descent approach (English)
0 references
7 December 2006
0 references
graph theoretic cut
0 references
information theory
0 references
parzen window density estimation
0 references
clustering
0 references
gradient descent optimization
0 references
annealing
0 references
0.7895581722259521
0 references
0.7541425824165344
0 references
0.739210307598114
0 references
0.7177278399467468
0 references
0.711054801940918
0 references
