RHEA: Reliability-Harmonized Reconstruction and Assignment for Robust Multimodal-Attributed Graph Clustering

• URL: http://arxiv.org/abs/2608.00621v1
• Date: Sat, 01 Aug 2026 12:24:54 GMT
• Title: RHEA: Reliability-Harmonized Reconstruction and Assignment for Robust Multimodal-Attributed Graph Clustering
• Abstract summary: We propose a reliability-aware framework for Multimodal-attributed graphs (MAGs)<n>RHEA estimates node-specific modality reliability from neighborhood consensus.<n> Experiments show RHEA consistently outperforms the strongest baseline.
• Score: 8.07046263398337
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multimodal-attributed graphs (MAGs), whose nodes carry heterogeneous attributes such as text and images over a relational structure, have become a fundamental substrate for label-free entity grouping tasks, including community discovery and product segmentation. Existing MAG clustering methods effectively integrate complementary modalities when attributes are clean and complete, but degrade substantially under noisy or missing attributes because they implicitly assume equal modality reliability across all nodes. In practice, modality reliability is inherently node-specific: images may be corrupted or absent, while textual descriptions are incomplete or noisy. We argue that, under attribute homophily, graph neighborhoods naturally provide supervision-free evidence for estimating node-specific modality reliability. Based on this insight, we propose RHEA, a reliability-aware framework for MAG clustering that estimates node-specific modality reliability from neighborhood consensus and propagates this signal throughout the clustering pipeline. RHEA reconstructs unreliable or missing modalities from graph neighborhoods, adaptively weights modalities during reliability-aware fusion, and performs topology-aware optimal transport clustering with reliability-aware transport assignment and neighbor-consensus assignment distillation. Furthermore, the confidence of reconstructed representations is incorporated into the clustering objective, allowing uncertain reconstructions to contribute proportionally during optimization. Experiments on four MAG benchmarks under five attribute conditions show that RHEA consistently outperforms the strongest baseline, with NMI gains increasing as attribute quality deteriorates.

Related papers

• Context-aware Modality-Topology Co-Alignment for Multimodal Attributed Graphs [8.922335341563363]
  MultimodalAttributed Graphs (MAGs) model real-world entities by coupling graph topology with heterogeneous attributes such as text and images.<n>Existing MAG methods often rely on fixed graph contexts or uniformly fused representations, causing task-agnostic propagation and over-compressed fusion.<n>We propose CoMAG, a unified MAG that learns task-adaptive reliable contexts and modality-preserving alignment within them.
  arXiv  Detail & Related papers  (2026-06-12T06:53:46Z)
• AnchorMoE: Interpretable Time Series Classification via Anchor-Routed MoE [51.994752158953084]
  AnchorMoE is an interpretable-by-construction classification framework.<n>It encodes multi-view representations of local patches and routes them to specialized experts.<n>Experiments on real-world and synthetic benchmarks demonstrate that AnchorMoE achieves highly competitive classification performance.
  arXiv  Detail & Related papers  (2026-06-02T13:30:54Z)
• Dynamic Spectral Denoising with Global-Context Attention for Multi-Behavior Recommendation [58.33732779555114]
  We argue that the key bottleneck is a representation-level failure caused by two coupled heterogeneities.<n>We propose Dynamic Spectral Denoising with Global-Context Attention for Multi-Behavior Recommendation (SpectraMB)<n>SpectraMB achieves the best results in most evaluation settings and exhibits improved robustness under noisy interactions.
  arXiv  Detail & Related papers  (2026-06-01T15:58:13Z)
• Robust Multimodal Recommendation via Graph Retrieval-Enhanced Modality Completion [71.20734649881258]
  Real-world multimodal datasets often suffer from modality incompleteness due to sensor failures, annotation scarcity, or privacy constraints.<n>One effective solution is modality completion, which reconstructs missing features to provide modality-complete graphs for downstream tasks.<n>We propose GRE-MC, a Graph Retrieval-Enhanced Modality Completion framework, to overcome these limitations.
  arXiv  Detail & Related papers  (2026-05-01T13:50:52Z)
• Weight-Informed Self-Explaining Clustering for Mixed-Type Tabular Data [63.62853416081748]
  WISE is a framework that unifies representation, feature weighting, clustering, and interpretation.<n>It produces faithful, human-interpretable explanations grounded in the same primitives that drive clustering.
  arXiv  Detail & Related papers  (2026-04-07T13:18:31Z)
• FGC-Comp: Adaptive Neighbor-Grouped Attribute Completion for Graph-based Anomaly Detection [0.0]
  FGC-Comp is a lightweight, classifier-agnostic, and deployment-friendly attribute completion module.<n>We partition each node's neighbors into three label-based groups, apply group-specific transforms to the labeled groups, and train end-to-end with a binary classification objective.<n>Experiments on two real-world fraud datasets validate the effectiveness of the approach with negligible computational overhead.
  arXiv  Detail & Related papers  (2025-12-02T12:34:21Z)
• Model-Agnostic Fairness Regularization for GNNs with Incomplete Sensitive Information [11.900835813533135]
  Graph Neural Networks (GNNs) have demonstrated exceptional efficacy in relational learning tasks, including node classification and link prediction.<n>GNNs can perpetuate and even amplify societal biases against protected groups defined by sensitive attributes such as race or gender.<n>We propose a novel, model-agnostic fairness regularization framework designed for the realistic scenario where sensitive attributes are only partially available.
  arXiv  Detail & Related papers  (2025-11-27T15:36:16Z)
• UniMRSeg: Unified Modality-Relax Segmentation via Hierarchical Self-Supervised Compensation [104.59740403500132]
  Multi-modal image segmentation faces real-world deployment challenges from incomplete/corrupted modalities degrading performance.<n>We propose a unified modality-relax segmentation network (UniMRSeg) through hierarchical self-supervised compensation (HSSC)<n>Our approach hierarchically bridges representation gaps between complete and incomplete modalities across input, feature and output levels.
  arXiv  Detail & Related papers  (2025-09-19T17:29:25Z)
• A Noise-Resilient Semi-Supervised Graph Autoencoder for Overlapping Semantic Community Detection [0.0]
  Community detection in networks with overlapping structures remains a significant challenge.<n>We propose a semi-supervised graph autoencoder that combines graph multi-head attention and modularity to robustly detect overlapping communities.<n>Key innovations include a noise-resistant architecture and a semantic semi-supervised design optimized for community quality.
  arXiv  Detail & Related papers  (2025-05-09T11:34:07Z)
• Theoretical Insights in Model Inversion Robustness and Conditional Entropy Maximization for Collaborative Inference Systems [89.35169042718739]
  collaborative inference enables end users to leverage powerful deep learning models without exposure of sensitive raw data to cloud servers.<n>Recent studies have revealed that these intermediate features may not sufficiently preserve privacy, as information can be leaked and raw data can be reconstructed via model inversion attacks (MIAs)<n>This work first theoretically proves that the conditional entropy of inputs given intermediate features provides a guaranteed lower bound on the reconstruction mean square error (MSE) under any MIA.<n>Then, we derive a differentiable and solvable measure for bounding this conditional entropy based on the Gaussian mixture estimation and propose a conditional entropy algorithm to enhance the inversion robustness
  arXiv  Detail & Related papers  (2025-03-01T07:15:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.