A clustering algorithm based on maximal \(\varTheta\)-distant subtrees (Q869022)
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: A clustering algorithm based on maximal -distant subtrees |
scientific article; zbMATH DE number 5129835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A clustering algorithm based on maximal \(\varTheta\)-distant subtrees |
scientific article; zbMATH DE number 5129835 |
Statements
A clustering algorithm based on maximal \(\varTheta\)-distant subtrees (English)
0 references
26 February 2007
0 references
maximal \(\Theta\)-distant subtree
0 references
minimal spanning tree
0 references
clustering algorithm
0 references
threshold cutting
0 references
number of clusters
0 references
0.7904159426689148
0 references
0.7465969920158386
0 references
0.7427766919136047
0 references
0.7421644330024719
0 references
