Evidence map›Paper›PMID 24358057›Full record

ArticleEvolutionary intelligence2013

A Multi-Core Parallelization Strategy for Statistical Significance Testing in Learning Classifier Systems.

James Rudd, Jason H Moore, Ryan J Urbanowicz

Abstract read
In one paragraph

Article in Evolutionary intelligence, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

James RuddDartmouth College, 1 Medical Center Dr., Lebanon, NH 03755,USA, james.e.rudd.gr@dartmouth.edu.
Jason H MooreDartmouth College, 1 Medical Center Dr., Lebanon, NH 03755,USA, jason.h.moore@dartmouth.edu.
Ryan J UrbanowiczDartmouth College, 1 Medical Center Dr., Lebanon, NH 03755,USA, ryan.j.urbanowicz@dartmouth.edu.

Funding

Quantitative Biology Research InstituteP20GM103534 · NIGMS · DARTMOUTH COLLEGE · PI AMOS, CHRISTOPHER I. · 2012 to 2016
$8.6M
Bioinformatics Strategies for Genome-Wide Association StudiesR01LM010098 · NLM · UNIVERSITY OF PENNSYLVANIA · PI MOORE, JASON H., WILLIAMS, SCOTT MATTHEW · 2009 to 2023
$5.1M
Machine Learning Prediction of Cancer SusceptibilityR01LM009012 · NLM · UNIVERSITY OF PENNSYLVANIA · PI MOORE, JASON H. · 2006 to 2014
$3.3M
Bioinformatics Strategies for Multidimensional Brain Imaging GeneticsR01LM011360 · NLM · INDIANA UNIVERSITY INDIANAPOLIS · PI MOORE, JASON H., SAYKIN, ANDREW J · 2012 to 2015
$1.4M
NIGMS NIH HHS P20 GM103534NLM NIH HHS R01 LM009012NLM NIH HHS R01 LM010098NLM NIH HHS R01 LM011360
6 · The paper itself

Abstract

Permutation-based statistics for evaluating the significance of class prediction, predictive attributes, and patterns of association have only appeared within the learning classifier system (LCS) literature since 2012. While still not widely utilized by the LCS research community, formal evaluations of test statistic confidence are imperative to large and complex real world applications such as genetic epidemiology where it is standard practice to quantify the likelihood that a seemingly meaningful statistic could have been obtained purely by chance. LCS algorithms are relatively computationally expensive on their own. The compounding requirements for generating permutation-based statistics may be a limiting factor for some researchers interested in applying LCS algorithms to real world problems. Technology has made LCS parallelization strategies more accessible and thus more popular in recent years. In the present study we examine the benefits of externally parallelizing a series of independent LCS runs such that permutation testing with cross validation becomes more feasible to complete on a single multi-core workstation. We test our python implementation of this strategy in the context of a simulated complex genetic epidemiological data mining problem. Our evaluations indicate that as long as the number of concurrent processes does not exceed the number of CPU cores, the speedup achieved is approximately linear.

Indexed as

AlgorithmsDesignLCSmulti-core processorsparallelizationPerformancescalabilitysignificance testing

Identifiers

PMID24358057
PMCPMC3864178

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.