Skip to content

An Integration of Fuzzy-Enhanced Heterophilic Graph Representation Learning for Improving Performance of Link Prediction

Oct 2026 · Vol 57, pp. 2084 - 2112 · 5 citations · 21 references

TL;DR

Extensive experiments ensure that FHGE consistently outperforms state-of-the-art baselines and demonstrate the power of fuzzy-driven learning in improving graph embedding quality and establish FHGE as a promising solution for real-world link prediction tasks.

View source

Similar papers

#machine learning Preprint Sep 2026

Learning the Graph and the Embedding Together: Classifier-Independent Rewiring for Heterophilic Node Classification

An affinity-guided rewiring method that estimates the graph and the node representation together and alternates, in the spirit of expectation maximisation, between training a lightweight graph neural network on the current graph and re-weighting candidate edges under a modularity objective with a pseudo-label homophily...

Harshit Kumar, Sujan Chakraborty, Priyanka Saha et al. · 0 citations

Heterophily-Aware Node Classification in Multiplex Graphs

This work proposes HAAM, an adaptive node classification approach for multiplex graphs that models per-dimension degrees of homophily and heterophily through dimension-specific compatibility matrices, and shows that HAAM achieves competitive performance compared to representative baseline methods.

K. Abdous, Nairouz Mrabah, Mohamed Bouguessa · 0 citations
Open access Aug 2026

Hybrid-HGT: A unified deep learning framework for community detection in heterogeneous attributed graphs

A combined HGT-based framework incorporating contrastive representation learning and deep clustering with multi-round training via pseudo-labels is presented, enabling the model to better deal with label scarcity, heterogeneous dependencies, and overlapping semantics in practical, complex, attributed networks.

Hamza Haddad, Hicham Attariuas, A. Younes · 0 citations
#machine learning Preprint Sep 2026

HERALD: High-Fidelity Exemplar Retrieval with Adaptive Landmark Distillation for Heterophily-Aware Graph Condensation

Graph condensation aims to produce a small surrogate graph that preserves the downstream node-classification performance of a much larger original graph. Existing methods rely on Weisfeiler-Lehman neighbourhood aggregation or gradient-based distribution matching, both of which assume that adjacent nodes share the same...

Sujan Chakraborty, Priyanka Saha, S. Bej · 0 citations
Book Open access Aug 2026

Rethinking Generalization in Graphs: A Hierarchical Interaction Perspective for Generalist Detection

Hierarchical Interaction MOdeling for zero-shot generalist GAD enables anomaly detection across diverse graph domains without retraining or access to target-domain supervision by modeling the evolutionary trajectories of node representations across hierarchical structural depths, thereby capturing interaction patterns...

Xiang-Ping Zheng, Xuan Feng, Bo Wu et al. · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.