arXiv (All)
open access
Selective Hypergraph Refinement for Frozen Graph Clustering
Existing graph-clustering methods typically improve clustering performance by optimizing model parameters and node representations. Effective means of further improving the clustering results of an already trained and frozen model, however, remain limited. We study post-processing for frozen graph c
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- How to Achieve the Intended Aim of Deep Clustering Now, without Deep Learning#670483
- How to Achieve the Intended Aim of Deep Clustering Now, without Deep Learning#668418
- SynCo: Synthetic Community-Aware Attributed Graph Generator for Graph Neural Network Benchmarking#997734
- A new completely parameter-free clustering algorithm for unsupervised classification of BATSE gamma-ray bursts#238625
- CRAB: A Novel Clustering Score using Clustering with Rivals and Buddies for Unsupervised Learning#279743
Record · ID 925616
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive