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 clustering
Search options not deleted
user 46598
Cluster analysis is the task of partitioning data into subsets of objects according to their mutual "similarity," without using preexisting knowledge such as class labels. [Clustered-standard-errors and/or cluster-samples should be tagged as such; do NOT use the "clustering" tag for them.]
1
vote
Accepted
Clustering based on large Jensen-Shannon Divergence distance matrix
I solved my R PAM clustering memory consumption issue by:
increasing AWS (Amazon Web Services) instance memory
changing JSD distance matrix elements from numerical to integer:
jsd_dist_int <- as.matrix …
- 151
4
votes
3
answers
4k
views
Clustering based on large Jensen-Shannon Divergence distance matrix
I’m applying R implementation of Partitioning Around Medoids (PAM) clustering to my JSD distance matrix. … So my question is: which clustering algorithm is the most reasonable to use given that I have very good JSD distance matrix to feed in already. …
- 151