Description Usage Format Source See Also Examples
Contains results of an example analysis performed with the 'JAMES' extensions module. The performance of two algorithms is compared (random descent and parallel tempering) for a core selection problem in which the mean entry-to-nearest-entry distance is maximized. Four different data sets have been analyzed. Details about the performed analysis are provided at the website (see below).
1 |
S3 object of class "james", as if produced by
readJAMES
.
http://www.jamesframework.org/examples/#analysis
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 | # load data
data(james)
summary(james)
# plot convergence curves for coconut data set
plotConvergence(james, problem = "coconut", min.time = 1000, max.time = 100000)
# create box plots of solution values (quality) and convergence times
boxplot(james, problem = "coconut")
boxplot(james, problem = "coconut", type = "time")
# extract solution values and convergence times for parallel tempering and random descent
values.pt <- getBestSolutionValues(james, problem = "coconut", search = "Parallel Tempering")
times.pt <- getConvergenceTimes(james, problem = "coconut", search = "Parallel Tempering")
values.rd <- getBestSolutionValues(james, problem = "coconut", search = "Random Descent")
times.rd <- getConvergenceTimes(james, problem = "coconut", search = "Random Descent")
# perform wilcoxon test to compare distributions across algorithms
values.test <- wilcox.test(values.pt, values.rd)
values.test
times.test <- wilcox.test(times.pt, times.rd)
times.test
# adjust p-values for multiple testing
p.adjust(c(values.test$p.value, times.test$p.value))
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.