Skip to content

Commit

Permalink
tests concluded
Browse files Browse the repository at this point in the history
  • Loading branch information
jeffersonfparil committed Apr 16, 2024
1 parent d23c802 commit be9c6d1
Showing 1 changed file with 1 addition and 6 deletions.
7 changes: 1 addition & 6 deletions res/perf.md
Original file line number Diff line number Diff line change
Expand Up @@ -485,9 +485,4 @@ time Rscript perf_plot.R \

## Take-home message

The adaptive LD-kNN imputation algorithm works reasonably well even across the entire range of sparsity levels (0.1% to 90% missing data).

Note that the discrepancy between our imputation algorithm and LinkImpute's algorithm in the context of imputing binary genotypes is attributed to 3 differences:
- the main one is our optimisation per locus, i.e. per locus with at least one pool missing allele frequencies, we simulate pools to be missing data and perform a pseudo-grid search across combinations of the `min_loci_corr` and `max_pool_dist` threshold values which breaks out of the inner loop (`max_pool_dist`) if estimated MAE is larger than the current lowest MAE, then continues the outer loop to restart the inner looop and so on.
- the use of mean weighted allele frequencies in our case and weighted mode genotype class in LinkImpute, and
- the use of mean absolute error to measure accuracy in our case and concordance in LinkImpute.
The allele frequency LD-kNN imputation algorithm works well across the entire range of sparsity levels (0.1% to 90% missing data).

0 comments on commit be9c6d1

Please sign in to comment.