Question

We want to evaluate the runtime performance of a randomized pattern recognition algorithm by comparing it to a known algorithm that has an average runtime performance of 17 with a standard deviation of 6. To do this comparison, we pick 10 images that we can apply the algorithm to and run the randomized algorithm 15 times on each, resulting in the following 10 average runtime performances (one average per image): {16.5, 17.9, 15.9, 17, 17.3, 17.1, 15.7, 16.6, 16.4, 16.1}.

Evaluate the significance of the hypothesis that the randomized algorithm has a lower average runtime than the known comparison algorithm. As before, explain and list your
calculations, test choices, and conclusion drawn.

Answer 1

Given = H, n-- 10 6- 6. [X= ña IX 166.5 , 166.5 - 16.65 lo Hoiua 17 vis the ML 17. under Hog Test statistic is. au 16.65 -17 2 ois = 6ITO = -0.18 Here we used 2. distribution beleuse is unknown x = 0.05 criticed value. Za 20.05 = -1.645 6: 23 Zirit, Fail to Reject Hog. There is not enough evidance to conclude that Randomised algorithm lover the average Runtime