LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering

2024-05-20 · Li Sun, Zhenhao Huang, Hao Peng, Yujie Wang, Chunyang Liu, Philip S. Yu

Graph clustering is a fundamental problem in machine learning. Deep learning methods achieve the state-of-the-art results in recent years, but they still cannot work without predefined cluster numbers. Such limitation motivates us to pose a more challenging problem of graph clustering with unknown cluster number. We propose to address this problem from a fresh perspective of graph information theory (i.e., structural information). In the literature, structural information has not yet been introduced to deep clustering, and its classic definition falls short of discrete formulation and modeling node features. In this work, we first formulate a differentiable structural information (DSI) in the continuous realm, accompanied by several theoretical results. By minimizing DSI, we construct the optimal partitioning tree where densely connected nodes in the graph tend to have the same assignment, revealing the cluster structure. DSI is also theoretically presented as a new graph clustering objective, not requiring the predefined cluster number. Furthermore, we design a neural LSEnet in the Lorentz model of hyperbolic space, where we integrate node features to structural information via manifold-valued graph convolution. Extensive empirical results on real graphs show the superiority of our approach.

📄 PDF Abstract BibTeX arXiv:2405.11801

Code (1)

ZhenhHuang/LSEnet 공식 구현 pytorch

Tasks

ClusteringDeep Clustering Graph Clustering

Unsupervised Graph Clustering with Deep Structural Entropy

2025-05-20 · Jingyun Zhang, Hao Peng, Li Sun, Guanlin Wu 외

Research on Graph Structure Learning (GSL) provides key insights for graph-based clustering, yet current methods like Graph Neural Networks (GNNs), Graph Attention Networks (GATs), and contrastive learning often rely hea…

Clustering Contrastive Learning Graph Attention Graph Clustering+1

Hyperbolic Continuous Structural Entropy for Hierarchical Clustering

2025-11-29 · Guangjie Zeng, Hao Peng, Angsheng Li, Li Sun 외 arxiv

Hierarchical clustering is a fundamental machine-learning technique for grouping data points into dendrograms. However, existing hierarchical clustering methods encounter two primary challenges: 1) Most methods specify d…

Graph structure learning

Breaking Structural Isolation: Scalable Graph Clustering via Community-Aware Sampling and Structural Entropy

2026-07-06 · Jingyun Zhang, Hao Peng, Jianxin Li, Angsheng Li 외 arxiv

Unsupervised graph clustering is a fundamental technique for uncovering underlying semantic patterns in large-scale networks. Although Graph Contrastive Learning has demonstrated promising performance, existing methods o…

Contrastive Learning Graph Clustering

FlatLand: Personalized Graph Federated Learning via Tailored Lorentz Space

2026-08-21 · Jiahong Liu, Ram Samarth B B, Xinyu Fu, Menglin Yang 외 arxiv

Federated learning enables privacy-preserving collaborative training, but highly heterogeneous client data remain challenging, especially in graph federated learning where clients possess structurally diverse graphs. Exi…

Personalized Federated Learning Graph Learning

USER: Unsupervised Structural Entropy-based Robust Graph Neural Network

2023-02-12 · Yifei Wang, Yupan Wang, Zeyu Zhang, Song Yang 외

Unsupervised/self-supervised graph neural networks (GNN) are vulnerable to inherent randomness in the input graph data which greatly affects the performance of the model in downstream tasks. In this paper, we alleviate t…

Graph Neural Network Link Prediction Node Clustering