Changes between Version 16 and Version 17 of GSoC/Ideas
 Timestamp:
 03/10/11 16:13:04 (3 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

GSoC/Ideas
v16 v17 41 41 == Improve kNearest Neighbors == 42 42 43 For n training and m test examples standard kNN checks the distances to all n training for each test examples. The time complexity is thus O(n*m).44 With a smarter implementation this can be improved.43 For n training and m test examples with d attributes standard kNN checks the distances to all n training for each test examples. The time complexity is thus O(d*n*m). 44 With a smarter implementation and/or under special conditions (e.g. Euclidean distance) this can be improved. 45 45 46 46 Useful skills: Python and C.