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 unsupervised-learning
Search options not deleted
user 282265
Finding hidden (statistical) structure in unlabelled data, including clustering and feature extraction for dimensionality reduction.
1
vote
1
answer
477
views
What happens when $k=1$ in k-means? What's the optimized value of distance for $k=1$?
What is the optimized value of distance $V(x,c)$ when $k=1$ (number of clusters) in k-means? What is the centroid such that it is optimal?
$$V(x,c) = \sum_j \sum_{x_i \rightarrow c_j} D(x_i,c_j)^2$$
w …
- 121