Timeline for Does this algorithm terminate in all scenarios?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 21, 2013 at 16:07 | history | edited | Andrés E. Caicedo | CC BY-SA 3.0 |
added 4 characters in body; edited title
|
| Nov 21, 2013 at 12:10 | vote | accept | shna | ||
| Nov 21, 2013 at 12:10 | history | edited | shna | CC BY-SA 3.0 |
added 5 characters in body; edited title
|
| Nov 21, 2013 at 8:27 | comment | added | Hugo van der Sanden | Ok, presumably it needs an extra termination check for |A| <= k after step 2 then; from your example, I also infer that d_x^(A,k) is intended to be defined over the k nearest points in A excluding x itself otherwise we have d_x^(A,1) = 0 whenever x is in A. | |
| Nov 21, 2013 at 8:09 | comment | added | shna | @HugovanderSanden if steps (2) and (3) are reversed the algorithm do note terminate. For instance in p = 1 dimension with k = 1, if A = {0, 3} and B = {2, 5} then elements of A and B will swap between A and B at each iteration. This is why, it is asymmetrical, as written. | |
| Nov 21, 2013 at 1:25 | comment | added | Hugo van der Sanden | Is the algorithm intended to be asymmetrical, as written? I'd have expected steps (2) and (3) to be reversed, so that the evaluation of A' and B' are acting symmetrically over the full set of n+m vectors. | |
| Nov 20, 2013 at 21:57 | answer | added | MvG | timeline score: 2 | |
| Nov 20, 2013 at 16:39 | history | asked | shna | CC BY-SA 3.0 |