Evidence map›Paper›PMID 41978770›Full record

ArticleFrontiers in genetics2026

A graph clustering algorithm with hypergraph learning and a core-attachment strategy for protein complex identification.

Jie Wang, Xiancan Yang, Pengbo Yang, Jian Yang, Yangyang Miao

Abstract read
In one paragraph

Article in Frontiers in genetics, 2026. 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.

Jie WangSchool of Information, Shanxi University of Finance and Economics, Taiyuan, China.
Xiancan YangSchool of Information, Shanxi University of Finance and Economics, Taiyuan, China.
Pengbo YangSchool of Information, Shanxi University of Finance and Economics, Taiyuan, China.
Jian YangSchool of Information, Shanxi University of Finance and Economics, Taiyuan, China.
Yangyang MiaoSchool of Information, Shanxi University of Finance and Economics, Taiyuan, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Protein complexes play a crucial role in cellular biological processes. Identifying these complexes is essential for understanding cellular functions and biological mechanisms. Graph clustering approaches to identify protein complexes in protein-protein interaction (PPI) networks have become a significant research hotspot in data mining and bioinformatics. Many graph clustering methods have been developed for protein complex identification. However, most existing methods only utilize original networks to discover dense subgraphs and ignore higher-order topological characteristics. Considering the prevalent multi-relational and complex interactions in biological networks, a graph clustering algorithm based on hypergraph learning and a core-attachment strategy is proposed for protein complex identification, called HLCA. Hypergraph networks are employed to directly model multi-relational interactions. Based on this method, a multi-level hypergraph is used as higher-order topology and a core-attachment strategy are adopted to identify protein complexes. Firstly, the original PPI network is transformed into a hypergraph network. Secondly, a hierarchical compression strategy is applied to recursively compress the hypergraph into smaller hypergraphs at various levels, forming a multi-level analytical framework. Thirdly, hypergraph convolution is performed across different hierarchical levels to obtain node representations at each level. These node representations are then combined to produce complete node embeddings. Based on these node embeddings, a weighted PPI network is constructed by cosine similarity from the original PPI network. Core clusters are obtained in this weighted network by cluster density. Finally, remaining protein nodes are added to the core clusters using a core-attachment strategy combining hyperedge density and overlap. The effectiveness of HLCA is evaluated by comparing it with other protein complex identification methods on multiple datasets. Experimental results show that the proposed method outperforms comparison methods regarding F-measure and Accuracy.

Indexed as

graph clusteringgraph embeddinghypergraph learningprotein complexesprotein-protein interaction networks

Identifiers

PMID41978770
PMCPMC13070537

What Socratic 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 Socratic graph.