Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

Divide-Then-Rule: A Cluster-Driven Hierarchical Interpolator for Attribute-Missing Graphs

Created by
  • Haebom

Author

Yaowen Hu, Wenxuan Tu, Yue Liu, Miaomiao Li, Wenpeng Lu, Zhigang Luo, Xinwang Liu, Ping Chen

Outline

This paper proposes Divide-Then-Rule Graph Completion (DTRGC), a novel method for deep graph clustering (DGC) on graphs with missing attributes. Existing imputation methods for graphs with missing attributes have limitations in that they fail to account for differences in the amount of information between node neighbors. DTRGC addresses this limitation by leveraging three modules: Dynamic Cluster-Aware Feature Propagation (DCFP), Hierarchical Neighborhood-aware Imputation (HNAI), and Hop-wise Representation Enhancement (HRE). DCFP initializes missing node attributes by adjusting propagation weights based on the cluster structure. HNAI hierarchically imputates nodes by classifying them into three groups based on the completeness of their neighboring attributes. Finally, HRE enhances the expressiveness of node representations by integrating information across multiple hops. Experimental results demonstrate that DTRGC significantly improves the clustering performance of various DGC methods on graphs with missing attributes.

Takeaways, Limitations

Takeaways:
We present a novel method (DTRGC) that significantly improves the performance of deep graph clustering on graphs with missing attributes.
More accurate imputation is possible by considering the difference in information amount between node neighbors.
An effective strategy to correct imputation errors by utilizing clustering information is presented.
Excellent performance verification on various graph datasets.
Limitations:
Lack of analysis of the computational complexity of the proposed method.
Lack of performance analysis for specific types of graph structures.
Further research is needed to analyze performance for various attribute missing ratios.
A more comprehensive comparative analysis with other recent imputation methods is needed.
👍