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 clara
Search options not deleted
user 46598
clara refers to Clustering LARge Applications, a partitioning method to deal with large datasets.
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.m …
- 151
4
votes
3
answers
4k
views
Clustering based on large Jensen-Shannon Divergence distance matrix
I’m looking for alternative implementations. k-means doesn’t work with other distance metrics than eucleidean, R clara works only with eucleidean and manhattan distance matrices. … Sparks do not support pam or clara yet.
Will this proposal https://stats.stackexchange.com/a/12503/46598 work
for transforming my JSD distance matrix to eucleidean distance
matrix? …
- 151