Evidence map›Paper›PMID 38227587›Full record

ArticlePloS one2024

Geometric Deep Learning sub-network extraction for Maximum Clique Enumeration.

Vincenza Carchiolo, Marco Grassia, Michele Malgeri, Giuseppe Mangioni

Abstract read
In one paragraph

Article in PloS one, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

4 authors.

Vincenza CarchioloDipartimento Ingegneria Elettrica Elettronica Informatica Università di Catania, Catania, Italy.ORCID 0000-0002-1671-840X
Marco GrassiaDipartimento Ingegneria Elettrica Elettronica Informatica Università di Catania, Catania, Italy.ORCID 0000-0001-5841-6058
Michele MalgeriDipartimento Ingegneria Elettrica Elettronica Informatica Università di Catania, Catania, Italy.
Giuseppe MangioniDipartimento Ingegneria Elettrica Elettronica Informatica Università di Catania, Catania, Italy.ORCID 0000-0001-6910-0112

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The paper presents an algorithm to approach the problem of Maximum Clique Enumeration, a well known NP-hard problem that have several real world applications. The proposed solution, called LGP-MCE, exploits Geometric Deep Learning, a Machine Learning technique on graphs, to filter out nodes that do not belong to maximum cliques and then applies an exact algorithm to the pruned network. To assess the LGP-MCE, we conducted multiple experiments using a substantial dataset of real-world networks, varying in size, density, and other characteristics. We show that LGP-MCE is able to drastically reduce the running time, while retaining all the maximum cliques.

Indexed as

Deep LearningAlgorithmsMachine LearningMathematics

Identifiers

PMID38227587
PMCPMC10790985

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.