Skip to main content


Fig. 4 | BMC Bioinformatics

Fig. 4

From: Automated prostate tissue referencing for cancer detection and diagnosis

Fig. 4

Tissue Retrieval Performance. The number of queries retrieving at least N G number of good matches by our system (Ranking-SVM), out of T retrieved samples, is computed (N G  = 1, …, T), and compared to a the random chance (R0 ~ R9) and c kNN retrieval (K0 ~ K9) obtaining that number of good matching cases. The frequency and cumulative density of similarity scores are plotted for b the entire training samples and T matching samples by our system, respectively. d The frequency and cumulative density are also plotted for kNN retrieval. A good matching case is defined as a pair of samples whose similarity score is ≥ th s th s  = 0, …, 8. Random chance of retrieving ≥ N G good matching cases is computed as \( \Pr \left(X\ge {N}_G\right)={\displaystyle {\sum}_{x\ge {N}_G}\frac{\left(\begin{array}{c}\hfill {N}_{ss}\hfill \\ {}\hfill x\hfill \end{array}\right)\left(\begin{array}{c}\hfill {N}_s-{N}_{ss}\hfill \\ {}\hfill T-x\hfill \end{array}\right)}{\left(\begin{array}{c}\hfill m\hfill \\ {}\hfill T\hfill \end{array}\right)}} \) where N S and N SS denote the number of samples in the database and the number of samples whose TMS with the query ≥ th s , respectively

Back to article page