Lin Mu, Li Ni, Longlong Lin, Shuaikang Zeng
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Contrastive learning has demonstrated strong performance in attributed hypergraph clustering. Typically, existing methods based on contrastive learning first learn node embeddings and then apply clustering algorithms, such as k-means, to these embeddings to obtain the clustering results. However, these methods lack direct clustering supervision, risking the inclusion of clustering-irrelevant information in the learned graph. To this end, we propose a Contrastive learning approach for Attributed Hypergraph Clustering (CAHC), an end-to-end method that simultaneously learns node embeddings and obtains clustering results. CAHC consists of two main steps: representation learning and cluster assignment learning. The former employs a novel contrastive learning approach that incorporates both node-level and hyperedge-level objectives to generate node embeddings. The latter joint embedding and clustering optimization to refine these embeddings by clustering-oriented guidance and obtains clustering results simultaneously. Extensive experimental results demonstrate that CAHC outperforms baselines on eight datasets. • Theory of computation → Unsupervised learning and clustering; • Mathematics of computing → Hypergraphs.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2603.09370")
get_code_for_paper("2603.09370")
have("2603.09370")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2603.09370.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2603.09370)
Connect an agent — have() is free.