Description Usage Arguments Value Examples
View source: R/optimise_window_length.R
This function optimises the number of elements per window
that is used in calculate_expression_similarity_counts
, by requiring
the distribution of correlations/distances to stabilise to a
uniform distribution. The Jensen-Shannon divergence is used to assess
the stability.
1 2 3 4 5 6 7 8 9 10 11 |
expression.matrix |
expression matrix, can be normalized or not |
similarity.measure |
one of the correlation or distance metrics to be used,
defaults to pearson correlation; list of all methods in
|
window.length.min, window.length.max, window.length.by |
definition of the parameter search space; default is between 1% and 33% of the number of rows in the expression matrix, incremented by 1% |
n.step.fraction |
step size to slide across, as a fraction of the window length; default is 5% |
iteration.number |
number of iterations for the subsampling and calculation of JSE; subsampling is needed because shorter windows have fewer points; default is 100 |
minimum.similar.windows |
number of windows that a window needs to be similar to (including itself) in order to be accepted as optimal; default is 3, but can be reduced to 2 if no optimum is found |
save.plot |
name of the pdf in which to print the output plot showing the distribution of JSE by window; output to the console by default |
A single value of the optimal number of elements per window. If no optimal value was found, this function returns NULL.
1 2 3 4 | optimise_window_length(
matrix(1:100+runif(100), ncol=5, byrow=TRUE),
window.length.min=3, window.length.max=5, iteration.number=5
)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.