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 227027
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
1
answer
77
views
Does PCA preserve convexity of a space?
I have a cluster $C$ of points in a high dimensional space $\mathbb R^n$. I want to know whether this cluster is convex or not. How can i study this? I thought of projecting $C$ on $\mathbb R^2$ to vi …
- 345
0
votes
1
answer
2k
views
Compute the accuracy of a clustering algorithm
I have a set of points that I have clustered using a clustering algorithm (k-means in this case). I also know the ground-truth labels and I want to measure how accurate my clustering is. … Many metrics are good for explaining the quality of clustering, and I've used them before, but they are not what I need now. …
- 345
6
votes
2
answers
2k
views
Understand important features in UMAP
I am using a dimensionality reduction algorithm (UMAP) to cluster high-dimensional data.
Particularly, I have ~50000 vectors of dimension ~20000 to visualise. These vectors are highly structured: Th …
- 345