Get Started
Home
Topics
Search
Library
Research questionHow can attribute hypergraphs refine frozen graph-clustering assignments without labels or altering the model or original graph?After training, correcting graph-clustering assignments without retraining leaves few available signals. Higher-order relations in node attributes may help, but indiscriminate updates can introduce erroneous changes.
AI
Machine Learning
Research Paper
Statistical Machine Learning
Technology
Latest papersRecent research connected to this question, newest first.Selective Hypergraph Refinement for Frozen Graph ClusteringThe study evaluates selective assignment refinement using an attribute hypergraph, graph structure, node attributes, and matched-null evidence. Evidence comes from controlled common-suite and native-interface evaluations, with heterogeneous effects across backbone–dataset pairs and some exposure to negative transfer.research paper · Sep 3, 2026
Related questions
How can we distill text-attributed graph data without sacrificing joint text-and-structure performance?How can we detect anomalous higher-order associations in hypergraphs without labeled examples?How can one released graph dataset resist learning across multiple downstream graph tasks?How can we learn sparse symmetric similarity graphs that are doubly stochastic and enforce a chosen number of clusters?