Evidence map›Paper›PMID 40285289›Full record

ArticleSensors (Basel, Switzerland)2025

Overlapping Community Detection in Vehicular Social Networks Based on Graph Attention Autoencoder.

Xiang Gu, Qiwei Huang, Jie Yang

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2025. 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.

Xiang GuSchool of Artificial Intelligence and Computer Science, Nantong University, Nantong 226019, China.ORCID 0000-0002-2594-4118
Qiwei HuangSchool of Information Science and Technology, Nantong University, Nantong 226019, China.ORCID 0009-0001-6518-0036
Jie YangSchool of Artificial Intelligence and Computer Science, Nantong University, Nantong 226019, China.ORCID 0009-0003-5095-6860

Funding

Nantong University KYCX24_3654
6 · The paper itself

Abstract

Community detection is particularly important in vehicular social networks because it helps identify closely connected groups of vehicles within the network. Community structures with overlapping relationships are identified through network topology and vehicle attribute information, thereby optimizing communication efficiency, supporting resource allocation, and enhancing privacy protection. However, most existing community detection methods focus on non-overlapping communities, usually only considering the topological structure of the network, and often ignoring the attribute information of nodes. To address these problems, this paper proposes a semi-supervised overlapping community detection method based on graph attention autoencoder (CDGAAE). The method consists of three key components: graph attention autoencoder module, modularity optimization enhancement module, and semi-supervised clustering module. First, the graph attention autoencoder module fuses topological information and node attribute information and encodes nodes using a graph attention mechanism. Second, the modularity optimization enhancement module effectively captures the structure of overlapping communities. Finally, the semi-supervised clustering module combines prior information to improve the accuracy of community detection. CDGAAE is comprehensively evaluated on multiple real and synthetic datasets, and experimental results show that CDGAAE outperforms other competing methods.

Indexed as

graph attention autoencoderoverlapping community detectionsemi-supervised clusteringvehicular social networks

Identifiers

PMID40285289
PMCPMC12031285

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.