Evidence map›Paper›PMID 28818036›Full record

ArticleBMC bioinformatics2017

eccCL: parallelized GPU implementation of Ensemble Classifier Chains.

Mona Riemenschneider, Alexander Herbst, Ari Rasch, Sergei Gorlatch, Dominik Heider

Abstract read
In one paragraph

Article in BMC bioinformatics, 2017. 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

5 authors.

Mona RiemenschneiderDepartment of Bioinformatics, Straubing Center of Science, Petersgasse 18, Straubing, 94315, Germany.
Alexander HerbstInstitute of Computer Science, University of Münster, Einsteinstr. 62, Münster, 48149, Germany.
Ari RaschInstitute of Computer Science, University of Münster, Einsteinstr. 62, Münster, 48149, Germany.
Sergei GorlatchInstitute of Computer Science, University of Münster, Einsteinstr. 62, Münster, 48149, Germany.
Dominik HeiderDepartment of Bioinformatics, Straubing Center of Science, Petersgasse 18, Straubing, 94315, Germany. d.heider@wz-straubing.de.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundMulti-label classification has recently gained great attention in diverse fields of research, e.g., in biomedical application such as protein function prediction or drug resistance testing in HIV. In this context, the concept of Classifier Chains has been shown to improve prediction accuracy, especially when applied as Ensemble Classifier Chains. However, these techniques lack computational efficiency when applied on large amounts of data, e.g., derived from next-generation sequencing experiments. By adapting algorithms for the use of graphics processing units, computational efficiency can be greatly improved due to parallelization of computations.

resultsHere, we provide a parallelized and optimized graphics processing unit implementation (eccCL) of Classifier Chains and Ensemble Classifier Chains. Additionally to the OpenCL implementation, we provide an R-Package with an easy to use R-interface for parallelized graphics processing unit usage.

conclusioneccCL is a handy implementation of Classifier Chains on GPUs, which is able to process up to over 25,000 instances per second, and thus can be used efficiently in high-throughput experiments. The software is available at http://www.heiderlab.de .

Indexed as

High-Throughput Nucleotide SequencingSoftwareAlgorithmsComputer GraphicsClassifier chainsHigh performance computingMulti label classification

Identifiers

PMID28818036
PMCPMC5561639

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.