Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with dendrogram
Search options not deleted
user 78003
A dendrogram (or tree diagram) is a graph used to represent relationships in hierarchical clustering.
5
votes
2
answers
472
views
How to specify K cluster in Hierarchical clustering with noisy data?
I'm new in Mining and Clustering and I wonder how to cut off the hierarchical clustering Dendrogram to obtain a specific number of clusters. … The problem is here that the data is noisy and the SLINK algorithm consider these noises as a cluster and when I cut off the Dendrogram to obtain exactly K cluster, it gives me some noisy cluster and so …
- 163