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 machine-learning
Search options not deleted
user 228701
Machine learning algorithms build a model of the training data. The term "machine learning" is vaguely defined; it includes what is also called statistical learning, reinforcement learning, unsupervised learning, etc. ALWAYS ADD A MORE SPECIFIC TAG.
0
votes
1
answer
146
views
Densest subgraph : density of an intersection
I found an exercice in my textbook and I can't find the answer :
$G = (V;E)$ an undirected graph.
$H_1 = (V_1;E_1)$ and $H_2 = (V_2;E_2)$ are two densest subgraphs in G, i.e., for any subgraph $H = …
- 1
0
votes
1
answer
148
views
Questions about a k-means variant : recompute centroids after each point is reasigned
I have a variant of k-means, where the points are reassigned incrementally and I have a few questions about it.
Each time we reassign a point (we move the point from cluster $C_1 $to
$C_2$), we …
- 1