Evidence map›Paper›PMID 37420429›Full record

ArticleEntropy (Basel, Switzerland)2022

Auxiliary Graph for Attribute Graph Clustering.

Wang Li, Siwei Wang, Xifeng Guo, Zhenyu Zhou, En Zhu

Abstract read
In one paragraph

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

5 authors.

Wang LiSchool of Computer, National University of Defense Technology, Changsha 410000, China.
Siwei WangSchool of Computer, National University of Defense Technology, Changsha 410000, China.ORCID 0000-0001-9517-262X
Xifeng GuoSchool of Cyberspace Science, Dongguan University of Technology, Dongguan 523808, China.
Zhenyu ZhouSchool of Computer, National University of Defense Technology, Changsha 410000, China.
En ZhuSchool of Computer, National University of Defense Technology, Changsha 410000, China.ORCID 0000-0003-2305-7555

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Attribute graph clustering algorithms that include topological structural information into node characteristics for building robust representations have proven to have promising efficacy in a variety of applications. However, the presented topological structure emphasizes local links between linked nodes but fails to convey relationships between nodes that are not directly linked, limiting the potential for future clustering performance improvement. To solve this issue, we offer the Auxiliary Graph for Attribute Graph Clustering technique (AGAGC). Specifically, we construct an additional graph as a supervisor based on the node attribute. The additional graph can serve as an auxiliary supervisor that aids the present one. To generate a trustworthy auxiliary graph, we offer a noise-filtering approach. Under the supervision of both the pre-defined graph and an auxiliary graph, a more effective clustering model is trained. Additionally, the embeddings of multiple layers are merged to improve the discriminative power of representations. We offer a clustering module for a self-supervisor to make the learned representation more clustering-aware. Finally, our model is trained using a triplet loss. Experiments are done on four available benchmark datasets, and the findings demonstrate that the proposed model outperforms or is comparable to state-of-the-art graph clustering models.

Indexed as

attribute graphauxiliary graphclusteringgraph networks

Identifiers

PMID37420429
PMCPMC9602437

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.