(a) Determine the value of FN and FP in Table 1. (4pt)

題組內容

2. The data of Table 1 are taken from a study investigating the use of a deep learning method as a diagnostic tool for detecting lung cancer. It is known that the sensitivity and specificity of this method are approximately 0.628 and 0.823, respectively.

1. Given integers m, n, and an integer array arr[m][n] filled with non-negative integers, use dynamic programming technique to implement a program to find a path from top-left to bottom-right which minimizes the sum of all numbers along the path. You can only move down or right at any point. Your program only needs to output the sum. A sample test case input is given below. Implement your program in C, C++, Java, or Python. Note: The sample solution walks from the top-left in the order： 4 → 1 → 1 → 0 → 0 → 4

題組內容

(a) Determine the value of FN and FP in Table 1. (4pt)

相關申論題

相關試卷