Dr. Haoran Yang | Graph Clustering | Outstanding Research Achievement Award
PhD , Tongji University, China📖
Profile
Education Background🎓
Professional Experience🌱
Research Interest🔬
- Graph Neural Networks (GNNs): Focused on developing and optimizing GNN architectures, including deep clustering optimization and graph few-shot learning methods.
- Multimodal Learning: Exploring AI4Science and the integration of multiple data sources for enhanced learning outcomes.
- Graph Mining and Self-Supervised Learning: Aiming to refine the application of self-supervised techniques in graph learning to improve model adaptability and performance in varied data environments.
Author MetricsÂ
Publications Top Notes 📄
- DCOM-GNN: A Deep Clustering Optimization Method for Graph Neural Networks
- Authors: Haoran Yang, Jiao Wang, Rui Duan, Chao Yan
- Published in: Knowledge-Based Systems, Volume 279, Article 110961, 2023
- Abstract:
This paper presents a novel method, DCOM-GNN, designed to optimize deep clustering in graph neural networks (GNNs). The approach targets improving the clustering performance in graph-based learning by incorporating a clustering loss into the GNN framework. The authors focus on enhancing the quality of learned representations while minimizing intra-cluster distances and maximizing inter-cluster distances, leading to more efficient and accurate graph clustering. The method demonstrates its effectiveness through various experimental results on benchmark datasets, showing improvements over existing clustering techniques in GNNs. - Key Contributions:
- Introduction of a deep clustering optimization method specifically for GNNs.
- Formulation of a clustering loss that balances intra-cluster and inter-cluster distances.
- Performance evaluation on multiple graph datasets showing the potential of DCOM-GNN in real-world applications.
- Unifying Homophily and Heterophily for Spectral Graph Neural Networks via Triple Filter Ensembles
- Authors: Haoran Yang, et al.
- Conference: NeurIPS 2024 (Accepted)
- Abstract:
This paper proposes a unified framework to address the challenge of integrating homophily (similarity between neighboring nodes) and heterophily (dissimilarity between neighboring nodes) in spectral graph neural networks (SGNNs). The authors introduce Triple Filter Ensembles, a novel technique that combines multiple filter types to account for both homophilic and heterophilic structures in a graph. The method allows SGNNs to adaptively learn from graphs with varying node relationships, improving model robustness and generalization across diverse graph datasets. - Key Contributions:
- The development of Triple Filter Ensembles to unify homophily and heterophily in SGNNs.
- Enhanced model performance on graph datasets exhibiting mixed node relationships.
- Novel insights into the challenges and solutions for spectral-based GNNs when applied to graphs with both similar and dissimilar neighboring nodes.
Conclusion
Haoran Yang | Graph Clustering | Outstanding Research Achievement Award