Research map / Graph learning / Graph self-supervised learning
CLUHCS:Dual-View Contrastive Learning Enabled Unsupervised Heterogeneous Community Search with Meta-Path Behavior Modeling
Xiaoqin Xie, Bin Zhao, Mingzhu Chang, Shuai Han, Wu Yang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use PathSim-selected positive samples instead of all meta-path neighbors (CLUHCS-A) (ablation) | CLUHCS · ACM and DBLP | precision, recall, F1, Jaccard | Improved |
| use PathSim-selected positive samples instead of all meta-path neighbors (CLUHCS-A) (ablation) | CLUHCS · IMDB | precision, recall, F1, Jaccard | No clear effect |
| add positive sampling from meta-path neighbors (vs none, CLUHCS-Z) (ablation) | CLUHCS · ACM, DBLP, IMDB | all metrics | Improved |
| add the meta-path view (vs CLUHCS-MP) (ablation) | CLUHCS · ACM, DBLP, IMDB | F1, Jaccard | Improved |
| add the relation view (vs CLUHCS-Rel) (ablation) | CLUHCS · ACM, DBLP, IMDB | F1, Jaccard | Improved |
| use ESG greedy search instead of clustering or top-k search over fixed embeddings (ablation) | CLUHCS search layer · fixed embeddings | community quality | Improved |
| vary hop count K (ablation) | CLUHCS · ACM, DBLP, IMDB | F1, Jaccard: optimal K=6 (ACM), K=4 (DBLP), K=7 (IMDB) | Mixed |
| raise PathSim sampling threshold mu (ablation) | CLUHCS · ACM vs DBLP and IMDB | F1, Jaccard: ACM best at mu=0.8; DBLP and IMDB best at mu=0.1 | Mixed |
| raise cohesion parameter omega (ablation) | CLUHCS · ACM, DBLP, IMDB | precision, recall, F1: DBLP peaks at omega=0.5 | Mixed |
| use CLUHCS instead of supervised FCS-HGNN variants | community search · DBLP | precision | Improved |
Closest papers by meaning
- SLRL: Semi-Supervised Local Community Detection Based on Reinforcement Learning (AAAI 2025 · similarity 0.86)
- Long-range Meta-path Search on Large-scale Heterogeneous Graphs (NeurIPS 2024 · similarity 0.85)
- An Efficient Local Search Approach for Polarized Community Discovery in Signed Networks (NeurIPS 2025 · similarity 0.85)
- Learning Persistent Community Structures in Dynamic Networks via Topological Data Analysis (AAAI 2024 · similarity 0.85)
- The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks (NeurIPS 2024 · similarity 0.84)
- Harnessing Multiple Correlated Networks for Exact Community Recovery (NeurIPS 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
