Evidence map›Paper›PMID 30367594›Full record

ArticleBMC bioinformatics2018

A GPU-based algorithm for fast node label learning in large and unbalanced biomolecular networks.

Marco Frasca, Giuliano Grossi, Jessica Gliozzo, Marco Mesiti, Marco Notaro, Paolo Perlasca, Alessandro Petrini, Giorgio Valentini

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed, 1 pooled it
0.1field-weighted citation impact, top 51% of its field
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

2 citing papers in PubMed, 1 synthesis or guideline pooled it, 3 citations in OpenAlex.

  1. Pooled it
  2. 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

8 authors at 2 institutions in 1 country.

Marco FrascaAnacletoLab - Department of Computer Science, Università degli Studi di Milano, Via Comelico 39, Milano, 20135, Italy. frasca@di.unimi.it.
Giuliano GrossiAnacletoLab - Department of Computer Science, Università degli Studi di Milano, Via Comelico 39, Milano, 20135, Italy.
Jessica GliozzoDepartment of Dermatology, Fondazione IRCCS Ca' Granda,, Ospedale Maggiore Policlinico, Milan, 20122, Italy.
Marco MesitiAnacletoLab - Department of Computer Science, Università degli Studi di Milano, Via Comelico 39, Milano, 20135, Italy.
Marco NotaroAnacletoLab - Department of Computer Science, Università degli Studi di Milano, Via Comelico 39, Milano, 20135, Italy.
Paolo PerlascaAnacletoLab - Department of Computer Science, Università degli Studi di Milano, Via Comelico 39, Milano, 20135, Italy.
Alessandro PetriniAnacletoLab - Department of Computer Science, Università degli Studi di Milano, Via Comelico 39, Milano, 20135, Italy.
Giorgio ValentiniAnacletoLab - Department of Computer Science, Università degli Studi di Milano, Via Comelico 39, Milano, 20135, Italy.
University of Milan · ITFondazione IRCCS Ca' Granda Ospedale Maggiore Policlinico · IT

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundSeveral problems in network biology and medicine can be cast into a framework where entities are represented through partially labeled networks, and the aim is inferring the labels (usually binary) of the unlabeled part. Connections represent functional or genetic similarity between entities, while the labellings often are highly unbalanced, that is one class is largely under-represented: for instance in the automated protein function prediction (AFP) for most Gene Ontology terms only few proteins are annotated, or in the disease-gene prioritization problem only few genes are actually known to be involved in the etiology of a given disease. Imbalance-aware approaches to accurately predict node labels in biological networks are thereby required. Furthermore, such methods must be scalable, since input data can be large-sized as, for instance, in the context of multi-species protein networks.

resultsWe propose a novel semi-supervised parallel enhancement of COSNET, an imbalance-aware algorithm build on Hopfield neural model recently suggested to solve the AFP problem. By adopting an efficient representation of the graph and assuming a sparse network topology, we empirically show that it can be efficiently applied to networks with millions of nodes. The key strategy to speed up the computations is to partition nodes into independent sets so as to process each set in parallel by exploiting the power of GPU accelerators. This parallel technique ensures the convergence to asymptotically stable attractors, while preserving the asynchronous dynamics of the original model. Detailed experiments on real data and artificial big instances of the problem highlight scalability and efficiency of the proposed method.

conclusionsBy parallelizing COSNET we achieved on average a speed-up of 180x in solving the AFP problem in the S. cerevisiae, Mus musculus and Homo sapiens organisms, while lowering memory requirements. In addition, to show the potential applicability of the method to huge biomolecular networks, we predicted node labels in artificially generated sparse networks involving hundreds of thousands to millions of nodes.

Indexed as

AlgorithmsComputer GraphicsGene Regulatory NetworksAnimalsGene OntologyHumansMiceProtein Interaction MapsProteinsSaccharomyces cerevisiaeTime FactorsProteinsBiological networksGPU-based Hopfield netsLarge-sized networksNode label predictionProtein function prediction

Identifiers

PMID30367594
PMCPMC6191976
OpenAlexW2897989287

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.