Batch edge-removal clustering based on random $k$NN graph (Q5382001)
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: Batch edge-removal clustering based on random kNN graph |
scientific article; zbMATH DE number 7071591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Batch edge-removal clustering based on random $k$NN graph |
scientific article; zbMATH DE number 7071591 |
Statements
21 June 2019
0 references
adjacent graph
0 references
batched edge-remove clustering
0 references
random $k$NN graph
0 references
edge-remove criterion
0 references
local Gaussian smoothing
0 references
基于随机 k NN图的批量边删除聚类算法 (English)
0 references
0.6989167332649231
0 references
0.6985405087471008
0 references
0.6912376284599304
0 references
